Page 111 - NUMINO Challenge_D1
P. 111
Creative Thinking
1 To solve the Tower of Hanoi, start by
moving the 3 disks from Pole A to
Pole C. Complete the table below to
find the minimum number of moves AB C
needed. Note that The disks are represented by the symbols , ,
and , in order from least to greatest.
Step Drawing Movement
ABC
Start A BC
A BC 1
Step 1 A BC 2
(2 disks are moved to 3
Pole B.) 2
1
Step 2
(The largest disk is 3
moved to Pole C.) 3 21
31
2
Step 3 A BC 1
(The 2 disks from Pole 2
B are moved to Pole C.) 3
2 The following number sequence shows the minimum number of
moves needed to build the Tower of Hanoi. Use the pattern to find
the minimum number of moves needed to move 7 disks.
108 NUMINO Challenge D1
1 To solve the Tower of Hanoi, start by
moving the 3 disks from Pole A to
Pole C. Complete the table below to
find the minimum number of moves AB C
needed. Note that The disks are represented by the symbols , ,
and , in order from least to greatest.
Step Drawing Movement
ABC
Start A BC
A BC 1
Step 1 A BC 2
(2 disks are moved to 3
Pole B.) 2
1
Step 2
(The largest disk is 3
moved to Pole C.) 3 21
31
2
Step 3 A BC 1
(The 2 disks from Pole 2
B are moved to Pole C.) 3
2 The following number sequence shows the minimum number of
moves needed to build the Tower of Hanoi. Use the pattern to find
the minimum number of moves needed to move 7 disks.
108 NUMINO Challenge D1