Oct. 23/08 Per. B 9 Math

Today we continued our exploration of exponents by tackling the Tower of Hanoi problem. Our goal was to find a pattern and then use that pattern to predict solutions to the problem for any number of disks. 

We started off by solving the problem for 2 disks and worked our way up to 6. At that point we had a pattern so we tried to expand on it a bit.

We used laptops in class and each pair of students shared a laptop in solving this problem. 

How long would it take to solve the Monk's problem of 64 disks?