Page 158 - NUMINO Challenge_C2

2 2 6 12 20 When you use the same methods to find the
number of shortest paths from B to C, C to D,
1 2 34 you get:
12 3
4 - 4 shortest paths from B to C
- 4 shortest paths from C to D
111 There are 4 4 4 64 shortest paths of A B
C D.
There are 20 shortest paths.

Creative Thinking p.92~p.93

1 When you erase all the paths that Jim must not 11 Number of Outcomes p.94~p.95

take and write the number of paths that lead to Example 2, 6 12
each vertex, the map is as shown below.

Jim 1 1 1 TryItAgain Hundreds place Tens place Ones place
432
1 23 4 1
21
1 11 5 321

1 2 3 8 Library The 3-digit numbers are 432, 431, 421, and
321.
There are 8 shortest paths.

2 The paths that contains are not considered. Example 3, 3, 12 3, 6

1 4 9 School 6TryItAgain 5 2 15 cases

1 23 4 5
House

11111

There are 9 shortest paths.

3 24 Type 11-1 Choosing Orders p.96~p.97

12 2 Kevin
Jake
A 18 B 1 John Ryan Jake Kevin
2 6 20 Jake Kevin Ryan
8 Kevin Ryan Jake
Kevin Ryan
12 Ryan
Jake John
There are 20 shortest paths. John

4 Number of shortest paths from A to B: 4 There are 6 different ways.

D 2 6, 24, 24

C 3 Ryan Jake Kevin
Kevin Jake
A 111
1 2 3 4B

Answer Key