Monday, December 7, 2015

summation - Prove that $1.49

It can be proven by induction that nk=11k221n



From here, we can easily acquire the upper bound of the sum 99k=11k2

letting n=100.




However, I am not quite sure about the lower bound. The standard method of constructing lower rectangles of unit width on the curve y=1x2 yields a lower bound of 0.99, which isn't tight enough unfortunately. What could I do to achieve a sharper bound?



I know that as n, the sum converges to π26, but I feel that proving that result, just for this inequality, is a bit much.

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...