Difference between revisions of "2019 AMC 10A Problems/Problem 9"
Argonauts16 (talk | contribs) (→Solution 2) |
Argonauts16 (talk | contribs) (→Solution 1) |
||
| Line 8: | Line 8: | ||
===Solution 1=== | ===Solution 1=== | ||
| − | Because the sum of <math>n</math> positive integers is <math>(n)(n+1) | + | Because the sum of <math>n</math> positive integers is <math>\frac{(n)(n+1)}{2}</math>, and we want this to not be a divisor of the <math>n!</math>, <math>n+1</math> must be prime. The greatest three-digit integer that is prime is <math>997</math>. Subtract <math>1</math> to get <math>996 \implies \boxed{\textbf{(B)}}.</math> |
-Lcz | -Lcz | ||
Revision as of 18:50, 9 February 2019
Problem
What is the greatest three-digit positive integer 
for which the sum of the first positive integers is 
a divisor of the product of the first positive integers?
Solution
Solution 1
Because the sum of positive integers is 
, and we want this to not be a divisor of the 
, 
must be prime. The greatest three-digit integer that is prime is 
. Subtract 
to get 
-Lcz
Solution 2
Following from the fact that must be prime, we can use to answer choices as possible solutions for . 
, 
, and 
don't work because is even, and 
does not work since 
is divisible by 
. Thus, the only correct answer is 
.
See Also
| 2019 AMC 10A (Problems • Answer Key • Resources) | ||
| Preceded by Problem 8 |
Followed by Problem 10 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| All AMC 10 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
