IM Alg2.1.1 Lesson: A Towering Sequence
Here is a rule for making a list of numbers: Each number is 1 less than twice the previous number.
Pick a number to start with, then follow the rule to build a list of 5 numbers.
In the Tower of Hanoi puzzle, a set of discs sits on a peg, while there are 2 other empty pegs.
- Only move 1 disc at a time.
- Never put a larger disc on top of a smaller one.
You complete the puzzle by building the complete tower on a different peg than the starting peg.
Using 3 discs, complete the puzzle. What is the smallest number of moves you can find?
Using 4 discs, complete the puzzle. What is the smallest number of moves you can find?
Jada says she used the solution for 3 discs to help her solve the puzzle for 4 discs. Describe how this might happen.
How many moves do you think it will take to complete a puzzle with 5 discs?
How many moves do you think it will take to complete a puzzle with 7 discs?
A legend says that a Tower of Hanoi puzzle with 64 discs is being solved, one move per second. How long will it take to solve this puzzle?
Some checkers are lined up, with blue on one side, red on the other, and with one empty space between them.
Drag the checkers to move them.
Using 1 checker on each side, complete the puzzle. What is the smallest number of moves needed?
Using 3 checkers on each side, complete the puzzle. What is the smallest number of moves needed?
Make guesses about the number of moves for 2 and 4 checkers on each side, then test your guesses.
Noah says he used the solution for 3 checkers on each side to help him solve the puzzle for 4 checkers. Describe how this might happen.
How many moves do you think it will take to complete a puzzle with 7 checkers on each side?