Scribe Post

Today we created our own version of the Tower of Hanoi, a famous math puzzle created by a French mathematician over 100 years ago. Go here to see and try an online version.

By trial and error, we found that the minimum number of moves for 3 disks is 7, and the minimum number for 4 disks is 15.

The original problem, from the 19th century, was to move 8 disks. Supposedly, we can use our results for the 3 and 4-disk problem to find the number of moves for the 8-disk problem. Mr. A asked us to think about this problem, try to come up with an approach, and then post our solutions to this blog.

He also told us that he is no longer collecting homework. Yippeee!!

Instead, we will get a blog grade and he started explaining the whole blog process. We will learn more about this on Wednesday (bridge building all day tomorrow) . He told us to come here for our 1st blog assignment.

That's it. I'm going to go complete my blog homework right now!


Just your average talented, motivated, and happy precalculus student.