Investigate!

There is a monastery in Hanoi, as the legend goes, with a great hall containing three tall pillars. Resting on the first pillar are 64 giant disks (or washers), all different sizes, stacked from largest to smallest. The monks are charged with the following task: they must move the entire stack of disks to the third pillar. However, due to the size of the disks, the monks cannot move more than one at a time. Each disk must be placed on one of the pillars before the next disk is moved. And because the disks are so heavy and fragile, the monks may never place a larger disk on top of a smaller disk. When the monks finally complete their task, the world shall come to an end. Your task: figure out how long before we need to start worrying about the end of the world.

  1. First, let's find the minimum number of moves required for a smaller number of disks. Collect some data. Make a table.

  2. Conjecture a formula for the minimum number of moves required to move \(n\) disks. Test your conjecture. How do you know your formula is correct?

  3. If the monks were able to move one disk every second without ever stopping, how long before the world ends?

in-context