2009 AIME I Problem 8

Below is the professionally curated solution for Problem 8 of the 2009 AIME I, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2009 AIME I solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:summationpower of 2pairing and grouping

Difficulty rating: 2560

8.

Let S={20,21,22,,210}.S = \{2^0, 2^1, 2^2, \ldots, 2^{10}\}. Consider all possible positive differences of pairs of elements of S.S. Let NN be the sum of all of these differences. Find the remainder when NN is divided by 1000.1000.

Solution:

In the sum of all positive differences, the element 2k2^k is added once for each smaller element (kk times) and subtracted once for each larger element (10k10 - k times). Hence N=k=010(2k10)2k=2k=010k2k10k=0102k.N = \sum_{k=0}^{10} (2k - 10)\,2^k = 2\sum_{k=0}^{10} k\,2^k - 10\sum_{k=0}^{10} 2^k.

The standard sums are k=010k2k=9211+2=18434\sum_{k=0}^{10} k\,2^k = 9 \cdot 2^{11} + 2 = 18434 and k=0102k=2111=2047,\sum_{k=0}^{10} 2^k = 2^{11} - 1 = 2047, so N=218434102047=3686820470=16398.N = 2 \cdot 18434 - 10 \cdot 2047 = 36868 - 20470 = 16398.

The remainder upon division by 10001000 is 398.398.

← Problem 7Full ExamProblem 9

Problem 8 in Other Years