2022 AMC 10B Problem 17
One of the following numbers is not divisible by any prime number less than Which is it?
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 are . Every choice is odd (a power of is even, and adding or subtracting an odd number makes it odd), so never divides them. We only need to test , and . It is easier to find factors in four choices than to prove none in one, so knock out four.
1. (A) . Write . The powers of are , and each one is more than a multiple of (, , ). So is a multiple of .
2. (B) . Again . The last digits of powers of go : for odd powers. Since is odd, ends in , so ends in . It is a multiple of .
3. (D) . Divide powers of by : leaves , leaves , leaves , leaves , and so on. Odd powers leave remainder . Since is odd, leaves , so it is a multiple of .
4. (E) . Look at last digits. Powers of end in , repeating every . Powers of end in , repeating every . Since , we are at the 3rd spot: ends in and ends in . The sum ends in (), so it is a multiple of .
5. Check (C) to be sure.
- By : leaves (odd power), so leaves . Not a multiple.
- By : ends in , so ends in . Not a multiple.
- By : powers of divided by leave , repeating every . Since , leaves , and leaves . Not a multiple.
So has no prime factor less than .
The answer is .
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 , divides ; and when is odd, divides . So divides (A), divides (B), divides (D), and divides (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 are . All five numbers are odd, so we look for factors of , or using two facts: divides for every , and divides when is odd.
- (A) is divisible by .
- (B) , and is odd, so it is divisible by .
- (D) with odd is divisible by .
- (E) with odd is divisible by .
That leaves (C). To confirm, check directly. Mod : , so . Mod : and , so and . Mod : and , so . None of divides it, and it is odd.
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 12: Introduction to Modular Arithmetic
- Introduction to Number Theory, Chapter 2: Primes and Composites
- Introduction to Algebra, Chapter 11: Special Factorizations (§11.2, §11.3, §11.5)
- Introduction to Number Theory, Chapter 10: Units Digits
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.