Presentation is loading. Please wait.

Presentation is loading. Please wait.

By Katie Dzerovych Jon Wood JB Henderson Mentor Professor Snapp.

Similar presentations

Presentation on theme: "By Katie Dzerovych Jon Wood JB Henderson Mentor Professor Snapp."— Presentation transcript:

1 By Katie Dzerovych Jon Wood JB Henderson Mentor Professor Snapp

2 Puzzle A game, toy, or problem designed to test ingenuity or knowledge.

3 History The first puzzle found was an Egyptian document, the Rhind Mathematical Papyrus, that is over 3,600 years old There were 85 different puzzles in the papyrus One puzzle is: Seven houses contain seven cats. Each cat kills seven mice. Each mouse had eaten seven ears of grain. Each ear of grain would have produced seven hekats of wheat. What is the total of all of these? Archimedes invented a division of a square into 14 pieces leading to a game similar to Tangrams, Stomachion, involving making figures from the 14 pieces

4 Quick Puzzles ss/OutOfGlass.htm ss/OutOfGlass.htm /CrazyCut.htm /CrazyCut.htm TheSquares/CountingTheSquares.htm TheSquares/CountingTheSquares.htm

5 Tower of Hanoi Must transfer the tower of disks from one end peg to the other end peg The only rule is you cannot place a larger disk over a smaller disk Depending on the number of disks what is the least possible moves to make this work

6 History of the Tower of Hanoi Created by French mathematician, Edouard Lucas, in 1883 Based on the legend of a Hindu temple where the puzzle was used as mental discipline for young priests The legend says that since the beginning of time the priests in the temple were giving a stack of 64 gold disks one each a little smaller than the one below it The priests were to transfer the 64 disks from one of the three poles to another, the only rule they had was that a larger disk could never be on top of a smaller disk The legend says that when they finish the temple will crumble and the world will end

7 Tower of Hanoi Game game71.html game71.html

8 Equation for Tower of Hanoi The number of moves grows exponentially with the number of disks used If n is the number of disks and M is the number of moves M=2 n -1

9 Homework The legend of Hanoi says that there were 64 disks the priests would have to move before the world would end, how long would it take the priests to move the disks if it took them one second a move?

10 Works Cited O'Connor, J., and E. Robertson. "Mathematical Games and Recreations." May 1996. Web. 30 Nov. 2011.. Tower of Hanoi. Digital image. WTS. 2007. Web. 30 Nov. 2011.. Belluck, Pam. "Ancient Egyptians Mathematical Ingenuity, Written on Papyrus -" The New York Times - Breaking News, World News & Multimedia. 06 Dec. 2010. Web. 30 Nov. 2011.. "LHS: Tower of Hanoi Facts." Lawrence Hall of Science. Web. 30 Nov. 2011.. Petković, Miodrag. Famous Puzzles of Great Mathematicians. Providence, RI: American Mathematical Society, 2009.

Download ppt "By Katie Dzerovych Jon Wood JB Henderson Mentor Professor Snapp."

Similar presentations

Ads by Google