⌈ lo g 2 1 ⌉ + ⌈ lo g 2 2 ⌉ + ⌈ lo g 2 3 ⌉ + ⋯ + ⌈ lo g 2 n ⌉ = 2 0 1 8 .
Find the value of n satisfying the equation above.
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.
i read ceiling as floor >.> anyway here's a computer science method in c++
1 2 3 4 5 6 7 8 9 10 11 12 13 |
|
returns 281
How is it possible that this is level 5? I thought it would be like level 3 or 4.
Log in to reply
Yeah! Agree!!
Your wish has been granted! :3
Nice solution, @Kartik Sharma
Damn ! Got the send part wrong.
Log in to reply
Can you explain what are you trying to tell??
We may observe that the number of terms that give us ⌈ L o g 2 X ⌉ = N i s 2 N − 1 , w h e n X t a k e s t h e v a l u e s f r o m ( 2 N − 1 + 1 ) t o 2 N . ∴ w e h a v e : − F o r X N t e r m s N ∗ t e r m s T o t a l 1 0 0 0 0 2 1 2 0 1 1 3 t o 4 2 2 1 4 5 5 t o 8 3 2 2 1 2 1 7 9 t o 1 6 4 2 3 3 2 4 9 1 7 t o 3 2 5 2 4 8 0 1 2 9 3 3 t o 6 4 6 2 5 1 9 2 3 2 1 6 5 t o 1 2 8 7 2 6 4 4 8 7 6 9 1 2 9 t o 2 5 6 8 2 7 1 0 2 4 1 7 9 3 . We are short by 2018 - 1793 =225. Next step has 256 terms of 9s. So we are in a zone where a few terms of 9 would suffice. Our X is now 256. we need 9 2 2 5 = 2 5 m o r e t e r m s . S o n = 2 5 6 + 2 5 = 2 8 1
This is a Arithmetic-Geometric Progression. We may use the formula given in Wiki. The series is (n_a=n*2^{n-1}. Kartik Sharma has used the same method given by Wiki.
Problem Loading...
Note Loading...
Set Loading...
The first few terms of this series are -
0 + 1 + 2 + 2 +......
Therefore, T n = n ( 2 n − 1 [There are better ways to explain this too which can be found easily]
First we would find a way to find sum of all the terms till n.
S = 1 ( 1 ) + 2 ( 2 ) + 3 ( 2 2 ) + . . . . + n ( 2 n − 1 )
2 S = 1 ( 2 ) + 2 ( 2 2 ) + 3 ( 2 3 ) + . . . . . + ( n − 1 ) ( 2 n − 1 ) + n ( 2 n )
S − 2 S = 1 + 2 + 2 2 + 2 3 + . . . . . . + 2 n − 1 − n ( 2 n
Now, ( 1 + 2 + 2 2 + 2 3 + . . . . . . + 2 n − 1 ) is in GP
− S = 2 n − 1 − n ( 2 n )
S = 2 n ( n − 1 ) + 1
Now, for S < 2018, n = 8 which can be found easily.
Hence,
S 8 + ⌈ l o g 2 ( k 1 ) ⌉ + ⌈ l o g 2 ( k 2 ) ⌉ + . . . . . ⌈ l o g 2 ( k n ) ⌉ = 2 0 1 8
where ⌈ l o g 2 ( k n ) ⌉ is same as ⌈ l o g 2 n ) ⌉
Now, P = ⌈ l o g 2 ( k 1 ) ⌉ + ⌈ l o g 2 ( k 2 ) ⌉ + . . . . . ⌈ l o g 2 ( k n ) ⌉
hence,
1793 + P = 2018
P = 225
Now, each term of P will be equal to 9 as last term of S 8 is ⌈ l o g 2 2 5 6 ⌉
So, P = 9x and P has x terms
9x = 225
x = 25
Therefore, n = 256 + 25 = 2 8 1