Proving Raabe's Criteria for Convergent Sums: Steps and Hints

  • Thread starter Thread starter MathematicalPhysicist
  • Start date Start date
  • Tags Tags
    Criteria
MathematicalPhysicist
Science Advisor
Gold Member
Messages
4,662
Reaction score
372
i'm having a problem proving raabe's criteria for convergent sums.
here in planetmath there's a description of it:
http://planetmath.org/encyclopedia/RaabesCriteria.html

i got that the first inequality is correct when mu is smaller than 1.

i got a hint in my test that i should show that {na_(n+1)} is monotonely decreasing, which i did and by another theorem to show c_n=(n-1)a_n-na_(n+1) is convergent which i also did, but i got that
(1-a_(n+1)/a_n)*n=(1-(1-1/n))*n=1>=mu.
where have i gone wrong?

thanks in advance.
 
Last edited by a moderator:
Physics news on Phys.org
a Mathematical series is shown in this fasion:
a_(n+1) = a_n * q
if |q|<1 then the series is convergent.

in your case, you see than q = a_(n+1)/a_n
all you really need to show is that q<1.

remember:
the sum of that series = (1 - q^n)/(1-q)
when n goes to infinity then the sum = 1/(1-q)
 
greytomato, no. Your "q" must be constant. Using your logic, the harmonic series would be convergent...
 
so muzza, what approach should i take here?
 
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