Consider the statement, "If is not prime, then is prime." Which of the following values of is a counterexample to this statement?
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
To break an if-then statement, the if part must be true and the then part false. So n and n minus 2 must both be not prime.
Solution
The statement says: "If is not prime, then is prime." A counterexample is a number that makes the "if" part true and the "then" part false. So we need both of these:
- is not prime, and
- is also not prime.
Check each choice.
| Is prime? | Is prime? | Breaks the statement? | ||
|---|---|---|---|---|
| yes | no | no ("if" part is false) | ||
| no () | yes | no | ||
| yes | yes | no ("if" part is false) | ||
| no () | yes | no | ||
| no () | no () | yes |
Only makes the "if" part true while the "then" part fails.
The answer is .
Why this works
An if-then statement only makes a promise when its "if" part happens. A prime never triggers that promise, so it can never be a counterexample, even though is not prime. For any "which is a counterexample" question, write down the two conditions separately and test each choice against both.
The trap
Picking a prime such as 11 or 19. When n is prime, the if part is false, so the statement is not broken at all.
Concise solution
A counterexample to "if then " is a case where holds but fails. Here we need to be not prime while is also not prime.
Check the choices:
- and are prime, so the hypothesis is false and they cannot be counterexamples.
- is composite, but is prime: the statement holds.
- is composite, but is prime: the statement holds.
- is composite, and is composite: the statement fails.
The answer is .
Review in the AoPS books
- Intermediate Counting & Probability, Chapter 2: Sets and Logic (§2.4)
- Introduction to Number Theory, Chapter 2: Primes and Composites
- Introduction to Number Theory, Chapter 4: Prime Factorization (§4.2, §4.4)
Techniques
Use the answer choices (mod checks, size, form) to eliminate or select · Test small/specific values or special cases to find or verify the answer