1
Question
Albert trains by running through several small towns.
He runs on two different routes from town A to B. He knows three different running routes from B to C.
Find how many different paths he knows from A to C.
Albert trains by running through several small towns.
He runs on two different routes from town A to B. He knows three different running routes from B to C.
Find how many different paths he knows from A to C.
Open in App
Solution
The correct option is B 6
There are 2 different routes from A to B and 3 different routes from B to C.
He can reach C by running through any of the three routes, i.e., (1, 3) (1, 4), and (1, 5).
Thus, he has 3 routes from A to C if he chooses path 1.
Albert chose path 2 from A to B:
He can reach C by running through any of the three routes, i.e., (2, 3), (2, 4), and (2, 5).
Thus, he has 3 routes from A to C if he chooses path 2.
Total routes Albert knows from A to C = 3 + 3 = 6
Thus, Albert knows 6 routes from A to C.
There are 2 different routes from A to B and 3 different routes from B to C.
He can reach C by running through any of the three routes, i.e., (1, 3) (1, 4), and (1, 5).
Thus, he has 3 routes from A to C if he chooses path 1.
Albert chose path 2 from A to B:
He can reach C by running through any of the three routes, i.e., (2, 3), (2, 4), and (2, 5).
Thus, he has 3 routes from A to C if he chooses path 2.
Total routes Albert knows from A to C = 3 + 3 = 6
Thus, Albert knows 6 routes from A to C.
Suggest Corrections
0
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
