Around the world: Difference between revisions

From Math Puzzle Wiki
Jump to navigation Jump to search
Zerrakhi (talk | contribs)
No edit summary
Mrd000 (talk | contribs)
Undo revision 1396 by Mrd000 (talk) (realised how it works)
 
(8 intermediate revisions by 4 users not shown)
Line 1: Line 1:
[[File:Airplane Silhouette R.svg|right|150px]]
==Puzzle==
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 speed (relative to the ground) and rate of fuel consumption, and that all planes return safely to their island base?
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 speed (relative to the ground) and rate of fuel consumption, and that all planes return safely to their island base?


Line 72: Line 76:
This involves a total of six flights: one main, five returning. But by the time the eastern assisting flights have to depart, the western assisting flights have returned to the island. So the same aeroplanes can be re-used for the eastern assisting flights, reducing the number of aeroplanes needed by two.
This involves a total of six flights: one main, five returning. But by the time the eastern assisting flights have to depart, the western assisting flights have returned to the island. So the same aeroplanes can be re-used for the eastern assisting flights, reducing the number of aeroplanes needed by two.


Therefore the puzzle can be solved with a total of four aeroplanes, including the main one. But certainly no fewer. Nothing is wasted in the above scenario, which confirms that it is the optimal solution. }}
Therefore the puzzle can be solved with a total of four aeroplanes, including the main one. But certainly no fewer. Nothing is wasted in the above scenario, which confirms that it is the optimal solution.
 
---
 
Here is a solution involving only three planes, including the one around the world (call this one the "main plane").  Two planes (Plane 1 and Plane 2) escort the main plane, all fully fueled.  At 1/8 of the way around the world, Plane 1 fills up Plane 2 and the main plane, then returns to the island.  At 1/4 of the way, Plane 2 fills up the main plane and returns to the island.  At half way around, Plane 1, fully fueled, takes off again, now in the opposite direction as previously.  When it meets the main plane, which is now 3/4 of the way around the world, Plane 1 gives the main plane 1/4 of a tank.  They both fly toward the island, and a fully fueled Plane 2 leaves the island, flying toward them.  Halfway through their return (so the main plane is now 7/8 the way around the world), Plane 2 meets them and gives each 1/4 of a tank.  All three planes can now safely return to the island.}}


[[Category: Optimization puzzles]]
[[Category: Optimization puzzles]]
[[Category: Geometry]]
[[Category: Geometry]]

Current revision as of 15:40, 24 January 2021

Puzzle

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 speed (relative to the ground) and rate of fuel consumption, and that all planes return safely to their island base?

Solution