Around the world: Difference between revisions

From Math Puzzle Wiki
Jump to navigation Jump to search
Oscarlevin (talk | contribs)
Created page with '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 muc…'
 
Oscarlevin (talk | contribs)
No edit summary
Line 1: Line 1:
This is a nice optimization problem.


==Puzzle==
{{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.
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.


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

Revision as of 09:30, 12 May 2010

This page 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.