Difference between revisions of "2013 AIME I Problems/Problem 11"
Line 23: | Line 23: | ||
Solving these equations, we find <math>n = 131 \pmod{9*11*13}</math> , so the smallest possible value of N is <math>2^{4} * 3 * 5 * 7 * 131</math> | Solving these equations, we find <math>n = 131 \pmod{9*11*13}</math> , so the smallest possible value of N is <math>2^{4} * 3 * 5 * 7 * 131</math> | ||
+ | |||
+ | <math>2 + 3 + 5 + 7 + 131 = \boxed{148}</math> | ||
== See also == | == See also == | ||
{{AIME box|year=2013|n=I|num-b=10|num-a=12}} | {{AIME box|year=2013|n=I|num-b=10|num-a=12}} | ||
− | |||
− |
Revision as of 20:47, 16 March 2013
Problem 11
Ms. Math's kindergarten class has 16 registered students. The classroom has a very large number, N, of play blocks which satisfies the conditions:
(a) If 16, 15, or 14 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 such that when , , or 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 N satisfying the above conditions.
Solution
N must be some multiple of the LCM of 14, 15, and 16 = ; this LCM is hereby denoted and
1, 2, 3, 4, 5, 6, 7, 8, 10, and 12 all divide , so
We have the following three modulo equations:
Solving these equations, we find , so the smallest possible value of N is
See also
2013 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |