Proof for inequality induction

javi438
Messages
15
Reaction score
0
proof for inequality induction...please help!

Homework Statement



Prove for all positive integers n that
\sum^{n}_{l=1} l^{-1/2} > 2(\sqrt{n+1} -1)

2. The attempt at a solution
\sum^{n+1}_{l=1} l^{-1/2} <br /> = \sum^{n}_{l=1} l^{-1/2} + (n+1)^{-1/2} &gt; 2(\sqrt{n+1} -1) + (n+1)^{-1/2}

please help meee! I'm getting stuck, on how to express 2(\sqrt{n+1} -1) + (n+1)^{-1/2} in terms of 2(\sqrt{n+2} -1)
 
Last edited:
Physics news on Phys.org
Are you sure you are supposed to prove this by induction? I'm having a hard time doing it that way. On the other hand there is an easy way to do it by looking at an upper Riemann sum and comparing it with the integral of x^(-1/2).
 
yes I am pretty sureee..because that's what I am learning right nowww :frown:
 
Ok, so what you want to do is now show that 2*(sqrt(n+1)-1)+1/sqrt(n+1)>2*(sqrt(n+2)-1). Right? Multiply both sides by sqrt(n+1). The simple sqrt(n+1) radicals cancel on both sides. The sqrt(n+1)sqrt(n+2) remains on the right. Square both sides. It just barely works.
 
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