AMC 10 Step by Step

2009 AMC 10B Problem 21

P21-25~3 minPrint

What is the remainder when 30+31+32+⋯+320093^0 + 3^1 + 3^2 + \cdots + 3^{2009} is divided by 8?

Log in to save your progress.
Show solution without answering

Key insight

Divided by 8, powers of 3 leave remainders 1, 3, 1, 3, and so on. Each pair adds to 4, and there are 1005 pairs.

Solution

The numbers are huge, but only their remainders when divided by 88 matter. Start with the first few powers of 33 and look for a pattern.

  1. List the first few powers and their remainders:
Power303^0313^1323^2333^3343^4
Value11339927278181
Remainder when divided by 881133113311
  1. The remainders repeat 1,3,1,3,…1, 3, 1, 3, \ldots The reason: multiplying by 99 (that is, by 33 twice) leaves the remainder unchanged, because 99 is 8+18 + 1.
  2. Count the terms. The exponents go from 00 to 20092009, so there are 20102010 terms.
  3. Group them in pairs: (30+31)+(32+33)+⋯+(32008+32009)(3^0 + 3^1) + (3^2 + 3^3) + \cdots + (3^{2008} + 3^{2009}). That is 2010÷2=10052010 \div 2 = 1005 pairs.
  4. Each pair has remainders 1+3=41 + 3 = 4.
  5. So the whole sum has the same remainder as 1005×4=40201005 \times 4 = 4020. Since 4020=8×502+44020 = 8 \times 502 + 4, the remainder is 44.
  6. A quicker way to see step 6: two 44's make 88, which leaves remainder 00. So 10051005 fours leave the same remainder as one 44, because 10051005 is odd.

The answer is (D) 4\boxed{\textbf{(D)}\ 4}.

Why this works

Remainders of powers always repeat after a while, and here they repeat every 22 steps. That lets you replace a giant sum by a count of repeating blocks. Be careful counting terms when the exponents start at 00: from 00 to 20092009 is 20102010 terms, not 20092009.

Alternative approach

The sum is a geometric series, equal to 32010−12\frac{3^{2010} - 1}{2}. Look at remainders when dividing by 1616 (we will divide by 22 at the end): 34=81=5×16+13^4 = 81 = 5 \times 16 + 1, so powers of 33 repeat every 44 steps when divided by 1616. Since 2010=4×502+22010 = 4 \times 502 + 2, 320103^{2010} has the same remainder as 32=93^2 = 9. So 32010−13^{2010} - 1 leaves remainder 88 when divided by 1616, which means it equals 16k+816k + 8 for some whole number kk. Halving gives 8k+48k + 4, remainder 44.

Concise solution

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

Since 32=9≡1(mod8)3^2 = 9 \equiv 1 \pmod 8, the powers of 33 modulo 88 alternate: even exponents give 11, odd exponents give 33.

The sum has exponents 00 through 20092009, which is 20102010 terms. Group them into consecutive pairs (32k+32k+1)(3^{2k} + 3^{2k+1}); each pair is ≡1+3=4(mod8)\equiv 1 + 3 = 4 \pmod 8, and there are 10051005 pairs. The total is therefore
1005⋅4=4020≡4(mod8),1005 \cdot 4 = 4020 \equiv 4 \pmod 8,
because 4020=8⋅502+44020 = 8 \cdot 502 + 4. Equivalently, 10051005 is odd, and an odd number of 44's is 4(mod8)4 \pmod 8.

The answer is (D) 4\boxed{\textbf{(D)}\ 4}.

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.