# Find the minimum number of time in which all three of them will reach the destination ?

+1 vote
304 views

Three friends A,B and C started from P towards Q which is 5km away. They have one cycle and only one person rides a cycle at a time . A , B and C walk at speeds of 4 , 5 and 6 km/hr and can ride the cycle at 7 , 8 and 10 km/hr respectively . Find the minimum number of time in which all three of them will reach the destination ? { All three person will reach when the last person will reach the destination }

posted Jul 17, 2015

50 minutes. A starts with the bike and gives it to B after 33.33 minutes.

To make A and B match their speed, for every hour A cycles (7 km), B walks 5 km. To make up for the 2 km difference, B needs to cycle 1/2 hour ( 4 / 8) covering 4 km, while A walks 2 km during that time.
That makes the average speed of A: 2/3 * 7 + 1/3 * 4 = 6 km/h. For B: 2/3 * 5 + 1/3 * 8 = 6 km/hr. C walks the whole time, so his speed is 6 km/hr.
As the speed of all of them is now identical, it will take them 50 minutes to cover the 5 km.

Similar Puzzles
+1 vote

Mukesh, Suresh and Dinesh travel from Delhi to Mathura to attend Janmasthmi Utsav. They have a
bike which can carry only two riders at a time as per traffic rules. Bike can be driven only by
Mukesh. Mathura is 300km from Delhi. All of them can walk at 15Km/hr. All of them start their
journey from Delhi simultaneously and are required to reach Mathura at the same time. If the speed
of bike 60Km/hr then what is the shortest possible time in which all three can reach Mathura at the
same time.

A man riding a cycle at 12 km/hr can reach a village in 9/2 hours.
If he is delayed by 3/2 hours at the start , then in order to reach his destination in time what should be the speed of his ?

+1 vote

The ratio between the rates of walking of A and B is 2:3 and therefore A takes 10 minute more than the time taken by B to reach the destination.

If A had walked at double the speed, how much time he would have taken to reach the destination.

+1 vote

There are 13 caves arranged in a circle. There is a thief hiding in one of the caves. Each day the the thief can move to any one of of the caves that is adjacent to the cave in which he was staying the previous day. And each day, you are allowed to enter any two caves of your choice.

What is the minimum number of days to guarantee in which you can catch the thief?

Note: Thief may or may not move to adjacent cave. You can check any two caves, not necessarily be adjacent. If thief and you exchange your caves, you will surely cross at some point, and you can catch the thief immediately.