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?
Select one option, then click Submit.
0
1
2
3
4
Select an option, then submit.
Sign in or create an account to reveal answers, view the solution, and save your progress. Create a free account to unlock practice and keep track of your work.
Junior Mathematical Challenge 2006 (2006)
One puzzle per day. Cryptarithm, Magic Square, Summit. No sign-up required to play.
Play daily puzzle →Interactive problems and curated lessons—water pouring, magic squares, knight's tour, and more.
Browse library →See how you rank. Top solvers by problems solved correctly. Sign in to climb the ranks.
View leaderboard →Junior Mathematical Challenge 2006 (2006)