JMC 2006 Q10
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?
- A 0
- B 1
- C 2
- D 3
- E 4

Junior Mathematical Challenge 2006, Question 10. © UK Mathematics Trust. Original paper on ukmt.org.uk
Answer: D 3
Note that you cannot remove two touching coins; for if you did then any coin making a triangle with those two coins could then slide. So if the middle coin was removed, no other coin could then be removed. So next consider removing first an outer coin. There are two outer coins touching it – which, as argued before, cannot now be removed. We consider two cases. If the next coin to go is that opposite the coin already removed, then each remaining coin is adjacent to a removed coin – and the process stops. Finally, suppose the next coin removed is next but one (around the outer edge) from the first removed coin. Then a third coin, two further around the edge, is the only possibility for removal – and then the process halts again. So the largest number of coins that may be removed is three.
Solution © UK Mathematics Trust, from the JMC 2006 solutions.