Find the value of ⌊ lo g 2 1 ⌋ + ⌊ lo g 2 2 ⌋ + ⌊ lo g 2 3 ⌋ . . . . . . . . . . + ⌊ lo g 2 6 6 ⌋ .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Same way but I found the rule after trying the long way !!
The symbol is not for greatest integer function it is for smallest integer function
Daniel, please answer me.
k = 0 → 2 n − 1
is a formal notation or just something you made up to represent your idea?
I am really bad with demonstrations and proofs and to me yours just seem to be pretty solid. Just wanted to know if that notation is a standard.
the same I did :D
1 × 0 + 2 × 1 + 2 × 4 + 3 × 8 + 4 × 1 6 + 5 × 3 2 + 6 × 3 = 2 7 6
Problem Loading...
Note Loading...
Set Loading...
Note that ⌊ lo g 2 ( 2 n + k ) ⌋ = n for all k = 0 → 2 n − 1 , which is a total of 2 n values of k .
Thus, the sum we want is ( 1 ⋅ 0 + 2 ⋅ 1 + 4 ⋅ 2 + 8 ⋅ 3 + 1 6 ⋅ 4 + 3 2 ⋅ 5 ) + 6 + 6 + 6 = 2 7 6 .