2014 AMC 10B Problem 17
What is the greatest power of that is a factor of ?
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 goes into the number, so break it into pieces and count the s in each piece.
1. Rewrite with base . , and . So
2. That gives factors of so far. But is odd, so is even and has more s. We must count them.
3. Small cases first to see the pattern for :
- : three s.
- : three s.
This suggests the answer "three". Here is why it is always true for .
4. Split it as a difference of squares:
5. The piece . Every power of is one more than a multiple of ( leave remainder when divided by ). So leaves remainder when divided by . It is even but not a multiple of : exactly one .
6. The piece . It equals . (Check with a small case: .) The bracket is a sum of odd numbers, and an odd count of odd numbers adds up to an odd number. So this piece has exactly the two s from the .
7. Add up. has factors of , and the whole number has .
The answer is .
Why this works
"Greatest power of that divides" means counting the s exactly. Taking out the obvious common factor is only the first step; what is left over can still be even. Splitting into and checking each piece's remainder when divided by is the standard way to finish this kind of count.
Alternative approach
Look at remainders when dividing by . leaves remainder , and leaves remainder . So leaves remainder , and does too. Then leaves remainder , and leaves remainder . It is a multiple of but not of : exactly three extra s, for 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 : and . Hence
Now count the factors of in . By difference of squares,
- : since , , so . It is divisible by but not by : exactly one factor of .
- . The second factor is a sum of odd numbers, hence odd. So has exactly the two factors of from .
Therefore has exactly , and the whole expression has .
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Algebra, Chapter 1: Follow the Rules (§1.6, §1.7, §1.8)
- Introduction to Number Theory, Chapter 12: Introduction to Modular Arithmetic
- 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.