AMC 10 Step by Step

2022 AMC 10B Problem 17

P16-20~5 minPrint

One of the following numbers is not divisible by any prime number less than 10.10. Which is it?

Log in to save your progress.
Show solution without answering

Key insight

Knock out four choices with quick remainder checks: (A) and (D) are multiples of 3, (B) and (E) end in 5. Only 2^607 − 1 is left.

Solution

The primes less than 1010 are 2,3,5,72, 3, 5, 7. Every choice is odd (a power of 22 is even, and adding or subtracting an odd number makes it odd), so 22 never divides them. We only need to test 33, 55 and 77. It is easier to find factors in four choices than to prove none in one, so knock out four.

1. (A) 2606−12^{606} - 1. Write 2606=43032^{606} = 4^{303}. The powers of 44 are 4,16,64,…4, 16, 64, \ldots, and each one is 11 more than a multiple of 33 (4=3+14 = 3 + 1, 16=15+116 = 15 + 1, 64=63+164 = 63 + 1). So 4303−14^{303} - 1 is a multiple of 33.
2. (B) 2606+12^{606} + 1. Again 2606=43032^{606} = 4^{303}. The last digits of powers of 44 go 4,6,4,6,…4, 6, 4, 6, \ldots: 44 for odd powers. Since 303303 is odd, 43034^{303} ends in 44, so 4303+14^{303} + 1 ends in 55. It is a multiple of 55.
3. (D) 2607+12^{607} + 1. Divide powers of 22 by 33: 22 leaves 22, 44 leaves 11, 88 leaves 22, 1616 leaves 11, and so on. Odd powers leave remainder 22. Since 607607 is odd, 2607+12^{607} + 1 leaves 2+1=32 + 1 = 3, so it is a multiple of 33.
4. (E) 2607+36072^{607} + 3^{607}. Look at last digits. Powers of 22 end in 2,4,8,62, 4, 8, 6, repeating every 44. Powers of 33 end in 3,9,7,13, 9, 7, 1, repeating every 44. Since 607=4×151+3607 = 4 \times 151 + 3, we are at the 3rd spot: 26072^{607} ends in 88 and 36073^{607} ends in 77. The sum ends in 55 (8+7=158 + 7 = 15), so it is a multiple of 55.
5. Check (C) 2607−12^{607} - 1 to be sure.
- By 33: 26072^{607} leaves 22 (odd power), so 2607−12^{607} - 1 leaves 11. Not a multiple.
- By 55: 26072^{607} ends in 88, so 2607−12^{607} - 1 ends in 77. Not a multiple.
- By 77: powers of 22 divided by 77 leave 2,4,1,2,4,1,…2, 4, 1, 2, 4, 1, \ldots, repeating every 33. Since 607=3×202+1607 = 3 \times 202 + 1, 26072^{607} leaves 22, and 2607−12^{607} - 1 leaves 11. Not a multiple.

So 2607−12^{607} - 1 has no prime factor less than 1010.

The answer is (C) 2607−1\boxed{\textbf{(C)}\ 2^{607}-1}.

Why this works

Huge powers are never meant to be multiplied out. Their remainders and last digits repeat in short cycles, so you only need to know where the exponent falls in the cycle, and whether it is odd or even. When a question says "exactly one choice has this property", it is often quicker to show the other four fail.

Alternative approach

Factoring rules give the same eliminations. For any whole number nn, a−ba - b divides an−bna^n - b^n; and when nn is odd, a+ba + b divides an+bna^n + b^n. So 4−1=34 - 1 = 3 divides 4303−14^{303} - 1 (A), 4+1=54 + 1 = 5 divides 4303+14^{303} + 1 (B), 2+1=32 + 1 = 3 divides 2607+12^{607} + 1 (D), and 2+3=52 + 3 = 5 divides 2607+36072^{607} + 3^{607} (E).

Concise solution

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

The primes less than 1010 are 2,3,5,72, 3, 5, 7. All five numbers are odd, so we look for factors of 33, 55 or 77 using two facts: a−ba - b divides an−bna^n - b^n for every nn, and a+ba + b divides an+bna^n + b^n when nn is odd.

  • (A) 2606−1=4303−12^{606} - 1 = 4^{303} - 1 is divisible by 4−1=34 - 1 = 3.
  • (B) 2606+1=4303+12^{606} + 1 = 4^{303} + 1, and 303303 is odd, so it is divisible by 4+1=54 + 1 = 5.
  • (D) 2607+12^{607} + 1 with 607607 odd is divisible by 2+1=32 + 1 = 3.
  • (E) 2607+36072^{607} + 3^{607} with 607607 odd is divisible by 2+3=52 + 3 = 5.

That leaves (C). To confirm, check 2607−12^{607} - 1 directly. Mod 33: 2≡−12 \equiv -1, so 2607−1≡−1−1≡12^{607} - 1 \equiv -1 - 1 \equiv 1. Mod 55: 24≡12^4 \equiv 1 and 607=4⋅151+3607 = 4 \cdot 151 + 3, so 2607≡23=8≡32^{607} \equiv 2^3 = 8 \equiv 3 and 2607−1≡22^{607} - 1 \equiv 2. Mod 77: 23≡12^3 \equiv 1 and 607=3⋅202+1607 = 3 \cdot 202 + 1, so 2607−1≡2−1=12^{607} - 1 \equiv 2 - 1 = 1. None of 3,5,73, 5, 7 divides it, and it is odd.

The answer is (C) 2607−1\boxed{\textbf{(C)}\ 2^{607}-1}.

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.