4

PRINCIPLE OF
MATHEMATICAL INDUCTION
INTRODUCTION
In drawing mathematical or scientific conclusions, there are two basic processes of reasoning that
are commonly used. These are induction and deduction—induction is the process of reasoning

m
from particular to general and deduction is the process of reasoning from general to particular. In this
chapter, we shall study induction. Induction begins by observations, and from observations we
.co
arrive at some tentative conclusions, called conjectures. A conjecture may be true or false. The
principle of mathematical induction helps us in proving some of these conjectures which are true.

4.1 MATHEMATICAL STATEMENT

la
A statement involving mathematical relation or relations is called a mathematical statement.
Consider the statements :
iy

1. 6 is an even natural number.

2. (x + 2) is a factor of x2 – 3x + 2.
3. Mumbai is the capital of Maharashtra.
dh

n ( n + 1)
4. Sum of first n natural numbers is .
2
5. If A, B are any sets, then A ∩ B = B ∩ A.
bo

Clearly, statements 1, 2, 4 and 5 are mathematical statements.

Notation for Mathematical Statements

Consider the mathematical statements :
1. n(n + 1) is divisible by 2.
2. 32n – 1 is divisible by 8.
3. n2 – n + 41 is a prime integer.
4. If a set S contains n distinct objects, then the number of subsets of S is 2n.
All these statements are concerned with natural number ‘n’, which takes values 1, 2, 3, …
such statements are usually denoted by P(n) or S(n) etc. By giving particular values to n, we get
particular statement. For example, if the statement “23n – 1 is divisible by 7” is denoted by P(n),
then P(2) is the statement “23 × 2 – 1 is divisible by 7”.

ILLUSTRATIVE EXAM PLES

Example 1. If P(n) is the statement “n3 + n is divisible by 3”, show that P(3) is true but P(4) is not
true.
Solution. P(n) is the statement “n3 + n is divisible by 3”,
∴ P(3) is 33 + 3 is divisible by 3 i.e. 30 is divisible by 3. Clearly it is true.
P(4) is 43 + 4 is divisible by 3 i.e. 68 is divisible by 3. Clearly it is not true.
204 MATHEMATICS – XI

Example 2. Let P(n) be the statement “32n – 1 is divisible by 8”. What is P(n + 1) ?
Solution. Given P(n) is the statement “32n – 1 is divisible by 8”. To obtain P(n + 1), replace
n by (n + 1) in P(n),
∴ P(n + 1) is the statement “32(n+1) – 1 is divisible by 8”.
Example 3. Let P(n) be the statement “n2 + n is an odd integer”. Show that if P(m) is true then
P(m + 1) is also true.
Solution. Given statement P(n) is “n2 + n is an odd integer”.
Let P(m) be true ⇒ m2 + m is an odd integer …(i)
Now, (m + 1)2 + (m + 1) = m2 + 2m + 1 + m + 1
= (m2 + m) + (2m + 2)
= an odd integer + 2(m + 1) (using (i))
= an odd integer + an even integer
( Q 2 divides 2(m + 1) for all m ∈ N)
= an odd integer
⇒ P(m + 1) is true.

m
Example 4. Let P(n) be the statement “23n – 1 is divisible by 7”. Prove that if P(m) is true then
P(m + 1) is also true.
.co
Solution. Given statement P(n) is “23n – 1 is divisible by 7”.
Let P(m) be true ⇒ 23m – 1 is divisible by 7
⇒ 23m – 1 = 7λ, for some integer λ
la
⇒ 23m = 1 + 7λ …(i)
Now, 23(m+1) –1 = 23m.23 – 1 = (1 + 7λ).8 – 1 (using (i))
iy

= 7 + 56λ = 7(1 + 8λ), which is divisible by 7

⇒ P(m + 1) is true.
dh

Example 5. Let P(n) be the statement “3n > n”, show that if P(m) is true then P(m + 1) is also true.
Solution. Given statement P(n) is “3n > n”.
Let P(m) be true
bo

⇒ 3m > m
⇒ 3.3m > 3.m (multiply both sides by 3)
⇒ 3m+1 > m + 2m
⇒ 3m+1 > m + 1 ( Q 2m > 1 for every m ∈ N)
⇒ P(m + 1) is true.

EXERCISE 4.1
1. If P(n) is the statement “n(n + 1) (n + 2) is divisible by 6”, then what is P(3) ?
[Ans. 60 is divisible by 6]
2. If P (n) is the statement “10n + 3 is prime”, then show that P (1) and P (2) are true but
P (3) is not true.
3. If P(n) is the statement “n(n + 1) (n + 2) is an integral multiple of 12”, prove that P(3) and
P(4) are true but P(5) is not true.
4. If P(n) is the statement “n2 – n + 41 is prime”, show that P(1), P(2), and P(3) are true but
P(41) is not true.
5. Let P (n) be the statement “n2 + n is an even integer”. Show that if P (k) is true then
P (k + 1) is also true.
PRINCIPLE OF MATHEMATICAL INDUCTION 205
6. Let P(n) denote the statement “32n – 1 is a multiple of 8”. Show that
(i) P(1), P(2) are true (ii) if P(m) is true then P(m + 1) is also true.
7. If P(n) is the statement “n2 > 100”, then show that whenever P (m) is true, P(m + 1) is also
true.
8. Let P(n) be the statement “2n ≥ 3n”. Show that if P(m) is true, then P(m + 1) is also true.

4.2 PRINCIPLE OF MATHEMATICAL INDUCTION

4.2.1 Motivation
To understand the basic principle of mathematical induction, suppose a set of thin rectangular
tiles are placed as shown in the figure given below.

m
When the first tile is pushed in the indicated direction, all the tiles will fall. To be absolutely
sure that all the tiles will fall, it is sufficient to know that
(i) the first tile falls, and
.co
(ii) in the event that any tile falls its successor necessarily falls.
This is the underlying principle of mathematical induction.
A set S is said to be an inductive set if I ∈ S and x + 1 ∈ S whenever x ∈ S.
la
We know that the set of natural number’s N is a special ordered subset of the set of real
numbers and it is the smallest subset of R which is inductive.
iy

4.2.2 Principle of Mathematical Induction

Let P(n) be a statement involving the natural number n, then P(n) is true for all natural numbers n if
dh

(i) P(1) is true

(ii) P(m + 1) is true whenever P(m) is true.
In other words, to prove that a statement P(n) is true for all natural numbers n, we have to go through
bo

two steps :
(i) verify the result for n = 1.
(ii) assume the result to be true for n = m and prove the result for n = m + 1.

REMARK
We emphasize that the proof by mathematical induction requires the fulfilment of both the
conditions (i) and (ii) as stated above.

ILLUSTRATIVE EXAM PLES

Example 1. Prove by mathematical induction that the sum of first n odd natural numbers is n2.
Solution. Let P(n) be the statement
“1 + 3 + 5 + … to n terms = n2 ”
i.e. 1 + 3 + 5 + … + (2n – 1) = n2
( Q 1, 3, 5, … form an A.P., ∴ Tn = 1 + (n – 1).2 = 2n – 1)
Now P(1) means 1 = 12 i.e. 1 = 1, which is true
⇒ P(1) is true.
Let P(m) be true i.e. 1 + 3 + 5 + … + (2m – 1) = m2 …(i)
206 MATHEMATICS – XI

For P(m + 1) : 1 + 3 + 5 + … to (m + 1) terms

= 1 + 3 + 5 + … + (2(m + 1) – 1)
= 1 + 3 + 5 + … + (2m + 1)
= [1 + 3 + 5 + … + (2m – 1)] + (2m + 1)
= m2 + (2m + 1) (using (i))
2
= m + 2m + 1 = (m + 1) 2

⇒ P(m + 1) is true.
Hence, by principle of mathematical induction, P(n) is true for all n. Therefore, the sum of
first n odd natural numbers is n2.
Example 2. Prove by induction that
1 + 5 + 9 + … + (4n – 3) = n (2n – 1), for all n ∈ N. (NCERT Examplar Problems)
Solution. Let P (n) be the statement
1 + 5 + 9 + … + (4n – 3) = n (2n – 1).
Now P(1) means 1 = 1(2 . 1 – 1) i.e. 1 = 1, which is true ⇒ P(1) is true.
Let P (m) be true

m
i.e. 1 + 5 + 9 + … + (4m – 3) = m (2m – 1) …(i)
For P (m + 1) : 1 + 5 + 9 + … + (4m – 3) + (4 (m + 1) – 3)
= m (2m – 1) + (4m + 1) (using (i))
.co
= 2 m2 + 3m + 1 = (m + 1) (2m + 1)
= (m + 1) (2 (m + 1) – 1)
⇒ P(m + 1) is true.
la
Hence, by induction, P (n) is true for all n ∈ N.
Example 3. Prove by principle of mathematical induction that
iy

n (n + 1) (n + 2)
1.2 + 2.3 + 3.4 + … + n (n + 1) = , for all n ∈ N. (NCERT)
3
dh

Solution. Let P (n) be the statement

n (n + 1) (n + 2)
1.2 + 2.3 + 3.4 + … + n (n + 1) = .
3
bo

1. 2 . 3
Now P(1) means 1.2 = i.e. 2 = 2, which is true
3
⇒ P(1) is true.
Let P (m) be true
m (m + 1) (m + 2)
i.e. 1.2 + 2.3 + 3.4 + … + m (m + 1) = …(i)
3
For P (m + 1) : 1.2 + 2.3 + 3.4 + … + (m + 1) ( m + 1 + 1)
= 1.2 + 2.3 + 3.4 + … + (m + 1) (m + 2)
= (1.2 + 2.3 + 3.4 + … + m (m + 1)) + (m + 1) (m + 2)
m (m + 1) (m + 2)
= + (m + 1) (m + 2) (using (i))
3

⎛m ⎞ (m + 1) (m + 2) (m + 3)
= (m + 1) (m + 2) ⎜ + 1⎟ =
⎝3 ⎠ 3
⇒ P(m + 1) is true.
Hence, by induction, P (n) is true for all n ∈ N.
PRINCIPLE OF MATHEMATICAL INDUCTION 207
Example 4. For all n ∈ N, prove by induction that
n ( n + 1) ( 2n + 1)
12 + 22 + 32 + … + n2 = . (NCERT)
6
n ( n + 1) ( 2 n + 1)
Solution. Let P(n) be the statement 12 + 22 + 32 + … + n2 = .
6
1 (1 + 1) ( 2 . 1 + 1) 2×3
Now P(1) means 12 = i.e. 1 = i.e. 1 = 1, which is true
6 6
⇒ P(1) is true.
Let P(m) be true
m ( m + 1) ( 2 m + 1)
i.e. 1 2 + 22 + 32 + … + m2 = …(i)
6
For P(m + 1) : 12 + 22 + 32 + … + m2 + (m + 1)2
= (12 + 22 + 32 + … + m2) + (m + 1)2
m ( m + 1) ( 2 m + 1)
= + (m + 1)2 (using (i))
6

m
m ( m + 1) ( 2 m + 1) + 6 ( m + 1) 2 ( m + 1) ( 2 m 2 + m + 6 m + 6 )
= =
6 6
( m + 1) ( 2 m 2 + 7 m + 6 ) ( m + 1) ( m + 2 ) ( 2 m + 3 )
= =
.co
6 6
( m + 1) ( m + 2 ) ( 2 ( m + 1) + 1)
=
6
⇒
la
P(m + 1) is true.
Hence, by induction, P(n) is true for all n ∈ N.
iy

Example 5. Prove by induction that

2
⎛ n ( n + 1) ⎞
13 + 23 + 33 + … + n3 = ⎜ ⎟ , for all n ∈ N. (NCERT)
⎝ ⎠
dh

2
2
⎛ n ( n + 1) ⎞
Solution. Let P(n) be the statement 13 + 23 + 33 + … + n3 = ⎜ ⎟ .
⎝ 2 ⎠
bo

2
⎛ 1 (1 + 1) ⎞
Now P(1) means 13 = ⎜ ⎟ i.e. 1 = 12 or 1 = 1, which is true
⎝ 2 ⎠
⇒ P(1) is true.
Let P(m) be true
2
⎛ m ( m + 1) ⎞
i.e. 1 3 + 23 + 33 + … + m3 = ⎜ ⎟ …(i)
⎝ 2 ⎠
For P(m + 1) : 13 + 23 + 33 + … + (m + 1)3
= (13 + 23 + 33 + … + m3) + (m + 1)3
2
⎛ m ( m + 1) ⎞
= ⎜ ⎟ + (m + 1)3 (using (i))
⎝ 2 ⎠
⎡ m2 ⎤
= (m + 1)2 ⎢ + (m + 1)⎥
⎢⎣ 4 ⎥⎦
2
m 2 + 4 m + 4 ⎛ ( m + 1) ( m + 2 ) ⎞
= (m + 1)2 =⎜ ⎟
4 ⎝ 2 ⎠
⇒ P(m + 1) is true.
Hence, by induction, P(n) is true for all n ∈ N.
208 MATHEMATICS – XI

Example 6. For all n ∈ N, using principle of mathematical induction prove that :

1 1 1 2n
1+ + +…+ = . (NCERT)
1+ 2 1+ 2+ 3 1+ 2+ 3+…+ n n+1
Solution. Let P(n) be the statement
1 1 1 2n
1+ + +…+ = .
1+ 2 1+ 2 + 3 1+ 2 + 3 +…+ n n+1
2.1 2
Now P(1) means 1 = i.e. 1 = or 1 = 1, which is true
1+1 2
⇒ P(1) is true.
Let P(m) be true
1 1 1 2m
i.e. 1+ + +…+ = …(i)
1+ 2 1+ 2 + 3 1+ 2 + 3 +…+ m m+1

1 1 1 1
For P(m + 1) : 1 + + +…+ +
1+ 2 1+ 2 + 3 1 + 2 + 3 + … + m 1 + 2 + 3 + … + ( m + 1)

⎛ 1 1 1 ⎞ 1
= ⎜1 + + +… ⎟+
⎝ 1+ 2 1+ 2 + 3 1 + 2 + 3 + … + m ⎠ 1 + 2 + 3 + … + ( m + 1)

m
2m 1
= + (using (i))
m + 1 1 + 2 + 3 + … + ( m + 1)
2m 1
.co
= +
m+1 ( m + 1) ( m + 2 )
2
⎡
⎢Q 1 + 2 + 3 + … + (m + 1) = sum of (m + 1) terms of an A.P. whose
la
⎢⎣
1st term is 1 and common difference is 1
m+1 ( m + 1) ( m + 2 ) ⎤
= (2 . 1 + ( m + 1 – 1) . 1) = ⎥
iy

2 2 ⎦
2m 2 2 ⎛ 1 ⎞
= + = ⎜m + ⎟
dh

m + 1 ( m + 1) ( m + 2 ) m+1 ⎝ m + 2⎠

2 m2 + 2m + 1 2 ( m + 1) 2 2 ( m + 1)
= . = =
m+1 m+2 ( m + 1) ( m + 2 ) m+2
bo

⇒ P(m + 1) is true.
Hence, by principle of mathematical induction, P(n) is true for all n ∈ N.
Example 7. Using principle of mathematical induction prove that
( 2n − 1) 3n + 1 + 3
1.3 + 2.32 + 3.33 + … + n.3n = , for all n ∈ N. (NCERT)
4
Solution. Let P(n) be the statement
( 2 n − 1) 3 n + 1 + 3
1.3 + 2.32 + 3.33 + … + n.3n = .
4

( 2.1 – 1) 31+ 1 + 3 1.9 + 3 12

Now P(1) means 1.3 = i.e. 3 = i.e. 3 = i.e. 3 = 3, which is true
4 4 4
⇒ P(1).
Let P(m) be true
( 2 m – 1) 3 m+ 1 + 3
i.e. 1.3 + 2.32 + 3.33 + … + m.3m = …(i)
4
For P(m + 1) : 1.3 + 2.32 + 3.33 + … + (m + 1).3m + 1
= (1.3 + 2.32 + 3.33 + … + m.3m) + (m + 1). 3m + 1
PRINCIPLE OF MATHEMATICAL INDUCTION 209

( 2 m – 1).3 m+ 1 + 3
= + (m + 1).3m + 1 (using (i))
4

( 2 m – 1). 3 m + 1 + 3 + ( 4 m + 4 ). 3 m + 1
=
4

( 6 m + 3 ). 3 m + 1 + 3 ( 2 m + 1). 3 . 3 m + 1 + 3
= =
4 4

( 2( m + 1) – 1). 3 m + 2 + 3
=
4
⇒ P (m + 1) is true.
Hence, by principle of mathematical induction, P (n) is true for all n ∈ N.
Example 8. Use induction to prove that
⎛ 3⎞ ⎛ 5⎞ ⎛ 7⎞ ⎛ 2n + 1 ⎞
⎜1 + ⎟ ⎜1 + ⎟ ⎜1 + ⎟ … ⎜1 + ⎟ = ( n + 1 ) 2, for all n ∈ N. (NCERT)
⎝ 1 ⎠ ⎝ 4 ⎠ ⎝ 9 ⎠ ⎝ n2 ⎠
Solution. Let P(n) be the statement
⎛ 3⎞ ⎛ 5⎞ ⎛ 7⎞ ⎛ 2n + 1⎞
⎜1 + ⎟ ⎜1 + ⎟ ⎜1 + ⎟ … ⎜1 + ⎟ = (n + 1)2.

m
⎝ 1⎠ ⎝ 4⎠ ⎝ 9⎠ ⎝ n2 ⎠

3
Now P(1) means 1 + = (1 + 1)2 i.e. 4 = 4, which is true
1
.co
⇒ P(1) is true.
Let P(m) be true

⎛ 3⎞ ⎛ 5⎞ ⎛ 7⎞ ⎛ 2m + 1⎞
la
i.e. ⎜1 + ⎟ ⎜1 + ⎟ ⎜1 + ⎟ … ⎜1 + ⎟ = (m + 1)2 …(i)
⎝ 1⎠ ⎝ 4⎠ ⎝ 9⎠ ⎝ m2 ⎠

⎛ 2( m + 1) + 1 ⎞
P(m + 1) : ⎛⎜ 1 + ⎞⎟ ⎛⎜ 1 + ⎞⎟ ⎛⎜ 1 + ⎞⎟ … ⎜ 1 +
3 5 7
iy

For 2 ⎟
⎝ 1⎠ ⎝ 4⎠ ⎝ 9⎠ ⎝ ( m + 1) ⎠

2m + 1⎞ ⎛ 2m + 3 ⎞
= ⎛⎜ 1 + ⎞⎟ ⎛⎜ 1 + ⎞⎟ ⎛⎜ 1 + ⎞⎟ … ⎛⎜ 1 +
dh

3 5 7
2 ⎟ ⎜
1+ 2⎟
⎝ 1⎠ ⎝ 4⎠ ⎝ 9⎠ ⎝ m ⎠ ⎝ ( m + 1) ⎠

2m + 3 ⎞
= (m + 1)2 ⎛⎜ 1 + ⎟ (using (i))
⎝ ( m + 1) 2 ⎠
bo

( m + 1) 2 + 2 m + 3
= (m + 1)2 . = (m + 1)2 + 2m + 3
( m + 1) 2

= m2 + 4m + 4 = (m + 2)2 = ( m + 1 + 1)2
⇒ P (m + 1) is true.
Hence, by principle of mathematical induction, P (n) is true for all n ∈ N.

Example 9. Using induction, prove that :

⎛ 1⎞ ⎛ 1⎞ ⎛ 1⎞ ⎛ 1⎞ n+1
⎜1 − 2 ⎟ ⎜1 − 2 ⎟ ⎜1 − 2 ⎟ … ⎜1 − 2 ⎟ = for all natural numbers n, n ≥ 2.
⎝ 2 ⎠ ⎝ 3 ⎠ ⎝ 4 ⎠ ⎝ n ⎠ 2n
(NCERT Examplar Problems)
Solution. Let P(n) be the statement
⎛ 1⎞ ⎛ 1⎞ ⎛ 1⎞ ⎛ 1⎞ n+1
⎜1 − 2 ⎟ ⎜1 − 2 ⎟ ⎜1 − 2 ⎟ … ⎜1 − 2 ⎟ = , n ≥ 2.
⎝ 2 ⎠ ⎝ 3 ⎠ ⎝ 4 ⎠ ⎝ n ⎠ 2n

2+1
Now P(2) means ⎛⎜ 1 − 2 ⎞⎟ =
1 1 3 3 3
i.e. 1 − = i.e. = , which is true
⎝ 2 ⎠ 2×2 4 4 4 4
⇒ P(2) is true.
210 MATHEMATICS – XI

Let P(m) be true

m+1
i.e. ⎛⎜ 1 − 2 ⎞⎟ ⎛⎜ 1 − 2 ⎞⎟ ⎛⎜ 1 − 2 ⎞⎟ … ⎛⎜ 1 − 2 ⎞⎟ =
1 1 1 1
…(i)
⎝ 2 ⎠ ⎝ 3 ⎠ ⎝ 4 ⎠ ⎝ m ⎠ 2m

1 ⎞⎛ ⎞
For P(m + 1) : ⎛⎜ 1 −
1⎞ ⎛ 1⎞ ⎛ 1⎞ ⎛ 1
⎟ ⎜1 − 2 ⎟ ⎜1 − 2 ⎟ … ⎜1 − 2 ⎟ ⎜1 − ⎟
⎝ 22 ⎠ ⎝ 3 ⎠ ⎝ 4 ⎠ ⎝ m ⎠⎝ (m + 1)2 ⎠

m + 1 (m + 1)2 − 1
= × (using (i))
2m (m + 1)2

m2 + 2m m+2 (m + 1) + 1
= = =
2m (m + 1) 2 (m + 1) 2 (m + 1)
⇒ P (m + 1) is true.
Hence, by induction, P(n) is true for natural numbers n, n ≥ 2.

NOTE
In the above example, the given statement starts with n = 2.

Example 10. By principle of mathematical induction, prove that for all n ∈ N

m
1 1 1 1 n
+ + +…+ = . (NCERT)
2.5 5.8 8.11 (3n – 1) (3n + 2) 6n + 4
Solution. Let P(n) be the statement
.co
1 1 1 1 n
+ + +…+ = .
2.5 5.8 8.11 ( 3n – 1) ( 3n + 2) 6n + 4
la
1 1 1 1
Now P(1) means = i.e. = , which is true
2.5 6.1 + 4 10 10
⇒ P(1) is true.
iy

Let P(m) be true

dh

1 1 1 1 m
i.e. + + +…+ = …(i)
2.5 5.8 8.11 ( 3m – 1) ( 3m + 2) 6m + 4

1 1 1 1
For P(m + 1) : + + +…+
2.5 5.8 8.11 ( 3(m + 1) − 1) ( 3(m + 1) + 2)
bo

= ⎡⎢ ⎤
1 1 1 1 1
+ + +…+ +
⎣ 2.5 5.8 8.11 ( 3m – 1) ( 3m + 2) ⎥⎦ ( 3m + 2) ( 3m + 5)

m 1
= + (using (i))
6m + 4 ( 3 m + 2 ) ( 3 m + 5)

m 1
= +
2( 3m + 2) ( 3 m + 2 ) ( 3 m + 5)

m ( 3 m + 5) + 2 3m2 + 5m + 2
= =
2( 3 m + 2 ) ( 3 m + 5 ) 2( 3 m + 2 ) ( 3 m + 5 )

( 3m + 2) (m + 1) m+1 m+1
= = =
2( 3m + 2) ( 3m + 5) 2( 3m + 5) 6(m + 1) + 4

⇒ P(m + 1) is true.
Hence, by principle of mathematical induction, P(n) is true for all n ∈ N.
220 MATHEMATICS – XI

EXERCISE 4.2
Using the principle of mathematical induction prove that (1 to 26) for all n ∈ N :
1. 2 + 4 + 6 + … + 2n = n2 + n. (NCERT Examplar Problems)
1
2. 1 + 4 + 7 + … + (3 n – 2) = n (3 n – 1).
2

3
3. 3 x + 6 x + 9 x + … to n terms = n (n + 1)x.
2

n( 4n 2 – 1)
4. 12 + 32 + 52 + … to n terms = . (NCERT)
3
1 1 1 1 1
5. + + +…+ n = 1– n . (NCERT)
2 4 8 2 2
6. 3.6 + 6.9 + 9.12 + … + 3 n (3 n + 3) = 3 n (n + 1) (n + 2).
7. 1.2 + 2.22 + 3.23 + … + n.2n = (n – 1).2n+1 + 2. (NCERT)
n (n + 1) (n + 2) (n + 3)
8. 1.2.3 + 2.3.4 + 3.4.5 + … + n (n + 1) (n + 2) = . (NCERT)
4

m
9. ⎛ 1 + ⎞ ⎛ 1 + ⎞ ⎛ 1 + ⎞ … ⎛ 1 + ⎞ = n + 1
1 1 1 1
(NCERT)
⎝ 1⎠ ⎝ 2⎠ ⎝ 3⎠ ⎝ n⎠
.co
10. ⎛ 1 – ⎞ ⎛ 1 – ⎞ ⎛ 1 – ⎞ L ⎛ 1 –
1 1 1 1 ⎞ 1
= .
⎝ 2⎠ ⎝ 3⎠ ⎝ 4⎠ ⎝ n + 1⎠ n+1

1 1 1 n
11. + + + L to n terms =
la
1.2 2.3 3.4 n+1
1 1 1 1 n
12. + + +…+ = .
3.6 6.9 9 . 12 3 n ( 3 n + 3) 9 (n + 1)
iy

1 1 1 n
13. + + + L to n terms = .
1.3 3.5 5.7 2n + 1
dh

1 1 1 1 n
14. + + +…+ = . (NCERT)
1 . 4 4 . 7 7 . 10 ( 3 n – 2 ) ( 3 n + 1) 3 n + 1

1 1 1 1 n
bo

15. + + +…+ = . (NCERT)

3.5 5.7 7 .9 ( 2 n + 1) ( 2 n + 3 ) 3 ( 2 n + 3 )
16. 22n – 1 is divisible by 3. (NCERT Examplar Problems)
17. 23n – 1 is divisible by 7. (NCERT Examplar Problems)
18. 32n when divided by 8, leaves the remainder 1.
19. 102n–1 + 1 is divisible by 11. (NCERT)
20. 7n – 3n is divisible by 4. (NCERT)
21. 4n + 15n – 1 is divisible by 9.
22. 32n+2 – 8n – 9 is a multiple of 64. (NCERT)
23. n(n + 1) (n + 5) is a multiple of 3. (NCERT)
24. n3 + (n + 1)3 + (n + 2)3 is a multiple of 9.
25. x2n–1 – 1 is divisible by (x – 1), x ≠ 1.
26. 3n > n for all n ∈ N.
27. Prove, by induction, that 5n+1 + 4.6n when divided by 20 leaves the remainder 9 for all
n ∈ N.
28. Prove, by induction, that 8.7n + 4n+2 is divisible by 24 but not by 48 for all n ∈ N.