Darren has 16 motorbikes with a tank that has a capacity to go 100 miles (when the tank is full).
→ All the motorbikes are initially fully fueled.
→ Each start from the same point.
→ Each bike has a rider on it.
Using these 16 motorbikes optimally, determine the maximum distance that Darren can travel.
Note:
It is not necessary for all the bikers to reach at that final point.
(In reply to
Solution by Larry)
In fact, Larry is suggesting something similar to the way in which rocket stages are utilised.
The optimal solution works as follows:
After 100/17 miles, each tank is 16/17 full. Split the tank contents of bake #16 among the other 15 bikes. These bikes 15 each now have a full tank.
After another 100/16 miles, each tank among the remaining 15 bikes is 15/16 full. Split the tank contents of bike #15 among the remaining 14 bikes. These 14 bikes each now have a full tank.
And so on.
The distance covered is 100 miles * ( 1/17 + 1/16 + ...+ 1/1). In decimal this is just over 337 and one quarter miles.
Now, how is Larry going to get home for lunch?
|
|
Posted by FrankM
on 2022-12-27 15:05:02 |
re: Solution
