2007 AIME I Problem 7

Attempt Problem 7 of the 2007 AIME I below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2007 AIME I solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

7.

Let N=k=11000k(log2klog2k).\begin{aligned} N &= \sum_{k=1}^{1000} k \\ &\quad {}\cdot \left(\lceil \log_{\sqrt{2}} k \rceil - \lfloor \log_{\sqrt{2}} k \rfloor\right). \end{aligned} Find the remainder when NN is divided by 1000.1000. (Here x\lfloor x \rfloor denotes the greatest integer that is less than or equal to x,x, and x\lceil x \rceil denotes the least integer that is greater than or equal to x.x.)

Answer: 477
Concepts:floor and ceiling functionslogarithmpower of 2summation
Difficulty rating: 2410
Solution:

The difference xx\lceil x \rceil - \lfloor x \rfloor equals 11 when xx is not an integer and 00 when it is. Now log2k\log_{\sqrt{2}} k is an integer exactly when k=(2)jk = (\sqrt{2})^j for some integer j,j, and for kk to be an integer, jj must be even — that is, kk must be a power of 2.2. The powers at most 10001000 are 20,21,,29=512.2^0, 2^1, \ldots, 2^9 = 512.

Therefore N=k=11000kj=092j=1000100121023=5005001023=499477,\begin{aligned} N &= \sum_{k=1}^{1000} k - \sum_{j=0}^{9} 2^j \\ &= \frac{1000 \cdot 1001}{2} - 1023 \\ &= 500500 - 1023 = 499477, \end{aligned} and the remainder upon division by 10001000 is 477.477.

← Problem 6#6
Full Exam

Problem 7 in Other Years