Page 108 - NUMINO Challenge_D1

Problem solving

1 To solve the Tower of Hanoi, find the minimum Key Points
number of moves needed to move 5 disks to
another pole. Move 4 disks first.
Then move the
largest disk to
another pole.

2 The following drawings show how to move 3 Color the blocks to
blocks on one side of the triangle to another show where the
side. Complete the drawings and find the triangle blocks
minimum number of moves needed. move.

AA A ABC

C Start B C Step 1 B C Step 2 B

AA A

C Step 3 B C Step 4 B C Step 5 B
AA

C Step 6 B C Step 7 B

105Number Theory