Your progress
Ticks are kept only in this browser: clearing your browsing data or changing device loses them. · ·

JMC 2010 Q19

JMCCurrent spec6 marksCounting, Probability & Logic

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?

  1. A 1
  2. B 2
  3. C 3
  4. D 4
  5. E 5
A road map: villages Greendale, Bentonville, Pencaster, Horndale and Wytham at the corners of a pentagon, with Home in the middle; roads join Wytham to Bentonville, and Home to Wytham, Bentonville and Pencaster

Junior Mathematical Challenge 2010, Question 19. © UK Mathematics Trust. Original paper on ukmt.org.uk