Difference between revisions of "2002 AMC 12P Problems/Problem 12"
(→See also) |
(→Solution 1) |
||
(2 intermediate revisions by the same user not shown) | |||
Line 21: | Line 21: | ||
The rational root theorem states that all rational roots of <math>n^3 - 8n^2 + 20n - 13</math> will be among <math>1, 13, -1</math>, and <math>-13</math>. Evaluating the cubic at these values will give <math>n = 1</math> as a root. Doing some synthetic division gives <cmath>n^3 - 8n^2 + 20n - 13 = (n-1)(n^2 - 7n + 13)</cmath> | The rational root theorem states that all rational roots of <math>n^3 - 8n^2 + 20n - 13</math> will be among <math>1, 13, -1</math>, and <math>-13</math>. Evaluating the cubic at these values will give <math>n = 1</math> as a root. Doing some synthetic division gives <cmath>n^3 - 8n^2 + 20n - 13 = (n-1)(n^2 - 7n + 13)</cmath> | ||
− | Since <math>n > 0</math>, <math>n-1</math> must be | + | Since <math>n > 0</math>, <math>n-1</math> must be positive. Since <math>(n-1)(n^2 - 7n + 13)</math> evaluates to a prime, it is clear that exactly one of <math>n-1</math> and <math>n^2 - 7n - 13</math> is <math>1</math>. We proceed by splitting the problem into 2 cases. |
Case 1: <math>n-1 = 1</math> | Case 1: <math>n-1 = 1</math> | ||
Line 30: | Line 30: | ||
Since both <math>3-1 = 2</math> and <math>4-1 = 3</math> are prime, both <math>n = 3</math> and <math>n = 4</math> work, yielding 2 solutions. | Since both <math>3-1 = 2</math> and <math>4-1 = 3</math> are prime, both <math>n = 3</math> and <math>n = 4</math> work, yielding 2 solutions. | ||
− | Putting everything together, the answer is <math>1 + 2 = \boxed{\ | + | Putting everything together, the answer is <math>1 + 2 = \boxed{\textbf{(C) }3}</math>. |
== See also == | == See also == |
Latest revision as of 23:11, 25 July 2024
- The following problem is from both the 2002 AMC 12P #12 and 2002 AMC 10P #18, so both problems redirect to this page.
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 positive. 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 . We have , so this case yields as a solution.
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 10P (Problems • Answer Key • Resources) | ||
Preceded by Problem 17 |
Followed by Problem 19 | |
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 |
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.