Hello, I have come across this question, and don't know where to start:
- Prove that for any natural number n,
2(√(n-1)-1) < 1+ 1/√2 +...+ 1/√n < 2√n
http://imgur.com/jif1ZMR
for an inequality like this, what is the best approach?
For the k+1 step, i'm assuming bringing them all to a single inequality or possibly solving one component first?
- Prove that for any natural number n,
2(√(n-1)-1) < 1+ 1/√2 +...+ 1/√n < 2√n
http://imgur.com/jif1ZMR
for an inequality like this, what is the best approach?
For the k+1 step, i'm assuming bringing them all to a single inequality or possibly solving one component first?
Last edited: