AMC 10 Step by Step

2014 AMC 10B Problem 17

P16-20~4 minPrint

What is the greatest power of 22 that is a factor of 101002−450110^{1002} - 4^{501} ?

Log in to save your progress.
Show solution without answering

Key insight

Pull out the obvious 2^1002. Then count the 2s hiding in 5^1002 - 1 by splitting it into (5^501 - 1)(5^501 + 1).

Solution

We need to know exactly how many times 22 goes into the number, so break it into pieces and count the 22s in each piece.

1. Rewrite with base 22. 4501=(22)501=210024^{501} = (2^2)^{501} = 2^{1002}, and 101002=21002×5100210^{1002} = 2^{1002} \times 5^{1002}. So
101002−4501=21002×(51002−1).10^{1002} - 4^{501} = 2^{1002} \times \left(5^{1002} - 1\right).
2. That gives 10021002 factors of 22 so far. But 510025^{1002} is odd, so 51002−15^{1002} - 1 is even and has more 22s. We must count them.
3. Small cases first to see the pattern for 5even−15^{\text{even}} - 1:
- 52−1=24=8×35^2 - 1 = 24 = 8 \times 3: three 22s.
- 56−1=15624=8×19535^6 - 1 = 15624 = 8 \times 1953: three 22s.
This suggests the answer "three". Here is why it is always true for 51002−15^{1002} - 1.
4. Split it as a difference of squares:
51002−1=(5501−1)(5501+1).5^{1002} - 1 = \left(5^{501} - 1\right)\left(5^{501} + 1\right).
5. The piece 5501+15^{501} + 1. Every power of 55 is one more than a multiple of 44 (5,25,125,…5, 25, 125, \ldots leave remainder 11 when divided by 44). So 5501+15^{501} + 1 leaves remainder 22 when divided by 44. It is even but not a multiple of 44: exactly one 22.
6. The piece 5501−15^{501} - 1. It equals 4×(5500+5499+⋯+5+1)4 \times \left(5^{500} + 5^{499} + \cdots + 5 + 1\right). (Check with a small case: 52−1=24=4×(5+1)5^2 - 1 = 24 = 4 \times (5 + 1).) The bracket is a sum of 501501 odd numbers, and an odd count of odd numbers adds up to an odd number. So this piece has exactly the two 22s from the 44.
7. Add up. 51002−15^{1002} - 1 has 1+2=31 + 2 = 3 factors of 22, and the whole number has 1002+3=10051002 + 3 = 1005.

The answer is (D) 21005\boxed{\textbf{(D)}\ 2^{1005}}.

Why this works

"Greatest power of 22 that divides" means counting the 22s exactly. Taking out the obvious common factor is only the first step; what is left over can still be even. Splitting a2−1a^2 - 1 into (a−1)(a+1)(a - 1)(a + 1) and checking each piece's remainder when divided by 44 is the standard way to finish this kind of count.

Alternative approach

Look at remainders when dividing by 1616. 52=255^2 = 25 leaves remainder 99, and 9×9=819 \times 9 = 81 leaves remainder 11. So 545^4 leaves remainder 11, and 510005^{1000} does too. Then 51002=51000×255^{1002} = 5^{1000} \times 25 leaves remainder 99, and 51002−15^{1002} - 1 leaves remainder 88. It is a multiple of 88 but not of 1616: exactly three extra 22s, for 210052^{1005} in total.

Concise solution

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

Write both terms with base 22: 101002=21002⋅5100210^{1002} = 2^{1002} \cdot 5^{1002} and 4501=210024^{501} = 2^{1002}. Hence
101002−4501=21002(51002−1).10^{1002} - 4^{501} = 2^{1002}\left(5^{1002} - 1\right).

Now count the factors of 22 in 51002−15^{1002} - 1. By difference of squares,
51002−1=(5501−1)(5501+1).5^{1002} - 1 = \left(5^{501} - 1\right)\left(5^{501} + 1\right).

  • 5501+15^{501} + 1: since 5≡1(mod4)5 \equiv 1 \pmod 4, 5501≡1(mod4)5^{501} \equiv 1 \pmod 4, so 5501+1≡2(mod4)5^{501} + 1 \equiv 2 \pmod 4. It is divisible by 22 but not by 44: exactly one factor of 22.
  • 5501−1=(5−1)(5500+5499+⋯+5+1)5^{501} - 1 = (5 - 1)\left(5^{500} + 5^{499} + \cdots + 5 + 1\right). The second factor is a sum of 501501 odd numbers, hence odd. So 5501−15^{501} - 1 has exactly the two factors of 22 from 5−1=45 - 1 = 4.

Therefore 51002−15^{1002} - 1 has exactly 21+2=232^{1 + 2} = 2^3, and the whole expression has 21002+3=210052^{1002 + 3} = 2^{1005}.

The answer is (D) 21005\boxed{\textbf{(D)}\ 2^{1005}}.

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.