NCERT Solution For Class 11 Maths Chapter 4 Principle of Mathematical Induction

NCERT Solutions For Class 11 Maths Chapter 4 Principle of Mathematical Induction are given in an easy way at BYJU’S. Students learn about the Principle of Mathematical Induction and its application in detail through this chapter. After solving all the questions present in the NCERT textbook and Exemplar, students can easily score maximum marks for the questions of this chapter. 
Principle of Mathematical Induction is a specific technique used to prove certain mathematically accepted statements in algebra and in other applications of Mathematics, such as inductive and deductive reasoning. NCERT Solutions of BYJU’S cover all these concepts and help in scoring full marks for this chapter. These solutions are useful for further studies and for those who are preparing for competitive exams. NCERT Solutions For Class 11 Maths are very accurate and make it easy to crack the exam with good marks.

Download PDF of NCERT Solutions for Class 11 Maths Chapter 4- Principle of Mathematical Induction

Access Answers of Maths NCERT Class 11 Chapter 4- Principle of Mathematical Induction

ncert sol class 11 maths ch 4 01
ncert sol class 11 maths ch 4 02
ncert sol class 11 maths ch 4 03
ncert sol class 11 maths ch 4 04
ncert sol class 11 maths ch 4 05
ncert sol class 11 maths ch 4 06
ncert sol class 11 maths ch 4 07
ncert sol class 11 maths ch 4 08
ncert sol class 11 maths ch 4 09
ncert sol class 11 maths ch 4 10
ncert sol class 11 maths ch 4 11
ncert sol class 11 maths ch 4 12
ncert sol class 11 maths ch 4 13
ncert sol class 11 maths ch 4 14
ncert sol class 11 maths ch 4 15
ncert sol class 11 maths ch 4 16
ncert sol class 11 maths ch 4 17
ncert sol class 11 maths ch 4 18
ncert sol class 11 maths ch 4 19
ncert sol class 11 maths ch 4 20
ncert sol class 11 maths ch 4 21
ncert sol class 11 maths ch 4 22
ncert sol class 11 maths ch 4 23
ncert sol class 11 maths ch 4 24
ncert sol class 11 maths ch 4 25
ncert sol class 11 maths ch 4 26
ncert sol class 11 maths ch 4 27

 
Exercise 4.1 Solutions 24 Questions

Access NCERT Solutions for Class 11 Maths Chapter 4

Exercise 4.1 page: 94

Prove the following by using the principle of mathematical induction for all n ∈ N:

1.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 1

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 2

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 3

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 4

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 5

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 6

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 7

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 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.

3.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 9

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 10

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 11

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 12

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 13

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 14

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 15

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 16

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 17

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 18

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 19

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 20

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 21

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 22

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 23

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 24

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 25

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 26

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 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.

8. 1.2 + 2.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 2

Solution:

We can write the given statement as

P (n): 1.2 + 2.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 2

If n = 1 we get

P (1): 1.2 = 2 = (1 – 1) 21+1 + 2 = 0 + 2 = 2

Which is true.

Consider P (k) be true for some positive integer k

1.2 + 2.22 + 3.22 + … + k.2k = (k – 1) 2k + 1 + 2 … (i)

Now let us prove that P (k + 1) is true.

Here

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 28

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 29

Solution:

We can write the given statement as

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 30

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 31

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 32

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 33

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 34

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 35

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 36

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 37

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 38

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 39

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 40

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 41

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 42

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 43

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 44

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 45

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 46

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 47

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 48

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 49

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 50

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 51

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 52

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 53

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 54

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 55

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 56

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 57

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 58

Solution:

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 59

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 60

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 61

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.

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 62

Solution:

We can write the given statement as

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 63

NCERT Solutions for Class 11 Chapter 4 Ex 4.1 Image 64

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. 102n – 1 + 1 is divisible by 11

Solution:

We can write the given statement as

P (n): 102n – 1 + 1 is divisible by 11

If n = 1 we get

P (1) = 102.1 – 1 + 1 = 11, which is divisible by 11

Which is true.

Consider P (k) be true for some positive integer k

102k – 1 + 1 is divisible by 11

102k – 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 (102k-1 + 1 – 1) + 1

We get

= 10 2 (102k-1 + 1) – 102 + 1

Using equation 1 we get

= 102. 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. x2n – y2n is divisible by x y

Solution:

We can write the given statement as

P (n): x2n – y2n is divisible by x y

If n = 1 we get

P (1) = x2 × 1 – y2 × 1 = x2 – y2 = (y) (x – y), which is divisible by (x + y)

Which is true.

Consider P (k) be true for some positive integer k

x2k – y2k is divisible by x y

x2k – y2k = m (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 . x2 – y2k . y2

By adding and subtracting y2k we get

= x2 (x2k – y2k + y2k) – y2k. y2

From equation (1) we get

= x2 {m (x + y) + y2k} – y2k. y2

By multiplying the terms

= m (x + y) x2 + y2k. x2 – y2k. y2

Taking out the common terms

= m (x + y) x2 + y2k (x2 – y2)

Expanding using formula

= m (x + y) x2 + y2k (x + y) (x – y)

So we get

= (x + y) {mx2 + y2k (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. 32n + 2 – 8n – 9 is divisible by 8

Solution:

We can write the given statement as

P (n): 32n + 2 – 8n – 9 is divisible by 8

If n = 1 we get

P (1) = 32 × 1 + 2 – 8 × 1 – 9 = 64, which is divisible by 8

Which is true.

Consider P (k) be true for some positive integer k

32k + 2 – 8k – 9 is divisible by 8

32k + 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 . 32 – 8k – 8 – 9

By adding and subtracting 8k and 9 we get

= 32 (32k + 2 – 8k – 9 + 8k + 9) – 8k – 17

On further simplification

= 32 (32k + 2 – 8k – 9) + 32 (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. 41n – 14n is a multiple of 27

Solution:

We can write the given statement as

P (n):41n – 14nis a multiple of 27

If n = 1 we get

P (1) = 411 – 141 = 27, which is a multiple by 27

Which is true.

Consider P (k) be true for some positive integer k

41k – 14kis a multiple of 27

41k – 14k = 27m, where m ∈ N …… (1)

Now let us prove that P (k + 1) is true.

Here

41k + 1 – 14 k + 1

We can write it as

= 41k. 41 – 14k. 14

By adding and subtracting 14k we get

= 41 (41k – 14k + 14k) – 14k. 14

On further simplification

= 41 (41k – 14k) + 41. 14k – 14k. 14

From equation (1) we get

= 41. 27m + 14k ( 41 – 14)

By multiplying the terms

= 41. 27m + 27. 14k

By taking out the common terms

= 27 (41m – 14k)

= 27r, where r = (41m – 14k) is a natural number

So 41k + 1 – 14k + 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. (2+7) < (n + 3)2

Solution:

We can write the given statement as

P(n): (2+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 < k2 + 6k + 9 + 2

On further calculation

2 (k + 1) + 7 < k2 + 6k + 11

Here k2 + 6k + 11 < k2 + 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.


NCERT Solutions for Class 11 Maths Chapter 4- Principle of Mathematical Induction

This chapter has only one exercise which will help students in understanding the concepts related to the Principle of Mathematical Induction clearly. The major topic and subtopics covered in Chapter 4  Principle of Mathematical Induction of NCERT Solutions for Class 11 include the following.
4.1 Introduction
Here, students can understand deductive reasoning with suitable examples. This section explains the assumptions that are made on the basis of certain universal facts. 
4.2 Motivation
In this section, mathematical induction is explained with a real-life scenario to make the students understand how it basically works.
4.3 The Principle of Mathematical Induction
This section explains the Principle of Mathematical Induction using inductive step and the inductive hypothesis.
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).

Key Features of NCERT Solutions for Class 11 Maths Chapter 4- Principle of Mathematical Induction

Studying the Principle of Mathematical Induction of Class 11 enables the students to understand the process of the proof by induction, motivating the application of the method by looking at natural numbers as the least inductive subset of real numbers. Students also get to know the principle of mathematical induction and its applications after going through the solutions of NCERT questions. The summary of the concepts discussed and used in the solutions of this chapter are:

  1. One key basis for mathematical thinking is deductive reasoning. In contrast to deduction, inductive reasoning depends on working with different cases and developing a conjecture by observing incidences until we have observed each and every case. Thus, in simple language we can say the word ‘induction’ means the generalization from particular cases or facts
  2. The principle of mathematical induction is one such tool which can be used to prove a wide variety of mathematical statements. Each such statement is assumed as P(n) associated with positive integer n, for which the correctness of the case n = 1 is examined. Then assuming the truth of P(k) for some positive integer k, the truth of P (k+1) is established.