Whiteboardmaths.com © 2004 All rights reserved

Story The Tower of Hanoi Edouard Lucas (1884) Probably In the temple of Banares, says he, beneath the dome which marks the centre of the World, rests a brass plate in which are placed 3 diamond needles, each a cubit high and as thick as the body of a bee. On one of these needles, at the creation, god placed 64 discs of pure gold, the largest disc resting on the brass plate and the others getting smaller and smaller up to the top one. This is the tower of brahma. Day and night unceasingly the priests transfer the discs from one diamond needle to another according to the fixed and immutable laws of brahma, which require that the priest on duty must not move more than one disc at a time and that he must place this disc on a needle so that there is no smaller disc below it. When the 64 discs shall have been thus transferred from the needle on which at the creation god placed them to one of the other needles, tower, temple and Brahmans alike will crumble into dust and with a thunder clap the world will vanish.

The Tower of Hanoi ABC 5 Tower Illegal Move

The Tower of Hanoi ABC 5 Tower

Demo 3 tower The Tower of Hanoi ABC 3 Tower

The Tower of Hanoi ABC 3 Tower

The Tower of Hanoi ABC 3 Tower

The Tower of Hanoi ABC 3 Tower

The Tower of Hanoi ABC 3 Tower

The Tower of Hanoi ABC 3 Tower

The Tower of Hanoi ABC 3 Tower

The Tower of Hanoi ABC 3 Tower 7 Moves

The Tower of Hanoi Confirm that you can move a 3 tower to another peg in a minimum of 7 moves. Investigate the minimum number of moves required to move different sized towers to another peg. Try to devise a recording system that helps you keep track of the position of the discs in each tower. Try to get a feel for how the individual discs move. A good way to start is to learn how to move a 3 tower from any peg to another of your choice in the minimum number of 7 moves. Record moves for each tower, tabulate results look for patterns make predictions (conjecture) about the minimum number of moves for larger towers, 8, 9, 10,……64 discs. Justification is needed. How many moves for n disks? Investigation

4 Tower show The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower

The Tower of Hanoi ABC 4 Tower 15 Moves

5 Tower show The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower

The Tower of Hanoi ABC 5 Tower 31 Moves

Results Table ? The Tower of Hanoi Discs 1 Moves n ? } U n = 2U n This is called a recursive function. 2 n Why does it happen? How long would it take at a rate of 1 disc/second? Can you find a way to write this indexed number out in full?

Can you use your calculator and knowledge of the laws of indices to work out 2 64 ? 2 64 = 2 32 x x – 1 = 5

Millions Billions Trillions Moves needed to transfer all 64 discs. How long would it take if 1 disc/second was moved? The age of the Universe is currently put at between 15 and years. Seconds in a year.

Results Table The Tower of Hanoi U n = 2U n This is called a recursive function Discs 1 Moves n2 n - 1 We can never be absolutely certain that the minimum number of moves m(n) = 2 n – 1 unless we prove it. How do we know for sure that the rule will not fail at some future value of n? If it did then this would be a counter example to the rule and would disprove it. The proof depends first on proving that the recursive function above is true for all n. Then using a technique called mathematical induction. This is quite a difficult type of proof to learn so I have decided to leave it out. There is nothing stopping you researching it though if you are interested.

n RegionsPoints n-1 A counter example!

Histori cal Note The Tower of Hanoi was invented by the French mathematician Edouard Lucas and sold as a toy in It originally bore the name of”Prof.Claus” of the college of “Li-Sou-Stain”, but these were soon discovered to be anagrams for “Prof.Lucas” of the college of “Saint Loius”, the university where he worked in Paris. Edouard Lucas ( ) Lucas studied the Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, 21,… (named after the medieval mathematician, Leonardo of Pisa). Lucas may have been the first person to derive the famous formula for the nth term of this sequence involving the Golden Ratio: … ½ (1 +  5). Lucas also has his own related sequence named after him: 2,1,3,4,7,11,… He went on to devise methods for testing the primality of large numbers and in 1876 he proved that the Mersenne number – 1 was prime. This remains the largest prime ever found without the aid of a computer. ( ) – 1 = 170,141,183,460,469,231,731,687,303,715,884,105,727 Lucas/Binet formula

Kings Chessboard According to an old legend King Shirham of India wanted to reward his servant Sissa Ban Dahir for inventing and presenting him with the game of chess. The desire of his servant seemed very modest: “Give me a grain of wheat to put on the first square of this chessboard, and two grains to put on the second square, and four grains to put on the third, and eight grains to put on the fourth and so on, doubling for each successive square, give me enough grain to cover all 64 squares.” “You don’t ask for much, oh my faithful servant” exclaimed the king. Your wish will certainly be granted. Based on an extract from “One, Two, Three…Infinity, Dover Publications. The King’s Chessboard

n n th How many grains of wheat are on the chessboard? The sum of all the grains is: S n = ………….+ 2 n n-1 We need a formula for the sum of this Geometric series. If S n = ………….+ 2 n n-1 2S n = ? ………….+ 2 n n 2S n – S n = ? 2 n S n = 2 n The King has a problem.

= = = = = = = = = Reading Large Numbers The numbers given below are the original (British) definitions which are based on powers of a thousand. They are easier to remember however if you write them as powers of a million. They are mostly obsolete these days as the American definitions (smaller) apply in most cases. Million Billion* Trillion Quadrillion Quintillion Sextillion Septillion = = = (American Trillion) * The American billion is = and is the one in common usage. A world population of 6.4 billion means Upper limit of a scientific calculator. Large numbers

