AMC 10 Step by Step

2021 AMC Fall 10A Problem 5

P1-10~2 minPrint

The six-digit number 2‾ 0‾ 2‾ 1‾ 0‾ A‾\underline{2}\,\underline{0}\,\underline{2}\,\underline{1}\,\underline{0}\,\underline{A} is prime for only one digit A.A. What is A?A?

Log in to save your progress.
Show solution without answering

Key insight

Cross out answers with quick tests: 5 ends in 5, digits 1 and 7 make the digit sum a multiple of 3, and 202103 is a multiple of 11.

Solution

The problem promises that exactly one digit works. So you do not need to prove a number is prime. You only need to cross out the four answers that are not prime.

1. Test for 5. If A=5A = 5, the number 202105202105 ends in 55, so 55 divides it. Cross out (C).
2. Test for 3. A number is a multiple of 33 when its digit sum is. Here the digit sum is 2+0+2+1+0+A=5+A2 + 0 + 2 + 1 + 0 + A = 5 + A.
- A=1A = 1: digit sum 66, a multiple of 33. Cross out (A).
- A=7A = 7: digit sum 1212, a multiple of 33. Cross out (D).
- A=3A = 3: digit sum 88, and A=9A = 9: digit sum 1414. Neither is a multiple of 33.
3. Test for 11. Two choices are left, 33 and 99. The rule for 1111: starting from the last digit, add and subtract the digits in turn. If the result is a multiple of 1111 (including 00), so is the number. For 202103202103:
3−0+1−2+0−2=0.3 - 0 + 1 - 2 + 0 - 2 = 0.
So 1111 divides 202103202103 (indeed 202103=11×18373202103 = 11 \times 18373). Cross out (B).
4. Only A=9A = 9 is left, and the problem says one digit works, so 202109202109 is the prime.

The answer is (E) 9\boxed{\textbf{(E)}\ 9}.

Why this works

When a problem says "only one of these works," cross out the others instead of proving the winner. Use the cheap tests first: last digit (for 22 and 55), digit sum (for 33), then the add-subtract rule (for 1111). Here those three tests remove four of the five choices.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

A six-digit prime cannot be even and cannot end in 55, so AA is one of 1,3,7,91, 3, 7, 9; choice (C) is out.

Digit sum: 2+0+2+1+0+A=5+A2 + 0 + 2 + 1 + 0 + A = 5 + A. This is a multiple of 33 when A=1A = 1 (66) or A=7A = 7 (1212), so 202101202101 and 202107202107 are divisible by 33. Choices (A) and (D) are out.

Now test 1111 with the alternating sum of digits from the right. For 202103202103: 3−0+1−2+0−2=03 - 0 + 1 - 2 + 0 - 2 = 0, which is divisible by 1111, so 202103=11⋅18373202103 = 11 \cdot 18373 is composite. Choice (B) is out.

The only digit left is 99, and the problem guarantees exactly one digit works, so 202109202109 is the prime.

The answer is (E) 9\boxed{\textbf{(E)}\ 9}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site. Also appeared as 2021 12FA #4.