JMC 2009 Q22
22. Starting at the square containing the 2, you are allowed to move from one square to the next either across a common edge, or diagonally through a common corner. How many different routes are there passing through exactly two squares containing a 0 and ending in one of the squares containing a 9?
- A 7
- B 13
- C 15
- D 25
- E 32
| 2 | 0 | 0 | 9 |
| 0 | 0 | 0 | 9 |
| 0 | 0 | 0 | 9 |
| 9 | 9 | 9 | 9 |
Junior Mathematical Challenge 2009, Question 22. © UK Mathematics Trust. Original paper on ukmt.org.uk
Answer: D 25
In order to reach a 9 in three steps, the first zero must be one of the three adjacent to the 2 and the second zero must be one of the five adjacent to a 9. The table shows the number of such routes to that point.
So the total number of different routes is 25.
| 1 | 2 | 4 | |
| 1 | 1 | 2 | 5 |
| 2 | 2 | 1 | 3 |
| 4 | 5 | 3 | 1 |
Solution © UK Mathematics Trust, from the JMC 2009 solutions.