2024 AMC 10B Problem 18
How many different remainders can result when the th power of an integer is divided by ?
Show solution without answering
Key insight
Multiples of 5 give remainder 0. Any other number to the 100th power is 1 more than a multiple of 125, built up one factor of 5 at a time.
Solution
Since , whether has a factor of matters most. Split into two cases.
Case 1: is a multiple of .
- Then has at least three factors of , so it is a multiple of . So is too, and the remainder is .
Case 2: is not a multiple of .
2. Look at fourth powers first. For : , , , . Each is more than a multiple of . Since only the remainder of when divided by matters here, this holds for every that is not a multiple of . So
3. Now raise to the th power. Multiplying out gives
Put . The term is a multiple of , and every later term contains or more, so it is also a multiple of . So
(Example: .)
4. Do it once more with . Now is a multiple of , and is also a multiple of . So
and the remainder is .
Counting.
- Every th power leaves remainder or , and both happen: gives and gives . So there are exactly remainders.
The answer is .
Why this works
If a number is more than a multiple of , then its th power is more than a multiple of , and the th power of that is more than a multiple of . The exponent was picked to fit this chain exactly: the gets you to " more than a multiple of ", and each adds one more factor of .
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Split according to whether divides .
Case 1: . Then divides , so is a multiple of and the remainder is .
Case 2: . The fourth powers of are , all . So for some integer . Raise to the fifth power and expand with the binomial theorem:
because every term after the first is divisible by . So . The same expansion once more gives
So every not divisible by gives remainder .
Both remainders occur ( gives , gives ), so there are exactly .
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 12: Introduction to Modular Arithmetic
- Introduction to Number Theory, Chapter 1: Integers: The Basics
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.2)
- Introduction to Algebra, Chapter 11: Special Factorizations
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.