AMC 10 · 2014 · #17

Grade 8 number-theory
exponentsdifference-of-squaresmodular-arithmeticprime-factorization identify-subproblems ↑ Prerequisites: exponentsdifference-of-squares
📏 Long solution 💡 4 insights
Problem
Find the largest power of 2 that divides the number 10¹⁰⁰² - 4⁵⁰¹, choosing from 2¹⁰⁰² through 2¹⁰⁰⁶.

Pick an answer.

(A)
$2^{1002}$
(B)
$2^{1003}$
(C)
$2^{1004}$
(D)
$2^{1005}$
(E)
$2^{1006}$

AMC 10 2014 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Identify Subproblems

The numbers are astronomically large, so Tool #7 (Identify Subproblems) is the spine: first pull out the obvious shared power of 2, then the whole job shrinks to counting how many extra 2s hide inside a single leftover factor 5¹⁰⁰² - 1. Tool #5 (Look for a Pattern) reads the powers of 5 modulo 4 to see which pieces are divisible by 4 and which carry only one 2. Tool #9 (Solve an Easier Related Problem) replaces the giant 5¹⁰⁰²-1 with a tiny factored form (4 × odd) that is easy to count.

1STEP 1

Write both terms as powers of 2

Since 10 = 2 · 5, 10¹⁰⁰² = 2¹⁰⁰² · 5¹⁰⁰²; since 4 = 2², 4⁵⁰¹ = (2²)⁵⁰¹. So both terms openly carry 2¹⁰⁰².

10¹⁰⁰² = 2¹⁰⁰² · 5¹⁰⁰², 4⁵⁰¹ = 2¹⁰⁰²
2STEP 2

Factor out the shared 2¹002

Pull the shared factor out: 10¹⁰⁰² - 4⁵⁰¹ = 2¹⁰⁰²(5¹⁰⁰² - 1). As 5¹⁰⁰² is odd, the leftover is even — more 2s hide in it.

10¹⁰⁰² - 4⁵⁰¹ = 2¹⁰⁰² (5¹⁰⁰² - 1)
3STEP 3

Split with difference of squares

With 5¹⁰⁰² = (5⁵⁰¹)², the leftover splits: 5¹⁰⁰² - 1 = (5⁵⁰¹ - 1)(5⁵⁰¹ + 1) — two consecutive even numbers.

5¹⁰⁰² - 1 = (5⁵⁰¹ - 1)(5⁵⁰¹ + 1)
4STEP 4

Read the factors modulo 4

Since 5 ≡ 1 (mod 4), also 5⁵⁰¹ ≡ 1, so 5⁵⁰¹ + 1 ≡ 2 (mod 4) carries exactly one factor of 2, while 5⁵⁰¹ - 1 is a multiple of 4.

5⁵⁰¹+1 ≡ 2 (mod 4), 5⁵⁰¹-1 ≡ 0 (mod 4)
5STEP 5

Pin down 5⁵01 - 1 exactly

Factor 5⁵⁰¹ - 1 = 4 · S, where S sums 501 odd powers of 5 and is therefore odd: two 2s here, plus one before, gives 3 in all.

5⁵⁰¹-1 = 4 S, S odd → v₂(5¹⁰⁰²-1) = 2 + 1 = 3
6STEP 6

Combine the powers of 2

Stack the two counts: 2¹⁰⁰² · 2³ = 2¹⁰⁰⁵, and no larger power of 2 divides the number — choice (D).

2¹⁰⁰² · 2³ = 2¹⁰⁰⁵ → (D)
Answer
2¹⁰⁰⁵
The starting factor 2¹⁰⁰² already matches choice (A), so the true answer must be at least that big; the extra three 2s from 5¹⁰⁰²-1 push it up to 2¹⁰⁰⁵, comfortably inside the choice range 2¹⁰⁰² to 2¹⁰⁰⁶. The count 3 is trustworthy because each factor of the difference of squares was pinned exactly — one 2 from 5⁵⁰¹+1 and exactly two from 5⁵⁰¹-1 = 4×odd — leaving no double counting or missed factor.
💡Key takeaway

To find the biggest power of 2 hiding in a difference, pull out the shared power first, then count the leftover 2s one factor at a time.

  • Write both terms as powers of 2
  • Factor out the shared 2¹002
  • Split with difference of squares
  • Read the factors modulo 4
  • Pin down 5⁵01 - 1 exactly
  • Combine the powers of 2