AMC 10 Step by Step

2024 AMC 10B Problem 18

P16-20~5 minPrint

How many different remainders can result when the 100100 th power of an integer is divided by 125125 ?

Log in to save your progress.
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 125=5⋅5⋅5125 = 5 \cdot 5 \cdot 5, whether nn has a factor of 55 matters most. Split into two cases.

Case 1: nn is a multiple of 55.

  1. Then n3n^3 has at least three factors of 55, so it is a multiple of 125125. So n100n^{100} is too, and the remainder is 00.

Case 2: nn is not a multiple of 55.

2. Look at fourth powers first. For n=1,2,3,4n = 1, 2, 3, 4: 14=11^4 = 1, 24=162^4 = 16, 34=813^4 = 81, 44=2564^4 = 256. Each is 11 more than a multiple of 55. Since only the remainder of nn when divided by 55 matters here, this holds for every nn that is not a multiple of 55. So
n4=1+5k for some whole number k.n^4 = 1 + 5k \text{ for some whole number } k.
3. Now raise to the 55th power. Multiplying out (1+a)5(1 + a)^5 gives
(1+a)5=1+5a+10a2+10a3+5a4+a5.(1 + a)^5 = 1 + 5a + 10a^2 + 10a^3 + 5a^4 + a^5.
Put a=5ka = 5k. The term 5a=25k5a = 25k is a multiple of 2525, and every later term contains a2=25k2a^2 = 25k^2 or more, so it is also a multiple of 2525. So
n20=(1+5k)5=1+25j for some whole number j.n^{20} = (1 + 5k)^5 = 1 + 25j \text{ for some whole number } j.
(Example: 220=1048576=1+25⋅419432^{20} = 1048576 = 1 + 25 \cdot 41943.)
4. Do it once more with a=25ja = 25j. Now 5a=125j5a = 125j is a multiple of 125125, and a2=625j2a^2 = 625j^2 is also a multiple of 125125. So
n100=(1+25j)5=1+(a multiple of 125),n^{100} = (1 + 25j)^5 = 1 + (\text{a multiple of } 125),
and the remainder is 11.

Counting.

  1. Every 100100th power leaves remainder 00 or 11, and both happen: 51005^{100} gives 00 and 11001^{100} gives 11. So there are exactly 22 remainders.

The answer is (B) 2\boxed{\textbf{(B)}\ 2}.

Why this works

If a number is 11 more than a multiple of 55, then its 55th power is 11 more than a multiple of 2525, and the 55th power of that is 11 more than a multiple of 125125. The exponent 100=4⋅5⋅5100 = 4 \cdot 5 \cdot 5 was picked to fit this chain exactly: the 44 gets you to "11 more than a multiple of 55", and each 55 adds one more factor of 55.

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 55 divides nn.

Case 1: 5∣n5 \mid n. Then 125=53125 = 5^3 divides n3n^3, so n100n^{100} is a multiple of 125125 and the remainder is 00.

Case 2: 5∤n5 \nmid n. The fourth powers of 1,2,3,41, 2, 3, 4 are 1,16,81,2561, 16, 81, 256, all ≡1(mod5)\equiv 1 \pmod 5. So n4=1+5kn^4 = 1 + 5k for some integer kk. Raise to the fifth power and expand with the binomial theorem:
(1+5k)5=1+5⋅5k+10⋅25k2+⋯≡1(mod25),(1 + 5k)^5 = 1 + 5 \cdot 5k + 10 \cdot 25k^2 + \cdots \equiv 1 \pmod{25},
because every term after the first is divisible by 2525. So n20=1+25jn^{20} = 1 + 25j. The same expansion once more gives
n100=(1+25j)5=1+5⋅25j+⋯≡1(mod125).n^{100} = (1 + 25j)^5 = 1 + 5 \cdot 25j + \cdots \equiv 1 \pmod{125}.
So every nn not divisible by 55 gives remainder 11.

Both remainders occur (n=5n = 5 gives 00, n=1n = 1 gives 11), so there are exactly 22.

The answer is (B) 2\boxed{\textbf{(B)}\ 2}.

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.