The six-digit number is prime for only one digit What is
- A)
- B)
- C)
- D)
- E)
Answer
E
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 , the number ends in , so divides it. Cross out (C).
2. Test for 3. A number is a multiple of when its digit sum is. Here the digit sum is .
- : digit sum , a multiple of . Cross out (A).
- : digit sum , a multiple of . Cross out (D).
- : digit sum , and : digit sum . Neither is a multiple of .
3. Test for 11. Two choices are left, and . The rule for : starting from the last digit, add and subtract the digits in turn. If the result is a multiple of (including ), so is the number. For :
So divides (indeed ). Cross out (B).
4. Only is left, and the problem says one digit works, so is the prime.
The answer is .
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 and ), digit sum (for ), then the add-subtract rule (for ). Here those three tests remove four of the five choices.
The trap
Using only the tests for 2, 3 and 5, which leave both 3 and 9, and then guessing. The test for 11 is what rules out 3.
Concise solution
A six-digit prime cannot be even and cannot end in , so is one of ; choice (C) is out.
Digit sum: . This is a multiple of when () or (), so and are divisible by . Choices (A) and (D) are out.
Now test with the alternating sum of digits from the right. For : , which is divisible by , so is composite. Choice (B) is out.
The only digit left is , and the problem guarantees exactly one digit works, so is the prime.
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 2: Primes and Composites
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Number Theory, Chapter 4: Prime Factorization (§4.2, §4.4)
- Introduction to Number Theory, Chapter 5: Divisor Problems (§5.2, §5.3)
Techniques
Use the answer choices (mod checks, size, form) to eliminate or select · Set up the equation/formula and compute; no special trick needed