2007 AIME I Problem 7

Below is the professionally curated solution for Problem 7 of the 2007 AIME I, 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 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:floor and ceiling functionslogarithmpower of 2summation

Difficulty rating: 2410

7.

Let N=k=11000k(log2klog2k).N = \sum_{k=1}^{1000} k\left(\lceil \log_{\sqrt{2}} k \rceil - \lfloor \log_{\sqrt{2}} k \rfloor\right). 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.)

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,N = \sum_{k=1}^{1000} k - \sum_{j=0}^{9} 2^j = \frac{1000 \cdot 1001}{2} - 1023 = 500500 - 1023 = 499477, and the remainder upon division by 10001000 is 477.477.

← Problem 6Full ExamProblem 8

Problem 7 in Other Years