Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1986 AHSME Problems/Problem 25"

(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>...")
 
m (→‎Solution)
 
(2 intermediate revisions by the same user not shown)
Line 12: Line 12:
 
==Solution==
 
==Solution==
  
 +
Because <math>1 \le N \le 1024</math>, we have <math>0 \le \lfloor \log_{2}N\rfloor \le 10</math>. We count how many times <math>\lfloor \log_{2}N\rfloor</math> attains a certain value.
 +
 +
For all <math>k</math> except for <math>k=10</math>, we have that <math>\lfloor \log_{2}N\rfloor = k</math> is satisfied by all <math>2^k \le N<2^{k+1}</math>, for a total of <math>2^k</math> values of <math>N</math>. If <math>k=10</math>, <math>N</math> can only have one value (<math>N=1024</math>). Thus, the desired sum looks like <cmath>\sum_{N=1}^{1024} \lfloor \log_{2}N\rfloor =1(0)+2(1)+4(2)+\dots+2^k(k)+\dots+2^{9}(9)+10</cmath>
 +
 +
Let <math>S</math> be the desired sum without the <math>10</math>. <cmath>S=2(1)+4(2)+\dots+2^{9}(9)</cmath> Multiplying by <math>2</math> gives <cmath>2S=4(1)+8(2)+\dots+2^{10}(9)</cmath> Subtracting the two equations gives <cmath>S=2^{10}(9)-(2+4+8+\dots+2^9)</cmath> Summing the geometric sequence in parentheses and simplifying, we get <cmath>S=2^{10}(9)-2^{10}+2=2^{10}(8)+2=8194</cmath> Finally, adding back the <math>10</math> gives the desired answer <math>\fbox{(B) 8204}</math>
  
 
== See also ==
 
== See also ==

Latest revision as of 16:16, 2 August 2016

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

Because $1 \le N \le 1024$, we have $0 \le \lfloor \log_{2}N\rfloor \le 10$. We count how many times $\lfloor \log_{2}N\rfloor$ attains a certain value.

For all $k$ except for $k=10$, we have that $\lfloor \log_{2}N\rfloor = k$ is satisfied by all $2^k \le N<2^{k+1}$, for a total of $2^k$ values of $N$. If $k=10$, $N$ can only have one value ($N=1024$). Thus, the desired sum looks like \[\sum_{N=1}^{1024} \lfloor \log_{2}N\rfloor =1(0)+2(1)+4(2)+\dots+2^k(k)+\dots+2^{9}(9)+10\]

Let $S$ be the desired sum without the $10$. \[S=2(1)+4(2)+\dots+2^{9}(9)\] Multiplying by $2$ gives \[2S=4(1)+8(2)+\dots+2^{10}(9)\] Subtracting the two equations gives \[S=2^{10}(9)-(2+4+8+\dots+2^9)\] Summing the geometric sequence in parentheses and simplifying, we get \[S=2^{10}(9)-2^{10}+2=2^{10}(8)+2=8194\] Finally, adding back the $10$ gives the desired answer $\fbox{(B) 8204}$

See also

1986 AHSME (Problems • Answer Key • Resources)
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

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1986_AHSME_Problems/Problem_25&oldid=79819"