2007 AIME I 第 7 题

先试着解答 2007 AIME I 第 7 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 2007 AIME I 解答,或核对答案

所有题目均经美国数学协会(MAA)官方合法授权使用。

7.

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}NN 除以 10001000 的余数。(这里 x\lfloor x \rfloor 表示小于或等于 xx 的最大整数,x\lceil x \rceil 表示大于或等于 xx 的最小整数。)

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.)

答案:477
知识点:取整函数对数2的幂求和
难度评级:2410
解答:

xx\lceil x \rceil - \lfloor x \rfloorxx 不是整数时等于 11,在 x 是整数时等于 00。现在,log2k\log_{\sqrt{2}} k 是整数当且仅当 k=(2)jk = (\sqrt{2})^j,其中 jj 为某个整数; 要使 kk 为整数,jj 必须为偶数,也就是说 kk 必须是 22 的幂。不超过 10001000 的这些幂为 20,21,,29=5122^0, 2^1, \ldots, 2^9 = 512

因此 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} 除以 10001000 的余数为 477477

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.

← 第 6 题#6
完整试卷

其他年份的第 7 题