JMC 2010 Q19
19. Pat needs to travel down every one of the roads shown at least once, starting and finishing at home. What is the smallest number of the five villages that Pat will have to visit more than once?
- A 1
- B 2
- C 3
- D 4
- E 5

Junior Mathematical Challenge 2010, Question 19. © UK Mathematics Trust. Original paper on ukmt.org.uk
Answer: C 3
Villages which have more than two roads leading to them (or from them) must all be visited more than once as a single visit will involve at most two roads. So Bentonville, Pencaster and Wytham must all be visited more than once. The route Home, Bentonville, Greendale, Wytham, Bentonville, Pencaster, Home, Wytham, Horndale, Pencaster, Home starts and finishes at Home and visits both Greendale and Horndale exactly once so the minimum number of villages is three.
Solution © UK Mathematics Trust, from the JMC 2010 solutions.