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.

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A 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.

$A l b e r t c h o s e p a t h 2 f r o m A t o 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

Similar questions

Q. A motorist knows four different routes from Bristol to Birmingham. From Birmingham to Sheffield he knows three different routes and from Sheffield to Carlisle he knows two different routes. How many routes does he know from Bristol to Carlisle?

Q. A motorist knows four different routes from Kota to Jaipur. From Jaipur to Delhi he knows three different routes and Delhi to Ranchi he knows two different routes. How many routes does he know from Kota to Ranchi ?

Q. A car driver knows four different routes from Delhi to Amristsar to pathankot he knows three different routes and from pathankot to jammu he knows two different routes How many routes does he know from Delhi to jammu?

Sham can take any one of three routes from school (S) to the town center (T), and can then take four possible routes from the town center to his home (H). He doesn't retrace his steps.
How many different possible ways can Sham walk home from school?

Q. There are 15 buses running between two towns. In how many ways can a man go to one town and return by a different bus?

Join BYJU'S Learning Program

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.