• Join over 1.2 million students every month
• Accelerate your learning by 29%
• Unlimited access from just £6.99 per month
Page
1. 1
1
2. 2
2
3. 3
3
4. 4
4
5. 5
5
• Level: GCSE
• Subject: Maths
• Word count: 1252

# Investigating Towers of Hanoi Mathematics coursework

Extracts from this document...

Introduction

Investigating Towers of Hanoi
Mathematics coursework

Surname: Thomas
First name: Jawhari

Candidate no: 7160
Centre no: 14368

The legend

In an ancient city in a temple monks were given the task of moving a pile of 64 sacred disks from one location to another. The disks are fragile; only one can be carried at a time. A disk may not be placed on top of a smaller, less valuable disk. And, there is only one other location in the temple, (besides the original and destination locations) sacred enough that a pile of disks can be placed there. The monks start moving disks back and forth, between the original pile, the pile at the new location, and the intermediate location, always keeping the piles in order (largest on the bottom, smallest on the top). The legend is that, before the monks make the final move to complete the new pile in the new location, the temple will turn to rubble and the world will end.

The Game.

There's a game based on this legend. You have collection of disks and three piles into which you can place them.

Middle

1. Pile of 1, 1 move = 1-c.
2. Pile of 2, 3 moves = 1-b, 2-c, 1-c.
3. Pile of 3, 7 moves = 1-c, 2-b, 1-b, 3-c, 1-a, 2-c, 1-c.
1. Pile of 4, 15 moves = 1-b, 2-c, 1-c, 3-b, 1-a, 2-b, 1-b, 4-c, 1-c, 2-a, 1-a, 3-c, 1-b, 2-c, 1-c.
2. Pile of 5, 31 moves = 1-c, 2-b, 1-b, 3-c, 1-a, 2-c, 1-c, 4-b, 1-b, 2-a, 1-a, 3-b, 1-c, 2-b, 1-b, 5-c, 1-a, 2-c, 1-c, 3-d, 1-b, 2-a, 1-a, 4-c, 1-c, 2-b, 1-b, 3-c, 1-a, 2-c, 1-c.
3. Pile of 6, 63 moves = 1-b, 2-c, 1-c, 3-b, 1-a, 2-b, 1-b, 4-c, 1-c, 2-a, 1-a, 3-c, 1-b, 2-c, 1-c, 5-b, 1-a, 2-b, 1-b, 3-a, 1-c, 2-a, 1-a, 4-b, 1-b, 2-c, 3-b, 1-a, 2-b, 1-b, 6-c, 1-3, 2-a, 1-a, 3-c, 1-b, 2-c, 1-c, 4-a, 1-a, 2-b, 1-b, 3-a, 1-c, 2-a, 1-a, 5-c, 1-b, 2-a, 1-c, 3-b, 1-a, 2-b, 1-b, 4-c, 1-c, 2-a, 1-a, 3-c, 1-b, 2-c, 1-c
4. Pile of 7, 127 moves = 1-c, 2-b, 1-b, 3-c, 1-a, 2-c, 1-c, 4-b, 1-b, 2-a, 1-a, 3-b, 1-c, 2-b, 1-b, 5-c, 1-a, 2-c, 1-c, 3-a, 1-b, 2-a, 1-a, 4-c, 1-c, 2-b, 1-b, 3-c, 1-a, 2-c, 1-c, 6-b, 1-b, 2-a, 1-a, 3-b, 1-

Conclusion

Therefore, you now have a procedure for legally moving all n+1 disks to their new destination: follow the procedure I devised before, instead of moving the top n disks as a unit, I must use the legal amount of moves required to achieve the same effect. (In the example this will be 15+1+15)
In other words: if (x) is the minimum number of turns it takes to move n disks from one post to another, then  (x+1) = 2 (x) - 1.
I can prove that this is correct because the bottom disk will have to be moved sooner or later.

Conclusion
The formula a (x+1) = 2 a (x) + 1 seems fine, but the formula I need is one that only needs the number of towers (I have mentioned it above). I know that this formula is correct because 2a+1 (which is the least legal amount of moves that can be made to move 3 towers multiplied by 2+1) is 23-1.
\ 2n-1 must be the formula!

This student written piece of work is one of many that can be found in our GCSE Pythagorean Triples section.

## Found what you're looking for?

• Start learning 29% faster today
• 150,000+ documents available
• Just £6.99 a month

Not the one? Search for your essay title...
• Join over 1.2 million students every month
• Accelerate your learning by 29%
• Unlimited access from just £6.99 per month

# Related GCSE Pythagorean Triples essays

1. ## Maths GCSE coursework: Beyond Pythagoras

1 x 2n� = 2n� We now have 4n� + 2n + 4n� + 2n� which simplified is: 4n� + 6n� + 2n but it doesn't finish yet because we have to half it to keep with the formula to work out the area using the middle and small numbers.

2. ## Dice Game

This frequency graph shows each round will normally take between 2 and 3 rolls of the dice to produce a winner. This also coincides with what I have said about the being most likely to be won in the first round.

1. ## Investigating families of Pythagorean triples.

When factorised, it is: 4 ( 2n + 3 ) The second difference between the numbers in column b is 4, meaning the formula starts with: 4n2 By adding: 12n + 5 To the formula, b is proved correct: 4n2 + 12n + 5 Or ( 2n + 5 )( 2n + 1 )

2. ## Maths Number Patterns Investigation

There is only a difference of +1 between 2n and the shortest side, so this means the formula should be 2n+1. To see if I�m correct, I will now test this formula. The Shortest side and 2n+1 columns match meaning that: Shortest Side = 2n+1 The next formula I need to work out is the formula for the middle side.

1. ## For this piece of work I am investigating Pythagoras. Pythagoras was a Greek mathematician.

(even x even = even) (odd x odd = odd) From the previous equation we can work out that b = (a�-1)/2 The three sides are a, b and b +1 where a is an odd number. Now I will produce a table with the results.

2. ## Beyond Pythagoras - Pythagorean Triples

32 50 R2 - R3 2 4 6 8 10 Difference 2 2 2 2 I have found the nth term formula to be 2n2 + 2n This can also be expressed in the form of triangle numbers because: (b)

1. ## Investigate the area of triangle studies including the Pythagorean Theorem and in particular Pythagorean ...

i.e Middle number + Largest number 81 = Middle number + Largest number I know that there will be only a difference of one between the middle number and the largest number.

2. ## Maths Investigation: Number of Sides

Middle Side = 24, Largest Side =25. This matches the answers I already have with 7 being the shortest side, so I think that this equation works. I now believe I can fill out a table containing the Shortest, Middle and longest sides, by using the odd numbers starting from 3.

• Over 160,000 pieces
of student written work
• Annotated by
experienced teachers
• Ideas and feedback to