Assume given statement
Let P(n):√n<1√1+1√2+....+1√n,∀n≥2,nϵN
Check that statement is true for n=2
P(2):√2<1√1+1√2
⇒P(2):√2<√2+1√2×√2√2
⇒P(2):√2<2+√22(TRUE)
So, P(n) is true for n=2
Assume P(k) to be true and then prove P(k+1) is true.
Let P(n) is true for some natural number n=k
⇒√k<1√1+1√2+....+1√k…(1)
To show: √k+1<1√1+1√2+...+1√k+1
Now consider, √k<√k+1
⇒1√k>1√k+1
⇒k√k+1<k√k
⇒k√k+1<√k
⇒k+1√k+1−1√k+1<√k
⇒√k+1<√k+1√k+1
⇒√k+1<1√1+1√2+...+1√k+1√k+1…
using (1)
Thus, P(k+1)is true whenever P(k) is true.
Hence, By Principle of mathematical Induction P(n) is true for all natural numbers n≥2.