Solution for Infinite Series: 1/(1+n^2) Sum < pi/2

tobythetrain
Messages
4
Reaction score
0

Homework Statement



Given the Infinite Series 1/(1+n^2) where n goes from 1 to infinity, show that the sum is less than pi/2.

Homework Equations



1/(1+n^2)dx=arctanx

Series goes 1/2, 1/5, 1/10, 1/17, 1/26 and so on


The Attempt at a Solution



I have tried to find a telescoping series, but I can't see to get the terms to cancel out. My next try was to find the partial sum of the series, but I seem to want to take the integral from 1 til n+1 (as a form of partial sum) of 1/(1+n^2). I end up with Arctan(1+n) - Arctan(1), which obviously is less than pi/2, but I don't find this as a credibal solution...

Could anyone try to give me any hints on which way to go, or what way to go?

Thanks for welcoming me to the forum!
 
Physics news on Phys.org
tobythetrain said:

Homework Equations


1/(1+n^2)dx=arctanx

This is nonsense; perhaps you mean \int \frac{dx}{1 + x^2} = \arctan x + C ?

tobythetrain said:
My next try was to find the partial sum of the series, but I seem to want to take the integral from 1 til n+1 (as a form of partial sum) of 1/(1+n^2). I end up with Arctan(1+n) - Arctan(1), which obviously is less than pi/2, but I don't find this as a credibal solution...

You are on the right track, actually. One small problem is that you need to overestimate the "bar graph" of the sum of the series with the curve, and \frac1{1 + x^2} is a decreasing function of x, which means you need to move the "bar graph" left to fit under the curve. That is, for the n = 1 term, you need to write \frac1{1 + 1^2} &lt; \int_0^1 \frac{dx}{1 + x^2} and not \frac1{1 + 1^2} &lt; \int_1^2 \frac{dx}{1 + x^2} (which is false). If what I said about bar graphs doesn't make sense, draw a few pictures.
 
2. I tried to write the integralsign, but couldn't find it so I did it the easy way...

I totally see it now, and my problem is solved. Thanks a lot for helping me! This is a wonderful forum!

Toby
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top