2019 AMC 10B Problems/Problem 2

Revision as of 17:01, 15 February 2019 by Bgav (talk | contribs)
The following problem is from both the 2019 AMC 10B #2 and 2019 AMC 12B #2, so both problems redirect to this page.

Problem

Consider the statement, "If $n$ is not prime, then $n-2$ is prime." Which of the following values of $n$ is a counterexample to this statement?

$\textbf{(A) } 11 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 21 \qquad \textbf{(E) } 27$

Solution

Since a counterexample must be when n is not prime, n must be composite, so we eliminate A and C. Now we subtract 2 from the remaining answer choices, and we see that the only time $n-2$ is $\textbf{not}$ prime is when $n = 27$, which is $\fbox {E}$.

See Also

2019 AMC 10B (ProblemsAnswer KeyResources)
Preceded by
Problem 1
Followed by
Problem 3
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
2019 AMC 12B (ProblemsAnswer KeyResources)
Preceded by
Problem 1
Followed by
Problem 3
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

SUB2PEWDS

Invalid username
Login to AoPS