k = 1 ∑ x ⌊ lo g 2 0 k ⌋ = x
Find x .
Bonus : Find x in terms of the logarithm base n .
Notation : ⌊ ⋅ ⌋ denotes the floor function .
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.
The solution to this sum is pretty simple: [ l o g 2 0 1 ] + [ l o g 2 0 2 ] + [ l o g 2 0 3 ] + . . . . . . . . . . [ l o g 2 0 x ] = x
Now to explain this solution bit easily, we can explain as follows:
1) G.I.F of Logarithm of 1,2,3.....is 0 till 19.
2) Thereafter G.I.F of logarithm of 20,21,22,23......399 is 1.
3) Then G.I.F of logarithm of 400 onwards till 8000 would be 2.
If we write x = 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 . . . . x times
By comparing, for the first 19 terms on the L.H.S, the value is 1 less than the first 19 terms on R.H.S. As a result, we are left with a deficit of 19 in the L.H.S.
Then, from the 20th to the 399th term on the L.H.S, the value is equal to their corresponding terms of R.H.S.
Then, From 400th term onwards the value of the terms on L.H.S are 1 greater than their corresponding terms on R.H.S
So we can meet our deficit of 19 by including 19 terms after the 399th term. Thus the value of x would be = 399 + 19 = 418.
Bonus: When the logarithm base is n , then the answer would be n 2 − 1 + n − 1 = n 2 + n − 2 and the process of thinking is same as above.
Hope this helps. :)
It is obsolete to call the floor function, greatest integer function. Use \lfloor \cdot \rfloor for ⌊ ⋅ ⌋ instead of [.]. Need a backslash in front of \log ( lo g ). Better to use k than i . Reserve i for − 1 . Put all math elements x and n in LaTex.
Thank you sir for your helpful advice.
Problem Loading...
Note Loading...
Set Loading...
Consider the general case:
x ⟹ x = k = 1 ∑ x ⌊ lo g n k ⌋ = k = 1 ∑ n − 1 ⌊ lo g n k ⌋ + k = n ∑ x ⌊ lo g n k ⌋ = 0 + k = n ∑ n 2 − 1 ⌊ lo g n k ⌋ + k = n 2 − 1 ∑ x ⌊ lo g n k ⌋ = n 2 − 1 − ( n − 1 ) + 2 ( x − ( n 2 − 1 ) ) = 2 x − n 2 − n + 2 = n 2 + n − 2 = 4 1 8 Note that for k < n , lo g n k < 1 and for k < n 2 , lo g n k < 2 There is always an x , n 2 − 1 < x ≤ n 3 , satisfying the equation. Putting n = 2 0