- 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
disks*n* - Determine the minimal number of moves for the 64 gold disks in the legend
Write a three-page math journal |

#
of disks |
#
of minimal moves |
Pattern |

1 |
||

2 |
||

3 |
||

4 |
||

5 |
||

:: |
||

n |