Around the world: Difference between revisions

From Math Puzzle Wiki
Jump to navigation Jump to search
Oscarlevin (talk | contribs)
No edit summary
Oscarlevin (talk | contribs)
No edit summary
Line 1: Line 1:
 
A group of airplanes is based on a small island. The tank of each plane holds just enough fuel to take it halfway around the world. Any desired amount of fuel can be transferred from the tank of one plane to the tank of another while the planes are in flight. The only source of fuel is on the island, and it is assumed that there is no time lost in refueling either in the air or on the ground.  What is the smallest number of planes that will ensure the flight of one plane around the world on a great circle, assuming that the planes have the same constant ground speed and rate of fuel consumption, and that all planes return safely to their island base?
{{Needs work}}
 
It goes something like this: you must fly around the world in a plane, but it does not hold enough gas to get you there (how much does it hold?)  However, you have a fleet of these planes, and they are able to refuel each other at any point.  What is the least number of planes you would need to make the trip.





Revision as of 11:16, 4 June 2010

A group of airplanes is based on a small island. The tank of each plane holds just enough fuel to take it halfway around the world. Any desired amount of fuel can be transferred from the tank of one plane to the tank of another while the planes are in flight. The only source of fuel is on the island, and it is assumed that there is no time lost in refueling either in the air or on the ground. What is the smallest number of planes that will ensure the flight of one plane around the world on a great circle, assuming that the planes have the same constant ground speed and rate of fuel consumption, and that all planes return safely to their island base?