Tue
Mar
30
Tuesday Teaser #14
Imagine that I live on a small Indonesian island on the equator, where I own a fleet of 100 identical planes. It has been a life-long ambition of mine to fly along the equator all the way around the world. Assume the following rules:
- Each plane has a fuel tank that, when at maximum capacity, can contain enough fuel to fly exactly half-way around the world.
- All of the planes travel at the same speed, and use their fuel at the same rate.
- Planes can exchange fuel (instantaneously) with other planes while in flight.
- The island is the only source of fuel.
- Whether on the air or ground, planes refuel instantaneously.
- Planes can land, take off, and change direction instantaneously.
- All planes must make it back to the island safely.
- Planes cannot land anywhere except the island.
Given these rules, what is the lowest number of planes required to allow one plane to carry me along the equator all the way around the world?
Credit for this puzzle goes to Blinkdagger’s Monday Math Madness series. This particular problem was won by my friend Tom Mayo.
