NCERT Solutions
Class 11 Maths
Principle of Mathematical Induction

Ex.4.1 Q.24
Prove the following by using the principle of mathematical induction for all n є N:
(2n +7) < (n + 3)2
Let the given statement be P(n), i.e.,
P(n): (2n +7) < (n + 3)2
It can be observed that P(n) is true for n = 1
since 2.1 + 7 = 9 < (1 + 3)2 = 16, which is true.
Let P(k) be true for some positive integer k, i.e.,
(2k + 7) < (k + 3)2 ............ (1)
We shall now prove that P (k + 1) is true whenever P(k) is true.
Consider 2(k + 1) + 7 = (2k + 7) + 2
So, 2(k + 1) + 7 = (2k + 7) + 2 < (k + 3)2 + 2
[From equation 1]
= 2(k + 1) + 7 < k2 + 6k + 9 + 2
= 2(k + 1) + 7 < k2 + 6k + 11
Now, k2 + 6k + 11 < k2 + 8k + 16
So, 2(k + 1) + 7 < (k + 4)2
= 2(k + 1) + 7 < {(k + 1) + 3}2
Thus, P (k + 1) is true whenever P(k) is true.
Hence, by the principle of mathematical induction, statement P(n) is true for all natural numbers i.e., N.