AMC 10 · 2009 · #21

Grade 4 number-theory
modular-arithmeticexponentspattern-recognition pattern-recognition ↑ Prerequisites: modular-arithmetic
📏 Medium solution 💡 2 insights
📘 View easy version →
Problem
Add up the powers of 3 from 3⁰ all the way to 3²⁰⁰⁹, then divide that giant total by 8. Find the remainder.

Pick an answer.

(A)
$\ 0$
(B)
$\ 1$
(C)
$\ 2$
(D)
$\ 4$
(E)
$\ 6$

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

How to solve
Strategy Look for a Pattern

The sum is far too big to add up, so Tool #9 (Solve an Easier Related Problem) shrinks it: the remainder of a sum divided by 8 depends only on the remainders of the parts, so replace each power 3^k by its small remainder. Tool #5 (Look for a Pattern) is the engine: the remainders of 3⁰,3¹,3²,… do not grow, they loop in a short cycle, so we never touch the huge numbers. Tool #7 (Identify Subproblems) turns "add 2010 remainders" into the easy sub-task of pairing them, and Tool #3 (Eliminate Possibilities) matches the final remainder to one of the five listed choices.

1STEP 1

Find the remainder cycle

Divided by 8, the powers of 3 leave 1,3,1,3,…: since 3²=9 is back to 1, the cycle has length 2 — even exponents leave 1, odd leave 3.

3⁰,3¹,3²,3³,… ≡ 1,3,1,3,… (mod 8)
2STEP 2

Swap each power for its remainder

A sum's remainder is fixed by its pieces' remainders, so replace the giant powers by 1+3+1+3+…, one small entry for each of the 2010 terms.

(3⁰+…+3²⁰⁰⁹) mod 8 = (1+3+1+3+…₂₀₁₀ terms) mod 8
3STEP 3

Pair them and total

Group them two at a time: 2010 terms make 1005 pairs of (1+3), each worth 4, so the remainder sum is 1005×4 = 4020.

1005×(1+3)=1005 × 4 = 4020
4STEP 4

Divide and match the choice

Divide the tidy total: 4020 = 8×502 + 4, so the original giant sum leaves remainder 4 too — choice (D).

4020 ÷ 8 = 502 remainder 4 → (D) 4
Answer
4
The remainder 4 is between 0 and 7, as any remainder mod 8 must be, and it matches a listed choice. A quick sanity check on a short version: 3⁰+3¹+3²+3³ = 1+3+9+27 = 40 = 8 × 5, remainder 0, which agrees with pairing (two pairs each worth 4 give 8, remainder 0). Adding two more terms 3⁴+3⁵ contributes remainders 1+3=4, matching our 2010-term count that ends on one extra pair worth 4.
💡Key takeaway

Powers of 3 leave remainders that loop 1,3,1,3 when divided by 8; pair them up, and 1005 pairs of 4 leave remainder 4 — choice (D).

  • Find the remainder cycle
  • Swap each power for its remainder
  • Pair them and total
  • Divide and match the choice