2002 AMC 12B Problems/Problem 3

Revision as of 16:56, 18 January 2008 by Azjps (talk | contribs) (s)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

$n^2 - 3n + 2 = (n-2)(n-1)$, which is the product of two integers greater than $1$ if $n \ge 4$. When $n = 1,2$, the expression evaluates to $0$; when $n = 3$ it evaluates to be $2$, a prime number. The answer is $1\ \mathrm{(B)}$.

See also

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