⌊ 2 ⌋ + ⌊ 2 + 1 0 0 1 ⌋ + ⌊ 2 + 1 0 0 2 ⌋ + ⌊ 2 + 1 0 0 3 ⌋ + ⋯ + ⌊ 2 + 1 0 0 9 9 ⌋
Evaluate the sum 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.
Great result. I think it can be generalized even further in the same way, instead with 10^n, just work with n. That seems to be the final generalization. What do you think?
Log in to reply
Huh... that's right. I had still been thinking about concrete examples as I wrote the proof (in which case 1 0 n is nicer because it behaves nicely in decimal form) but you can change all the 1 0 n to n with no further change in the proof. Thanks for pointing that out.
The general term of the given sum can be written as ⌊ 2 + 1 0 0 k ⌋ , where k is an integer and 0 ≤ k ≤ 9 9 . Since 2 + 9 9 1 0 0 ≈ 2 . 4 0 4 < 3 ,
⌊ 2 + 1 0 0 k ⌋ = ⎩ ⎪ ⎨ ⎪ ⎧ 1 2 if 2 + 1 0 0 k < 2 or 0 ≤ k ≤ 5 8 if 2 + 1 0 0 k ≥ 2 or 5 9 ≤ k ≤ 9 9
Then we have:
S = k = 0 ∑ 9 9 ⌊ 2 + 1 0 0 k ⌋ = k = 0 ∑ 5 8 1 + k = 5 9 ∑ 9 9 2 = 5 9 + 8 2 = 1 4 1
Nice solution!!!
Good solution but can be easily solved with A.P.
Problem Loading...
Note Loading...
Set Loading...
Let's generalize!!! Thanks to @Emil Gueorguiev for pointing out I could further generalize by changing every instance of 1 0 n in my original solution to n . The following is the result of making this change (which helps readability too since I no longer have exponents in my summation indices)
Let r be any real number and let n be some non-negative integer. Then the sum we're interested in is k = 0 ∑ n − 1 ⌊ r + n k ⌋ = k = 0 ∑ n − 1 ⌊ ⌊ r ⌋ + { r } + n k ⌋ = k = 0 ∑ n − 1 ⌊ r ⌋ + ⌊ n n { r } + k ⌋ = n ⌊ r ⌋ + k = 0 ∑ n − 1 ⌊ n ⌊ n { r } ⌋ + k ⌋ = n ⌊ r ⌋ + k = 0 ∑ n − ⌊ n { r } ⌋ − 1 0 + k = n − ⌊ n { r } ⌋ ∑ n − 1 1 = n ⌊ r ⌋ + ⌊ n { r } ⌋ = ⌊ n ⌊ r ⌋ + n { r } ⌋ = ⌊ n r ⌋
Set r = 2 and n = 1 0 0 to make our sum identical to the one in the problem, giving an answer of ⌊ 1 0 0 2 ⌋ = ⌊ 1 4 1 . 4 2 1 3 5 6 ⌋ = 1 4 1