Prove a Sum is Larger than a Root

[hammonjj]

Homework Statement

Let nεZ>0. Prove that:

Ʃ1/√(i) ≥ √(n)

The Attempt at a Solution

I'm not sure where to begin, this feels like it should be an induction problem, but I'm not sure how to show that √(n) + 1/√(i+1) ≥ √(n+1). There doesn't seem to be any obvious algebra that would simplify this into what I need it to be.

 

[Some Pig]

Statement correct for n=1.
For $n\ge2,$
\sum_{i=1}^n\frac1{\sqrt i}\ge\int_1^{n+1}\frac1{\sqrt x}\ dx<br /> =2\sqrt{n+1}-2\ge\sqrt n.

 

[dirk_mec1]

No, you have to show that:

√(n) + 1/√(n+1) ≥ √(n+1).

In your last step of the induction proces.