Join the USAMO Guide Discord Server. Regular updates are posted there!

Let me Join!
Dismiss

Problem 11 (2013 AIME I)

AIME 2013
Community difficultyNo ratings yetBe the first to rate this problem.
Understand the scale
Scale 0.5: Easiest math competition problems, often solvable even for early middle school students without experience. 1: Problems strictly for beginners, often at a moderate middle school level. 1.5: Problems for stronger beginner students, on the level of the middling problems in most middle school contests. 2: For motivated beginners, harder questions from the previous categories. 2.5: More advanced beginner problems, hardest questions from previous categories. 3: Early intermediate problems that require more creative thinking. 3.5: Tougher early intermediate problems that consistently stretch into higher-level creative thinking or conceptual knowledge. 4: Intermediate-level problems. 4.5: Upper intermediate problems approaching the upper bound for non-invitational sprint math competitions. 5: More difficult AIME problems or simple proof-based Olympiad-style problems. 6: High-level AIME-styled questions or introductory Olympiad-level questions. 7: Tougher Olympiad-level questions, may require more technical knowledge. 8: High-level Olympiad-level questions. 9: Expert Olympiad-level questions. 9.5: The hardest problems appearing on Olympiads which the strongest students could reasonably solve. 10: Historically notorious problems, generally unsuitable for even very hard competitions because they are exceedingly tedious, long, and difficult.

Suggest tags for this problem

This problem does not have any tags yet. Add a few useful tags and once enough people agree, they will be added here automatically.

Problem

Ms. Math's kindergarten class has 1616 registered students. The classroom has a very large number, NN , of play blocks which satisfies the conditions: (a) If 1616 , 1515 , or 1414 students are present in the class, then in each case all the blocks can be distributed in equal numbers to each student, and (b) There are three integers 0<x<y<z<140 < x < y < z < 14 such that when xx , yy , or zz students are present and the blocks are distributed in equal numbers to each student, there are exactly three blocks left over. Find the sum of the distinct prime divisors of the least possible value of NN satisfying the above conditions.

← Back to all problems