Tower Math Journal HW

  • Make a chart indicating the number of disks and minimal number of moves for one to five disks.
  • Determine the sequence formula that finds the minimal number of moves for n disks
  • Determine the minimal number of moves for the 64 gold disks in the legend

Write a three-page math journal describing your explorations, processes and solutions for the Tower of Hanoi problem. Include your chart, formula, and the number of moves by the monks. Email me your journal before the next class.


# of disks
# of minimal moves
Pattern
1
          
     
2
     
     
3
     
     
4
     
     
5
     
     
:
:
           
n