Difference between revisions of "2002 AMC 12B Problems/Problem 3"

m (s)
 
(Solution 1)
(4 intermediate revisions by 4 users not shown)
Line 1: Line 1:
 +
{{duplicate|[[2002 AMC 12B Problems|2002 AMC 12B #3]] and [[2002 AMC 10B Problems|2002 AMC 10B #6]]}}
 
== Problem ==
 
== Problem ==
 
For how many positive integers <math>n</math> is <math>n^2 - 3n + 2</math> a [[prime]] number?
 
For how many positive integers <math>n</math> is <math>n^2 - 3n + 2</math> a [[prime]] number?
Line 7: Line 8:
 
\qquad\mathrm{(D)}\ \text{more\ than\ two,\ but\ finitely\ many}
 
\qquad\mathrm{(D)}\ \text{more\ than\ two,\ but\ finitely\ many}
 
\qquad\mathrm{(E)}\ \text{infinitely\ many}</math>
 
\qquad\mathrm{(E)}\ \text{infinitely\ many}</math>
== Solution ==
+
== Solution 1 ==
<math>n^2 - 3n + 2 = (n-2)(n-1)</math>, which is the product of two integers greater than <math>1</math> if <math>n \ge 4</math>. When <math>n = 1,2</math>, the expression evaluates to <math>0</math>; when <math>n = 3</math> it evaluates to be <math>2</math>, a prime number. The answer is <math>1\ \mathrm{(B)}</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> or <math>0</math>. Since <math>0</math> is not a positive number, the answer is <math>\boxed{\mathrm{(B)}\ \text{one}}</math>.
 +
 
 +
== Solution 2 ==
 +
Considering parity, we see that <math>n^2 - 3n + 2</math> is always even.  The only even prime is <math>2</math>, and so <math>n^2-3n=0</math> whence <math>n=3\Rightarrow\boxed{\mathrm{(B)}\ \text{one}}</math>.
  
 
== See also ==
 
== See also ==
 +
{{AMC10 box|year=2002|ab=B|num-b=5|num-a=7}}
 
{{AMC12 box|year=2002|ab=B|num-b=2|num-a=4}}
 
{{AMC12 box|year=2002|ab=B|num-b=2|num-a=4}}
  
 
[[Category:Introductory Number Theory Problems]]
 
[[Category:Introductory Number Theory Problems]]
 +
{{MAA Notice}}

Revision as of 23:37, 3 November 2020

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 $n$ is $n^2 - 3n + 2$ a prime number?

$\mathrm{(A)}\ \text{none} \qquad\mathrm{(B)}\ \text{one} \qquad\mathrm{(C)}\ \text{two} \qquad\mathrm{(D)}\ \text{more\ than\ two,\ but\ finitely\ many} \qquad\mathrm{(E)}\ \text{infinitely\ many}$

Solution 1

Factoring, we get $n^2 - 3n + 2 = (n-2)(n-1)$. Either $n-1$ or $n-2$ is odd, and the other is even. Their product must yield an even number. The only prime that is even is $2$, which is when $n$ is $3$ or $0$. Since $0$ is not a positive number, the answer is $\boxed{\mathrm{(B)}\ \text{one}}$.

Solution 2

Considering parity, we see that $n^2 - 3n + 2$ is always even. The only even prime is $2$, and so $n^2-3n=0$ whence $n=3\Rightarrow\boxed{\mathrm{(B)}\ \text{one}}$.

See also

2002 AMC 10B (ProblemsAnswer KeyResources)
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 (ProblemsAnswer KeyResources)
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. AMC logo.png