Series Comparison Test for Sum of (1/(sqrt(n^2+1))) and (1/(2n))

theBEAST
Messages
361
Reaction score
0

Homework Statement


For the sum from n=1 to ∞ (1/(sqrt(n^2+1)), I know you can use the limit comparison test to show that it is divergent but I was wondering if it is possible to compare this with 1/(2n)? I am not sure if 1/(2n) is always less than (1/(sqrt(n^2+1)) within those bounds. How could I show that it always is?
 
Physics news on Phys.org
note that \sqrt{n^2+1} and 2n are positive here, so you don't have to worry about either one changing the direction of an inequality. Set up the inequality and do some algebra.
 
DrewD said:
note that \sqrt{n^2+1} and 2n are positive here, so you don't have to worry about either one changing the direction of an inequality. Set up the inequality and do some algebra.

Okay so I found that the inequality is true when n > sqrt(1/3), since our bounds are n>1 then it is always true for this sum. Thus I can use that to compare and prove that 1/(sqrt(n^2+1)) is divergent correct?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top