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

JMC 2006 Q10

JMCCurrent spec5 marksCounting, Probability & Logic

10. The diagram shows 7 identical coins which fit exactly inside a wooden frame. As a result each coin is prevented from sliding. What is the largest number of coins that may be removed one by one so that, at each stage, each remaining coin is still unable to slide?

  1. A 0
  2. B 1
  3. C 2
  4. D 3
  5. E 4
Seven identical grey coins, one in the middle and six around it, fitting exactly inside a black hexagonal frame

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