AMC 10 · 2019 · #2
Grade 4 number-theoryPick an answer.
AMC 10 2019 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
Tool #3 (Eliminate): the answer must satisfy two conditions. First, n itself must be composite, which kills any prime choice — that removes 11 and 19 immediately. Tool #2 (Systematic List): for each surviving composite n, compute n - 2 and check primality. The single survivor is the counterexample.
First filter — keep only non-prime n: 11 and 19 are prime, so eliminate them; 15, 21, 27 are composite and survive.
If n is prime, the 'if' part of the claim is false and there's nothing to break.
4.OA.B.4Eliminate PossibilitiesSecond filter — subtract 2 from each survivor: 15 - 2 = 13, 21 - 2 = 19, 27 - 2 = 25; now test each result for primality.
Subtract 2 from each survivor and check the result.
4.NBT.B.4Make A Systematic ListTest primality: 13 and 19 are prime (claim holds), but 25 = 5 · 5 is composite — so n = 27 breaks the claim.
Only one survivor leaves n - 2 composite — and that one breaks the claim.
4.OA.B.4Eliminate PossibilitiesThis AMC 10 problem only needs Grade 4 prime-vs-composite checks you already know — toss out the primes (11, 19), then subtract 2 from each leftover and look for the first composite result. 27 - 2 = 25 = 5 · 5, so (E).