Page 162 - NUMINO Challenge_D1

3 The number sequence is a Fibonacci sequence. Problem solving

So, if the number after 1 is , the number after 1 The minimum number of moves needed to move

that is 1 . The number 7 is the sum of the 2 5 disks 5 is 4 1 4 15 1 15 31.

previous numbers, so 1 7. Since is 3,

the numbers in the blanks are 3, 4, 11, and 18.

4 The number of stones Dan receives follows a Start Step 1
4
Fibonacci sequence.
Step 2 Step 3
Step 1 2 3 4 5 6 7 8 9 10
Stones 1 1 2 3 5 8 13 21 34 55 14
55 stones

12 Tower of Hanoi and Pascal's Triangle p.102~p.103 2A A A

Example 3 C Start B C Step 1 B C Step 2 B

AA A

Example 3, sum 1, 4, 5

6th Row 1 5 10 10 5 1 C Step 3 B C Step 4 B C Step 5 B
7th Row 1 6 15 20 15 6 1 AA
8th Row 1 7 21 35 35 21 7 1

Try It Again 1 8 28 56 70 70 28 8 1 C Step 6 B C Step 7 B
1 9 36 84 126 126 84 36 9 1 7 moves
9th Row
10th Row

Type 12-1 Tower of Hanoi p.104~p.105

Type 12-2 Pascal's Triangle p.106~p.107

13

2 212 2 3137 1 Row 4 : 1 3 3 1 8
321 Row 5 : 1 4 6 4 1 16

3 313 3 7 1 7 15 2 Row 1 2 3 4 5 6
431 Sum 1 2 4 8 16 32

The sum increases by two times.

3 The sum of the numbers in Row 6 is 32, so the
sum of the numbers in Row 7 is 32 2 64.

Answer Key