S = x = 1 ∑ ∞ ( 2 1 / x 2 − 2 1 / x 3 )
Find ⌊ 1 0 0 S ⌋ .
Details and Assumptions
If you believe that the sum is divergent, put zero as your answer.
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 used plain knowledge of CS to solve the problems. It was pretty easy to see that the series converges.
After trying a few values, resorted to the following solution -
1 |
|
Log in to reply
It is not at all obvious that the series converges. As an example, consider the slightly modified series n = 1 ∑ ∞ ( 2 1 / n − 2 1 / n 3 ) I claim that this series diverges. Can you show that ?
Log in to reply
Yes you are correct.
Here are the results of my test -
1 2 3 4 5 6 7 8 |
|
I cannot be sure if it converges or diverges. I need to improve my math skills :p.
Thanks a lot for replying!
Log in to reply
@Arulx Z – Well, you can see that a pattern emerges. The partial sum up to m terms grows like ∼ lo g m . It can indeed easily be shown by the estimate 1 + x ≤ exp ( x ) ≤ 1 + 2 x , 0 ≤ x ≤ 1 .
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
|
When i was set till 1 0 0 , it returned 3 1 .
When i was set till 1 0 0 0 , it returned 3 2 .
When i was set till 1 0 0 0 0 , it again returned 3 2 .
So it is apparent that the sum has converged enough till then. So, 3 2 is the final answer.
Problem Loading...
Note Loading...
Set Loading...
For a given integer m = 1 0 3 + 1 , we can upper-bound the tail of the series ∑ n = m ∞ ( 2 1 / n 2 − 2 1 / n 3 ) as follows n = m ∑ ∞ ( 2 1 / n 2 − 2 1 / n 3 ) ≤ n = m ∑ ∞ ( 2 1 / n 2 − 1 ) = n = m ∑ ∞ ( exp ( ln ( 2 ) / n 2 ) − 1 ) ≤ ( a ) n = m ∑ ∞ 2 ln ( 2 ) / n 2 ≤ ( b ) 2 ln ( 2 ) / 1 0 3 ≤ 0 . 0 0 1 4 Where in (a), we have used the inequality that exp ( x ) ≤ 1 + 2 x , 0 ≤ x ≤ 1 and the summation in (b) has been upper-bounded by the corresponding integral. Thus it follows that to evaluate ⌊ 1 0 0 S ⌋ , it is enough to evaluate the series up to m = 1 0 3 and then take the floor. This finite summation has been evaluated by a computer program.