AMC 10 Step by Step

2011 AMC 10B Problem 23

P21-25~5 minPrint

What is the hundreds digit of 201120112011^{2011} ?

Log in to save your progress.
Show solution without answering

Key insight

Only the last three digits matter, and they match those of 11 to the 2011th power. For 11 to the n, they come from 1 + 10n + 50n(n-1).

Solution

The hundreds digit only depends on the last three digits. When you multiply, the last three digits of the answer only depend on the last three digits of the numbers. 20112011 ends in 011011, so 201120112011^{2011} ends in the same three digits as 11201111^{2011}.

Step A: find the pattern for powers of 1111.

1. Small powers of 1111 follow the rows of Pascal's triangle:
- 112=12111^2 = 121 (row 1,2,11, 2, 1)
- 113=133111^3 = 1331 (row 1,3,3,11, 3, 3, 1)
- 114=1464111^4 = 14641 (row 1,4,6,4,11, 4, 6, 4, 1)
2. Read the row from the right end. The ones digit gets 11. The tens place gets nn. The hundreds place gets the third number of the row, which is n(n−1)2\frac{n(n-1)}{2}. Everything further left is in the thousands or higher, so we drop it. When nn is big these numbers carry into higher places, so write it as a sum:
last three digits of 11n=last three digits of 1+10n+100×n(n−1)2.\text{last three digits of } 11^n = \text{last three digits of } 1 + 10n + 100 \times \frac{n(n-1)}{2}.
3. Check with n=4n = 4: 1+40+100×6=6411 + 40 + 100 \times 6 = 641, and 114=1464111^4 = 14641. It matches.

Step B: use n=2011n = 2011.

  1. 10n=2011010n = 20110, which ends in 110110.
  2. n(n−1)2=2011×20102=2011×1005\frac{n(n-1)}{2} = \frac{2011 \times 2010}{2} = 2011 \times 1005. We only need its last digit, because multiplying by 100100 pushes everything else past the hundreds place. The last digit is 1×5=51 \times 5 = 5. So 100×(…5)100 \times (\ldots 5) ends in 500500.
  3. Add: 1+110+500=6111 + 110 + 500 = 611.

So 201120112011^{2011} ends in 611611, and the hundreds digit is 66.

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

Why this works

A number that is 11 more than a multiple of 1010, like 1111, raised to a power follows Pascal's triangle, and only the first few numbers of the row reach the last few digits. Anytime you need the last digits of a huge power, first trim the base to its last digits, then look for a shortcut like this one.

Alternative approach

In the language of the binomial theorem, (1+10)n=1+n⋅10+(n2)⋅102+(n3)⋅103+⋯(1 + 10)^n = 1 + n \cdot 10 + \binom{n}{2} \cdot 10^2 + \binom{n}{3} \cdot 10^3 + \cdots, and every term from 10310^3 on ends in 000000. So only the first three terms matter, exactly as in Step A.

Concise solution

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

The hundreds digit depends only on the last three digits, so compute 20112011 mod 10002011^{2011} \bmod 1000. Since 2011≡11(mod1000)2011 \equiv 11 \pmod{1000}, we need 112011 mod 100011^{2011} \bmod 1000.

Write 11=1+1011 = 1 + 10 and expand with the binomial theorem:
(1+10)2011=1+(20111)10+(20112)102+(20113)103+⋯(1 + 10)^{2011} = 1 + \binom{2011}{1} 10 + \binom{2011}{2} 10^2 + \binom{2011}{3} 10^3 + \cdots
Every term from the fourth onward contains 10310^3 and vanishes mod 10001000. The three survivors:

  • 11.
  • 2011⋅10=20110≡110(mod1000)2011 \cdot 10 = 20110 \equiv 110 \pmod{1000}.
  • (20112)⋅100\binom{2011}{2} \cdot 100. Here (20112)=2011⋅20102=2011⋅1005\binom{2011}{2} = \frac{2011 \cdot 2010}{2} = 2011 \cdot 1005, whose last digit is 1⋅5=51 \cdot 5 = 5; multiplied by 100100 this contributes 500(mod1000)500 \pmod{1000}.

Adding: 1+110+500=6111 + 110 + 500 = 611. So 201120112011^{2011} ends in …611\ldots 611, and its hundreds digit is 66.

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

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.