Around the world
From Math Puzzle Wiki
Revision as of 18:17, 5 April 2010 by Oscarlevin (talk | contribs)
This is a nice optimization problem.
Puzzle
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.
