2007 AIME I Problems/Problem 7

Revision as of 20:24, 14 March 2007 by Azjps (talk | contribs) (terribly worded solution, someone plz fix)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $N = \sum_{k = 1}^{1000} k ( \lceil \log_{\sqrt{2}} k \rceil  - \lfloor \log_{\sqrt{2}} k \rfloor )$

Find the remainder when $N$ is divided by 1000. ($\lfloor{k}\rfloor$ is the greatest integer less than or equal to $k$, and $\lceil{k}\rceil$ is the least integer greater than or equal to $k$.)

Solution

The ceiling of a number minus the floor of a number is either equal to zero (if the number is an integer) or 1 otherwise. $\log_{\sqrt{2} k$ (Error compiling LaTeX. Unknown error_msg) is only an integer if $k$ is a power of $2$. Thus, $N$ is equal to the sum of all the numbers from 1 to 1000, and then subtract all powers of 2.

The formula for the sum of an arithmetic series yields that $\frac{(1000 + 1)(1000)}{2} - (1 + 2 + 2^2 + \ldots + 2^9) = 500500 - \frac{2^10-1}{2-1} = 499477$. The solution is $477$.

See also

2007 AIME I (ProblemsAnswer KeyResources)
Preceded by
Problem 6
Followed by
Problem 8
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions