NCERT Solutions are provided to help the students in understanding the steps to solve mathematical problems that are provided in the textbook. Exercise 4.1 of NCERT Solutions for Class 11 Maths Chapter 4 â€“ Principle of Mathematical Induction is the only exercise in this chapter. It includes questions from all the topics covered in this chapter:

 Motivation
 The Principle of Mathematical Induction:
Suppose there is a given statement P(n) involving the natural number n such that

 The statement is true for n = 1, i.e., P(1) is true,
 If the statement is true for n = k (where k is some positive integer), then the statement is also true for n = k + 1, i.e., the truth of P(k) implies the truth of P(k+1).
The subject specialists stick to the syllabus while preparing the solutions. The problemsolving method provided in the examples is followed while curating the NCERT Solutions for class 11.
Download PDF of NCERT Solutions for Class 11 Maths Chapter 4 Principle of Mathematical Induction Exercise 4.1
Access Solutions for Class 11 Maths Chapter 4.1 Exercise
Exercise 4.1 page: 94
Prove the following by using the principle of mathematical induction for all n âˆˆ N:
1.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
2.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
3.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
4.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
5.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
6.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
7.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
8. 1.2 + 2.2^{2}Â + 3.2^{2}Â + â€¦ +Â n.2^{n}Â = (nÂ â€“ 1) 2^{n}^{+1}Â + 2
Solution:
We can write the given statement as
P (n): 1.2 + 2.2^{2}Â + 3.2^{2}Â + â€¦ +Â n.2^{n}Â = (nÂ â€“ 1) 2^{n}^{+1}Â + 2
If n = 1 we get
P (1): 1.2 = 2 = (1 â€“ 1) 2^{1+1}Â + 2 = 0 + 2 = 2
Which is true.
Consider P (k) be true for some positive integer k
1.2 + 2.2^{2}Â + 3.2^{2}Â + â€¦ +Â k.2^{k}Â = (kÂ â€“ 1) 2^{k}^{Â + 1}Â + 2 â€¦ (i)
Now let us prove that P (k + 1) is true.
Here
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
9.
Solution:
We can write the given statement as
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
10.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
11.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
12.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
13.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
14.
Solution:
By further simplification
= (k + 1) + 1
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
15.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
16.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
17.
Solution:
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
18.
Solution:
We can write the given statement as
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
19. nÂ (nÂ + 1) (nÂ + 5) is a multiple of 3
Solution:
We can write the given statement as
P (n): n (n + 1) (n + 5), which is a multiple of 3
If n = 1 we get
1 (1 + 1) (1 + 5) = 12, which is a multiple of 3
Which is true.
Consider P (k) be true for some positive integer k
k (k + 1) (k + 5) is a multiple of 3
k (k + 1) (k + 5) = 3m, where m âˆˆÂ N â€¦â€¦ (1)
Now let us prove that P (k + 1) is true.
Here
(k + 1) {(k + 1) + 1} {(k + 1) + 5}
We can write it as
= (k + 1) (k + 2) {(k + 5) + 1}
By multiplying the terms
= (k + 1) (k + 2) (k + 5) + (k + 1) (k + 2)
So we get
= {k (k + 1) (k + 5) + 2 (k + 1) (k + 5)} + (k + 1) (k + 2)
Substituting equation (1)
= 3m + (k + 1) {2 (k + 5) + (k + 2)}
By multiplication
= 3m + (k + 1) {2k + 10 + k + 2}
On further calculation
= 3m + (k + 1) (3k + 12)
Taking 3 as common
= 3m + 3 (k + 1) (k + 4)
We get
= 3 {m + (k + 1) (k + 4)}
= 3 Ã— q where q = {m + (k + 1) (k + 4)} is some natural number
(k + 1) {(k + 1) + 1} {(k + 1) + 5} is a multiple of 3
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
20. 10^{2}^{n}^{Â â€“ 1Â }+ 1 is divisible by 11
Solution:
We can write the given statement as
P (n): 10^{2}^{n}^{Â â€“ 1Â }+ 1 is divisible by 11
If n = 1 we get
P (1) = 10^{2.1 â€“ 1Â }+ 1 = 11, which is divisible by 11
Which is true.
Consider P (k) be true for some positive integer k
10^{2}^{k}^{Â â€“ 1Â }+ 1 is divisible by 11
10^{2}^{k}^{Â â€“ 1Â }+ 1 = 11m, whereÂ mÂ âˆˆÂ NÂ â€¦â€¦ (1)
Now let us prove that P (k + 1) is true.
Here
10 ^{2 (k + 1) â€“ 1} + 1
We can write it as
= 10 ^{2k + 2 â€“ 1} + 1
= 10 ^{2k + 1} + 1
By addition and subtraction of 1
= 10 ^{2} (10^{2k1} + 1 â€“ 1) + 1
We get
= 10 ^{2} (10^{2k1} + 1) â€“ 10^{2} + 1
Using equation 1 we get
= 10^{2}. 11m â€“ 100 + 1
= 100 Ã— 11m â€“ 99
Taking out the common terms
= 11 (100m â€“ 9)
= 11 r, where r = (100m â€“ 9) is some natural number
10 ^{2(k + 1) â€“ 1 }+ 1 is divisible by 11
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
21. x^{2}^{n}Â â€“Â y^{2}^{n}Â is divisible byÂ xÂ +Â y
Solution:
We can write the given statement as
P (n):Â x^{2}^{n}Â â€“Â y^{2}^{n}Â is divisible byÂ xÂ +Â y
If n = 1 we get
P (1) = x^{2Â Ã—Â 1}Â â€“Â y^{2Â Ã—Â 1}Â =Â x^{2}Â â€“Â y^{2}Â = (xÂ +Â y) (xÂ â€“Â y), which is divisible by (x + y)
Which is true.
Consider P (k) be true for some positive integer k
x^{2}^{k}Â â€“Â y^{2}^{k}Â is divisible byÂ xÂ +Â y
x^{2}^{k}Â â€“Â y^{2}^{k}Â =Â mÂ (xÂ +Â y), whereÂ mÂ âˆˆÂ NÂ â€¦â€¦ (1)
Now let us prove that P (k + 1) is true.
Here
x ^{2(k + 1)} â€“ y ^{2(k + 1)}
We can write it as
= x ^{2k} . x^{2} â€“ y^{2k} . y^{2}
By adding and subtracting y^{2k} we get
= x^{2} (x^{2k} â€“ y^{2k} + y^{2k}) â€“ y^{2k}. y^{2}
From equation (1) we get
= x^{2} {m (x + y) + y^{2k}} â€“ y^{2k}. y^{2}
By multiplying the terms
= m (x + y) x^{2} + y^{2k}. x^{2} â€“ y^{2k}. y^{2}
Taking out the common terms
= m (x + y) x^{2} + y^{2k} (x^{2} â€“ y^{2})
Expanding using formula
= m (x + y) x^{2} + y^{2k} (x + y) (x â€“ y)
So we get
= (x + y) {mx^{2} + y^{2k} (x â€“ y)}, which is a factor of (x + y)
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
22. 3^{2}^{n}^{Â + 2}Â â€“ 8nÂ â€“ 9 is divisible by 8
Solution:
We can write the given statement as
P (n): 3^{2}^{n}^{Â + 2}Â â€“ 8nÂ â€“ 9 is divisible by 8
If n = 1 we get
P (1) = 3^{2Â Ã—Â 1 + 2}Â â€“ 8 Ã— 1 â€“ 9 = 64, which is divisible by 8
Which is true.
Consider P (k) be true for some positive integer k
3^{2}^{k}^{Â + 2}Â â€“ 8kÂ â€“ 9 is divisible by 8
3^{2}^{k}^{Â + 2}Â â€“ 8kÂ â€“ 9 = 8m, whereÂ mÂ âˆˆÂ NÂ â€¦â€¦ (1)
Now let us prove that P (k + 1) is true.
Here
3 ^{2(k + 1) + 2} â€“ 8 (k + 1) â€“ 9
We can write it as
= 3 ^{2k + 2} . 3^{2} â€“ 8k â€“ 8 â€“ 9
By adding and subtracting 8k and 9 we get
= 3^{2} (3^{2k + 2} â€“ 8k â€“ 9 + 8k + 9) â€“ 8k â€“ 17
On further simplification
= 3^{2} (3^{2k + 2} â€“ 8k â€“ 9) + 3^{2} (8k + 9) â€“ 8k â€“ 17
From equation (1) we get
= 9. 8m + 9 (8k + 9) â€“ 8k â€“ 17
By multiplying the terms
= 9. 8m + 72k + 81 â€“ 8k â€“ 17
So we get
= 9. 8m + 64k + 64
By taking out the common terms
= 8 (9m + 8k + 8)
= 8r, where r = (9m + 8k + 8) is a natural number
So 3 ^{2(k + 1) + 2} â€“ 8 (k + 1) â€“ 9 is divisible by 8
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
23. 41^{n}Â â€“ 14^{n}Â is a multiple of 27
Solution:
We can write the given statement as
P (n):41^{n}Â â€“ 14^{n}is a multiple of 27
If n = 1 we get
P (1) = 41^{1} â€“ 14^{1} = 27, which is a multiple by 27
Which is true.
Consider P (k) be true for some positive integer k
41^{k}Â â€“ 14^{k}is a multiple of 27
41^{k}Â â€“ 14^{k}Â = 27m, whereÂ mÂ âˆˆÂ NÂ â€¦â€¦ (1)
Now let us prove that P (k + 1) is true.
Here
41^{k + 1} â€“ 14 ^{k + 1}
We can write it as
= 41^{k}. 41 â€“ 14^{k}. 14
By adding and subtracting 14^{k} we get
= 41 (41^{k} â€“ 14^{k} + 14^{k}) â€“ 14^{k}. 14
On further simplification
= 41 (41^{k} â€“ 14^{k}) + 41. 14^{k} â€“ 14^{k}. 14
From equation (1) we get
= 41. 27m + 14^{k} ( 41 â€“ 14)
By multiplying the terms
= 41. 27m + 27. 14^{k}
By taking out the common terms
= 27 (41m â€“ 14^{k})
= 27r, where r = (41m â€“ 14^{k}) is a natural number
So 41^{k + 1} â€“ 14^{k + 1} is a multiple of 27
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.
24. (2nÂ +7) < (nÂ + 3)^{2}
Solution:
We can write the given statement as
P(n): (2nÂ +7) < (nÂ + 3)2
If n = 1 we get
2.1 + 7 = 9 < (1 + 3)^{2}Â = 16
Which is true.
Consider P (k) be true for some positive integer k
(2kÂ + 7) < (kÂ + 3)^{2}Â â€¦ (1)
Now let us prove that P (k + 1) is true.
Here
{2 (k + 1) + 7} = (2k + 7) + 2
We can write it as
= {2 (k + 1) + 7}
From equation (1) we get
(2k + 7) + 2 < (k + 3)^{2} + 2
By expanding the terms
2 (k + 1) + 7 < k^{2} + 6k + 9 + 2
On further calculation
2 (k + 1) + 7 < k^{2} + 6k + 11
Here k^{2} + 6k + 11 < k^{2} + 8k + 16
We can write it as
2 (k + 1) + 7 < (k + 4)^{2}
2 (k + 1) + 7 < {(k + 1) + 3}^{2}
P (k + 1) is true whenever P (k) is true.
Therefore, by the principle of mathematical induction, statement P (n) is true for all natural numbers i.e. n.