I saw an interesting proof of the limit of The Euler Series on math.stackexchange.com at <http://math.stackexchange.com/questions/8337/different-methods-to-compute-sum-n-1-infty-frac1n2>. Scroll down to Hans Lundmark's post.
I thought I'd try to see this "pinching down" on the limit of pi**2/6. See my attempt, and output for n = 150 at <http://pastebin.com/pvznFWsT>. What puzzles me is that upper_bound_partial_sum (lines 39 and 60) is always smaller than the limit. It should be greater than the limit, right? If not, no pinching between upper_bound_partial_sum and lower_bound_partial_sum. I've checked and double-checked the computation, but can't figure out what's wrong. Thanks, Dick Moores -- http://mail.python.org/mailman/listinfo/python-list