M BTQQ S One hundred and seventy sextillion, one hundred and forty one thousand, one hundred and eighty three quintillion, four hundred and sixty thousand, four hundred and sixty nine quadrillion, two hundred and thirty one thousand, seven hundred and thirty one trillion, six hundred and eighty seven thousand, three hundred and three billion, seven hundred and fifteen thousand, eight hundred and eighty four million, one hundred and five thousand, seven hundred and twenty seven. Edouard Lucas ( ) – 1 = Reading very large numbers To read a very large number simply section off in groups of 6 from the right and apply Bi, Tri, Quad, Quint, Sext, etc.

Reading very large numbers To read a very large number simply section off in groups of 6 from the right and apply Bi, Tri, Quad, Quint, Sext, etc. Try some of these M B T Q M B T Q Q M B T Q Q SM B T Q Q S S

Upper limit of a scientific calculator. How big is a Googol? followed by 100 zeros Googol The googol was introduced to the world by the American mathematician Edward Kasner ( ). The story goes that when he asked his 8 year old nephew, Milton, what name he would like to give to a really large number, he replied “googol”. Kasner also defined the Googolplex as 10 googol, that is 1 followed by a googol of zeros. Do we need a number this large? Does it have any physical meaning?

How big is a Googol? followed by 100 zeros Google We saw how big 2 64 was when we converted that many seconds to years:  years. What about a googol of seconds? Who many times bigger is a googol than 2 64 ? Use your scientific calculator to get an approximation.

Earth Mass = 5.98 x g Hydrogen atom Mass = 1.67 x g Upper limit of a scientific calculator. How big is a Googol? Supposing that the Earth was composed solely of the lightest of all atoms (Hydrogen), how many would be contained within the planet? The total number of a atoms in the universe has been estimated at

Is there a quantity as large as a Googol? Find all possible arrangements for the sets of numbered cards below. 1 1, 2 2, 1 3, 1, 2 1, 3, 2 1, 2, 3 3, 2, 1 2, 3, 1 2, 1, 3 4, 3, 1, 2 3, 4, 1, 2 3, 1, 4, 2 3, 1, 2, 4 4, 1, 3, 2 1, 4, 3, 2 1, 3, 4, 2 1, 3, 2, 4 4, 1, 2, 3 1, 4, 2, 3 1, 2, 4, 3 1, 2, 3, 4 4, 3, 2, 1 3, 4, 2, 1 3, 2, 4, 1 3, 2, 1, 4 4, 2, 3, 1 2, 4, 3, 1 2, 3, 4, 1 2, 3, 1, 4 4, 2, 1, 3 2, 4, 1, 3 2, 1, 4, 3 2, 1, 3, What about if 5 is introduced.Can you see what will happen? Can you write the number of arrangements as a product of successive integers? Objectsarrangements n! x x 2 x x 3 x 2 x x 4 x 3 x 2 x 1 n! is read as n factorial). Factorials

Is there a quantity as large as a Googol? The number of possible arrangements of a set of n objects is given by n! (n factorial). As the number of objects increase the number of arrangements grows very rapidly. How many arrangements are there for the books on this shelf? 8! = How many arrangements are there for a suit in a deck of cards? 13! =

Is there a quantity as large as a Googol? The number of possible arrangements of a set of n objects is given by n!.(n factorial) As the number of objects increases the number of arrangements grows very rapidly. 26! = 4 x ! = 2.1 x How many arrangements are there for the letters of the Alphabet? A B C D E F G H I J K L M N O P Q R S T U V W X Y Z How many arrangements are there for placing the numbers 1 to 16 in the grid?

Find other factorial values on your calculator. What is the largest value that the calculator can display? 70!  = Googol 20!2.4 x !2.7 x !8.2 x !3.0 x !8.3 x !1.7 x !Error 52!8.1 x So although a googol of physical objects does not exist, if you hold 70 numbered cards in your hand you could theoretically arrange them in a googol number of ways. (An infinite amount of time of course would be needed). Is there a quantity as large as a Googol? The number of possible arrangements of a set of n objects is given by n!.(n factorial) As the number of objects increases the number of arrangements grows very rapidly.

The table shown gives you a feel for how truly unimaginable this number is! What about a Googolplex? A number so big that it can never be written out in full! There isn’t enough ink,time or paper. Googolplex

And Finally

………………… digits on a page. How many pages needed? The End!

The Tower of Hanoi In the temple of Banares, says he, beneath the dome which marks the centre of the World, rests a brass plate in which are placed 3 diamond needles, each a cubit high and as thick as the body of a bee. On one of these needles, at the creation, god placed 64 discs of pure gold, the largest disc resting on the brass plate and the others getting smaller and smaller up to the top one. This is the tower of brahma. Day and night unceasingly the priests transfer the discs from one diamond needle to another according to the fixed and immutable laws of brahma, which require that the priest on duty must not move more than one disc at a time and that he must place this disc on a needle so that there is no smaller disc below it. When the 64 discs shall have been thus transferred from the needle on which at the creation god placed them to one of the other needles, tower, temple and Brahmans alike will crumble into dust and with a thunder clap the world will vanish. Worksheets

ABC The Tower of Hanoi

Confirm that you can move a 3 tower to another peg in a minimum of 7 moves. Investigate the minimum number of moves required to move different sized towers to another peg. Try to devise a recording system that helps you keep track of the position of the discs in each tower. Try to get a feel for how the individual discs move. A good way to start is to learn how to move a 3 tower from any peg to another of your choice in the minimum number of 7 moves. Record moves for each tower, tabulate results look for patterns make predictions (conjecture) about the minimum number of moves for larger towers, 8, 9, 10,……64 discs. Justification is needed. How many moves for n disks? Tower of Hanoi

n RegionsPoints

Reading very large numbers To read a very large number simply section off in groups of 6 from the right and apply Bi, Tri, Quad, Quint, Sext, etc. Try some of these