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

A traveler can go from (A) to (B) by (4) routes, from (B) to (C) by (3) routes, and from (C) to (D) by (5) routes. How many total journeys are possible from (A) to (D)?

Answer and explanation

Correct answer: (60)

The direct answer is option A, 60. The journey must make three consecutive choices: one route from A to B, one from B to C, and one from C to D. The multiplication principle says that when choices are made in successive stages, multiply their numbers. Therefore the total is 4 × 3 × 5 = 12 × 5 = 60. Option A is correct. Option B, 12, multiplies only the first two stages and forgets the five choices from C to D. Option C, 45, is not the product of all three route counts. Option D, 75, also has no valid counting basis and overcounts the journeys. Each complete journey is identified by one choice at every stage, so multiplication—not addition—is required. Memory cue: for an ‘and then’ sequence of independent choices, multiply; addition is used for alternatives, not successive stages.

Related tags

Permutations-And-CombinationsFundamental-PrincipleCountingHard

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.