Update

Muft Shiksha™ एक 100% Free Education Portal है 🇮🇳, जिसका उद्देश्य Class 9–12 के हर विद्यार्थी तक High-Quality Education को पूरी तरह मुफ्त पहुँचाना है। 🇮🇳 हम मानते हैं कि अच्छी शिक्षा किसी student की आर्थिक स्थिति पर निर्भर नहीं होनी चाहिए। 🇮🇳 हर विद्यार्थी को वही Quality Study Material, MCQs, Quizzes, Exam Preparation, Concept-Based Learning और Bilingual Support मिलना चाहिए, जो आमतौर पर महंगी Coaching या Premium Platforms में मिलता है। Muft Shiksha™ 🇮🇳 इसी सोच के साथ बनाया गया है

Subjects
0 reads0 ratings0 helpful

There are (4) routes from (P) to (Q) and (5) routes from (Q) to (R). A person goes from (P) to (R) and returns to (P), but must not use the same (P) to (Q) route and the same (Q) to (R) route on return. How many ways are possible?

Answer and explanation

Correct answer: (240)

Going has (4 \times 5) ways and returning has (3 \times 4) ways. Multiply independent journey stages.

Related tags

RoutesCountingFundamental-PrincipleFundamental Principle Of CountingPermutations And CombinationsMathematicsClass 11 Mcq

Was this question useful?

No ratings yetWrite a review / Rate this question

Student Reviews

No published reviews yet.

Add Muft Shiksha to your Home Screen

In Safari, tap Share, then Add to Home Screen.