Using principle of mathematical induction prove that.
√n<1√1+1√2+1√3+...+1√n for all natural numbers n≥2.
Consider the statement
P(n):√n<1√1+1√2+1√3+....+1√n, for all natural numbers n ≥ 2.
Step I We observe that P(2) is true
P(2) : √2<1√1+1√2, which is true,
Step II Now, assume that P(n) is true for n = k
P(k):√k<1√1+1√2+....+1√k is true.
Step III To prove P(k + 1) is true, we have to show that
P(k+1):√k+1<1√1+1√2+....+1√k+1 is true.
Given that, √k<1√1+1√2+.....+1√k
⇒√k+1√k+1<1√1+1√2+....+1√k+1√k+1
(√k)(√k+1)+1√k+1<1√1+1√2+1√k+1√k+1 .......(i)
If √k+1<√k√k+1+1√k+1
⇒k+1<√k√k+1+1
⇒k<√k(k+1)⇒√k<√k+1 .........(ii)
From eqs. (i) and (ii),
√k+1<1√1+1√2+......+1√k+1
So, P(k + 1) is true, whenever P(k) is true.
Hence, P(n) is true.