Page 157 - NUMINO Challenge_C2

Answer
Key

Number of Outcomes 2

10 Number of Shortest Paths p.86~p.87 1 5 16 School
House 5 11
23456

11111

Example , There are 16 shortest paths.
4

Example 6, 12, 3, 3 Type 10-2 Number of Paths in a 3-D Shape p.90~p.91
12
1 There are 4 shortest paths.
Type 10-1 Shortest Paths in One-Way Streets p.88~p.89
2 The shortest path from point A to point B is the
1 To go from point A to point B using the shortest same on the front and back.
path, you cannot take the path that leads to the
left or down. A A 111

B B 1 2 3 4B

There are 4 shortest paths.
3 There are 8 shortest paths.

A Problem solving A 11

2 Add the number of shortest paths to each 1A
vertex.
5, 14, 5, 9 B 1 2 3B
AA
3 There are 14 shortest paths.

Problem solving BB

1 Mark X on the roads that Ryan must not take. In , the ant needs to pass through two
horizontal lines and one vertical line. In , it
Redraw the map to make it simpler. needs to pass through three horizontal lines and
one vertical line. Therefore, it is shorter to take
House House 1 1 path . In , when you add the number of
paths that lead to each vertex, there are 3
1 23 shortest paths from point A to point B.

Airport 1 3 6
Airport

There are 6 shortest paths.

NUMINO Challenge C2