Difference between revisions of "2002 AMC 12B Problems/Problem 3"
(→Solution) |
|||
| Line 9: | Line 9: | ||
\qquad\mathrm{(E)}\ \text{infinitely\ many}</math> | \qquad\mathrm{(E)}\ \text{infinitely\ many}</math> | ||
== Solution == | == Solution == | ||
| − | Factoring, we get <math>n^2 - 3n + 2 = (n-2)(n-1)</math>. | + | Factoring, we get <math>n^2 - 3n + 2 = (n-2)(n-1)</math>. Either <math>n-1</math> or <math>n-2</math> is odd, and the other is even. Their product must yield an even number. The only prime that is even is <math>2</math>, which is when <math>n</math> is <math>3</math>. The answer is <math>\boxed{\mathrm{(B)}\ \text{one}}</math>. |
== See also == | == See also == | ||
Revision as of 23:42, 15 July 2014
- The following problem is from both the 2002 AMC 12B #3 and 2002 AMC 10B #6, so both problems redirect to this page.
Problem
For how many positive integers 
is 
a prime number?
Solution
Factoring, we get 
. Either 
or 
is odd, and the other is even. Their product must yield an even number. The only prime that is even is 
, which is when is 
. The answer is 
.
See also
| 2002 AMC 10B (Problems • Answer Key • Resources) | ||
| Preceded by Problem 5 |
Followed by Problem 7 | |
| 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 12B (Problems • Answer Key • Resources) | |
| Preceded by Problem 2 |
Followed by Problem 4 |
| 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. 
