1986 AHSME Problems/Problem 25

Revision as of 01:43, 24 October 2014 by Timneh (talk | contribs) (Created page with "==Problem== If <math>\lfloor x\rfloor</math> is the greatest integer less than or equal to <math>x</math>, then <math>\sum_{N=1}^{1024} \lfloor \log_{2}N\rfloor =</math> <math>...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

If $\lfloor x\rfloor$ is the greatest integer less than or equal to $x$, then $\sum_{N=1}^{1024} \lfloor \log_{2}N\rfloor =$

$\textbf{(A)}\ 8192\qquad \textbf{(B)}\ 8204\qquad \textbf{(C)}\ 9218\qquad \textbf{(D)}\ \lfloor\log_{2}(1024!)\rfloor\qquad \textbf{(E)}\ \text{none of these}$

Solution

See also

1986 AHSME (ProblemsAnswer KeyResources)
Preceded by
Problem 24
Followed by
Problem 26
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png