Home
Class 12
MATHS
Using principle of mathematical inductio...

Using principle of mathematical induction prove that `sqrtn<1/sqrt1+1/sqrt2+1/sqrt3+......+1/sqrtn` for all natural numbers `n >= 2`.

Text Solution

Verified by Experts

Let `P(n) : sqrt(n) lt 1/(sqrt(1)) + (1)/(sqrt(2)) + "……" + (1)/(sqrt(n))`, for all natural numbers,
For ` n = 2, sqrt(2) lt (1)/(sqrt(1)) + (1)/(sqrt(2))` , which is true.
So, `P(2)` is true.
Let `P(n)` be true for some `n = k`.
Then `sqrt(k) lt (1)/(sqrt(1)) + (1)/(sqrt(2)) + "....." + (1)/(sqrt(k)) "......"(1)`
Adding `(1)/(sqrt(k+1))` on both sides, we get
`sqrt(k) + (1)/(sqrt(k+1)) lt (1)/(sqrt(1)) + (1)/(sqrt(2)) + "......" + (1)/(sqrt(k)) + (1)/(sqrt(k+1))"....."(2)`
Now, `sqrt(k+1) lt sqrt(k) + (1)/(sqrt(k+1))"......"(3)`
or `k 1 lt sqrt(k) sqrt(k+1) + 1`
or `k lt sqrt(k^(2) + k)`, where is true.
or `k + 1 lt sqrt(k) sqrt(k+1)+1`
or, ` k lt sqrt(k^(2) +k)`, which is true.
So from (2) and (3).
`sqrt(k+1)lt (1)/(sqrt(11)) + (1)/(sqrt(2)) + "......" + (1)/(sqrt(2)) + (1)/(sqrt(k+1))`
Thus, `P(k+1)` is true whenever `P(k)` is true.
So, by the principle of mathematical induction, `P(n)` is true for any natural number n.
Promotional Banner

Topper's Solved these Questions

  • PRINCIPLE OF MATHEMATICAL INDUCTION

    CENGAGE|Exercise Exercise|9 Videos
  • PERMUTATION AND COMBINATION

    CENGAGE|Exercise Question Bank|19 Videos
  • PROBABILITY

    CENGAGE|Exercise Solved Examples And Exercises|372 Videos

Similar Questions

Explore conceptually related problems

Using principle of mathematical induction prove that sqrt(n) =2

First principle of mathematical induction

Using the principle of mathematical induction , prove that for n in N , 41^(n) - 14^(n) is a multiple of 27.

Using principle of mathematical induction, prove that for all n in N, n(n+1)(n+5) is a multiple of 3.

Using the principle of mathematical induction prove that : the 1.3+2.3^(2)+3.3^(3)++n.3^(n)=((2n-1)3^(n+1)+3)/(4) for all n in N.

Using principle of mathematical induction prove that x^(2n)-y^(2n) is divisible by x+y for all nN.

Using the principle of mathematical induction, prove that (n^(2)+n) is seven for all n in N .

Using the principle of mathematical induction, prove that n<2^(n) for all n in N