Difference between revisions of "2002 AMC 12P Problems/Problem 12"
The 76923th (talk | contribs) m (→Solution) |
The 76923th (talk | contribs) m (→Solution) |
||
Line 14: | Line 14: | ||
</math> | </math> | ||
− | == Solution == | + | == Solution 1 == |
Since this is a number theory question, it is clear that the main challenge here is factoring the given cubic. In general, the rational root theorem will be very useful for these situations. | Since this is a number theory question, it is clear that the main challenge here is factoring the given cubic. In general, the rational root theorem will be very useful for these situations. | ||
Revision as of 14:18, 10 March 2024
Problem
For how many positive integers is a prime number?
Solution 1
Since this is a number theory question, it is clear that the main challenge here is factoring the given cubic. In general, the rational root theorem will be very useful for these situations.
The rational root theorem states that all rational roots of will be among , and . Evaluating the cubic at these values will give as a root. Doing some synthetic division gives
Since , must be nonnegative. Since evaluates to a prime, it is clear that exactly one of and is . We proceed by splitting the problem into 2 cases.
Case 1: It is clear that . However, , so this case does not yield any solutions.
Case 2: Solving for gives or . Therefore, or . Since both and are prime, both and work, yielding 2 solutions.
Putting everything together, the answer is .
See also
2002 AMC 12P (Problems • Answer Key • Resources) | |
Preceded by Problem 11 |
Followed by Problem 13 |
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 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.