The diagram shows four empty glasses with their bases at the bottom. One move consists of turning exactly three of the four glasses upside-down. What is the smallest number of moves needed before all of the glasses have their bases at the top?
Select one option, then click Submit.
3
4
7
11
13
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 2002 (2002)
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 2002 (2002)