Home › CAT › Quantitative Aptitude › Permutations and Combinations › Find the number of ways a person can travel from…
Find the number of ways a person can travel from city A to city C if there are 3 routes from A to B and 2 routes from B to C.
A$3 + 2 = 5$
B$3 \cdot 2 = 6$
C$3!/2! = 3$
D$\binom{3}{2} = 3$
Answer & Solution
Correct answer: B. $3 \cdot 2 = 6$
1. This is a classic application of the MULTIPLICATION (counting) PRINCIPLE.
2. To complete the trip A → B → C, you must make BOTH choices: a route from A to B AND a route from B to C.
3. Independent choices: $3$ ways for first leg, $2$ ways for second.
4. Total ways: $3 \cdot 2 = 6$.
5. ADDITION applies when the EVENTS are alternatives (do X or do Y); MULTIPLICATION applies when both events must happen sequentially.
6. Option A uses addition (would count if you could only do one leg). Options C and D have no relevance.
_Source: NCERT Class 11 Mathematics, Ch 6, §6.2 (Fundamental Principle of Counting), p. 2–4._
Related questions
Signals using exactly 4 flags out of those 5 different flags number:Signals using exactly 3 flags out of 5 different flags number:Three digit even numbers from the digits 1 to 6, with repetition allowed, number:The number of ways to arrange all 5 different flags on a staff is:The relation linking arrangements and selections of r objects from n is nPr equals:Permutations of n objects where p are alike and the rest all differ number:The number of permutations of n different objects taken r at a time, with no repetition, iThe value of 6 factorial is: