Sam has put sweets in five jars in such a way that no jar is empty and no two jars contain the same number of sweets. Also, any three jars contain more sweets in total than the total of the remaining two jars. What is the smallest possible number of sweets altogether in the five jars?
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 Olympiad 2010 (2010)
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 Olympiad 2010 (2010)