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 |