Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2019 AMC 10A Problems/Problem 9"

(Improved clarity)
m (→‎Solution 2)
Line 10: Line 10:
 
===Solution 2===
 
===Solution 2===
  
−
As in Solution 1, we deduce that <math>n+1</math> must be prime. If we can't immediately recall what the greatest three-digit prime is, we can instead use this result to eliminate answer choices as possible values of <math>n</math>. Choices <math>A</math>, <math>C</math>, and <math>E</math> don't work because <math>n+1</math> is even, and choice <math>D</math> does not work since <math>999</math> is divisible by <math>9</math>. Thus, the correct answer must be <math>\boxed{\textbf{(B) } 996}</math>.
+
As in Solution 1, we deduce that <math>n+1</math> must be prime. If we can't immediately recall what the greatest three-digit prime is, we can instead use this result to eliminate answer choices as possible values of <math>n</math>. Choices <math>A</math>, <math>C</math>, and <math>E</math> don't work because <math>n+1</math> is even, and choice <math>D</math> does not work since <math>999</math> is divisible by <math>9</math>, which means it's a composite number and not prime. Thus, the correct answer must be <math>\boxed{\textbf{(B) } 996}</math>.
  
 
==See Also==
 
==See Also==

Revision as of 17:20, 29 December 2019

Problem

What is the greatest three-digit positive integer $n$ for which the sum of the first $n$ positive integers is $\underline{not}$ a divisor of the product of the first $n$ positive integers?

$\textbf{(A) } 995 \qquad\textbf{(B) } 996 \qquad\textbf{(C) } 997 \qquad\textbf{(D) } 998 \qquad\textbf{(E) } 999$

Solution 1

The sum of $n$ positive integers is $\frac{(n)(n+1)}{2}$, and we want this not to be a divisor of $n!$ (the product of the first $n$ positive integers). Notice that if and only if $n+1$ were composite, all of its factors would be less than or equal to $n$, so would be able to cancel with these factors in $n!$, and thus the sum would be a divisor. Hence in this case, $n+1$ must instead be prime. The greatest three-digit integer that is prime is $997$, so we subtract $1$ to get $n=\boxed{\textbf{(B) } 996}$.

Solution 2

As in Solution 1, we deduce that $n+1$ must be prime. If we can't immediately recall what the greatest three-digit prime is, we can instead use this result to eliminate answer choices as possible values of $n$. Choices $A$, $C$, and $E$ don't work because $n+1$ is even, and choice $D$ does not work since $999$ is divisible by $9$, which means it's a composite number and not prime. Thus, the correct answer must be $\boxed{\textbf{(B) } 996}$.

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2019_AMC_10A_Problems/Problem_9&oldid=113711"