11 Mathematics Ncert Ch04 Principle of Mathematical Induction 4.1 Sol

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 13

Class XI Mathematics NCERT Solutions

PRINCIPLE OF MATHEMATICAL INDUCTION


Exercise 4.1
Answers

1.

Let P ( n ) = 1 + 3 + 3 + .......... + 3

P (1) = 1 =

For n = 1

(3
=

1)

n 1

( 3 1)

P (1) is true.

Now,

let P ( n ) be true for n = k

P ( k ) = 1 + 3 + 32 + .......... + 3k 1 =

For n = k + 1

1=1

(3

1)

.(i)

(3
=

P ( k + 1) = 1 + 3 + 3 + .......... + 3

k 1

+3

1)
2

+ 3k

[Using eq. (i)]

3k 1 + 2.3k 3.3k 1 3k +1 1
=
=
2
2
2
P ( k + 1) is true.
P ( k + 1) =

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


2.

n ( n + 1)
Let P ( n ) = 1 + 2 + 3 + .......... + n =

2
3

1(1 + 1)
P (1) = 1 =

For n = 1

1=1

P (1) is true.

Now,

let P ( n ) be true for n = k

k ( k + 1)
P ( k ) = 1 + 2 + 3 + .......... + k =

2
3

.(i)

k ( k + 1)
3
P ( k + 1) = 1 + 2 + 3 + .......... + k + ( k + 1) =
+ ( k + 1)
2
2

For n = k + 1

2
k2

( k + 1) ( k + 2 )
2 k + 4k + 4
P ( k + 1) = ( k + 1) + k + 1 = ( k + 1)
=

4
4
4

( k + 1)( k + 2 )
P ( k + 1) =

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


3.

Let P ( n ) = 1 +

1
1
1
2n
+
+ .......... +
=
(1 + 2 + 3 + ...... + n ) ( n + 1)
(1 + 2 ) (1 + 2 + 3)
P (1) = 1 =

For n = 1

2 1
1+1

P (1) is true.

Now,

let P ( n ) be true for n = k

P (k ) = 1+

For n = k + 1

1=1

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

P ( k + 1) = 1 +

.(i)

1
1
1
+
+ .......... +
(1 + 2 ) (1 + 2 + 3)
(1 + 2 + 3 + ...... + k )
+

1
2k
1
[Using (i)]
=
+
(1 + 2 + 3 + ...... + k + 1) ( k + 1) (1 + 2 + 3 + ...... + k + 1)

2
2k
1
2k
2
2 ( k + 1) 2 ( k + 1)
+
P ( k + 1) =
=
+
=

=
k + 1 ( k + 1)( k + 2 )
k +2
k + 1 ( k + 1)( k + 2 ) k + 1 k + 2
2

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


4.

Let P ( n ) = 1.2.3 + 2.3.4 + .......... + n ( n + 1)( n + 2 ) =


P (1) = 1 2 3 =

For n = 1

1 2 3 4
4

P (1) is true.

Now,

let P ( n ) be true for n = k

P ( k ) = 1.2.3 + 2.3.4 + .......... + k ( k + 1)( k + 2 ) =

n ( n + 1)( n + 2 )( n + 3)
4

6=6

k ( k + 1)( k + 2 )( k + 3)
4

(i)

For n = k + 1

P ( k + 1) = 1.2.3 + 2.3.4 + .......... + k ( k + 1)( k + 2 ) + ( k + 1)( k + 2 )( k + 3)


k ( k + 1)( k + 2 )( k + 3)
+ ( k + 1)( k + 2 )( k + 3)
4
k
k +4
P ( k + 1) = ( k + 1)( k + 2 )( k + 3) + 1 = ( k + 1)( k + 2 )( k + 3)

4
4
=

[Using eq. (i)]

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

P ( k + 1) =

( k + 1)( k + 2 )( k + 3)( k + 4 )
4

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


5.

Let P ( n ) = 1.3 + 2.3 + 3.3 + .......... + n.3


2

P (1) = 1 3 =

For n = 1

2n 1) 3n +1 + 3
(
=
4

( 2 1 1) 3

1+1

+3

P (1) is true.

Now,

let P ( n ) be true for n = k

P ( k ) = 1.3 + 2.3 + 3.3 + .......... + k .3


2

2k 1) 3k +1 + 3
(
=
4

For n = k + 1
P ( k + 1) = 1.3 + 2.3 + 3.3 + .......... + k .3 + ( k + 1) 3
2

P ( k + 1) =

( 2k 1) 3
4

k +1

k +1

2k 1) 3k +1 + 3
(
=
+
4

( k + 1) 3k +1

3
2k 1
3
+ ( k + 1) 3k +1 = 3k +1
+ k + 1 +
4
4
4

2k 1 + 4k + 4 3
6k + 3 3
P ( k + 1) = 3k +1
+ = 3k +1
+

4
4 4

P ( k + 1) =

3=3

3k +1.3 ( 2k + 1) 3 ( 2k + 1) 3k + 2 + 3
+ =
4
4
4
P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


6.

n ( n + 1)( n + 2 )
Let P ( n ) = 1.2 + 2.3 + 3.4 + .......... + n ( n + 1) =

1(1 + 1)(1 + 2 )
P (1) = 1(1 + 1) =
For n = 1

P (1) is true.
Now,

2=2

let P ( n ) be true for n = k

P ( k ) = 1.2. + 2.3. + .......... + k ( k + 1) =

k ( k + 1)( k + 2 )
3

(i)

For n = k + 1

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

k ( k + 1)( k + 2 )
+ ( k + 1)( k + 2 )
3
k
k + 3 ( k + 1)( k + 2 )( k + 3)
P ( k + 1) = ( k + 1)( k + 2 ) + 1 = ( k + 1)( k + 2 )
=
3
3
3
P ( k + 1) = 1.2 + 2.3 + .......... + k ( k + 1) + ( k + 1)( k + 2 ) ==

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


7.

Let P ( n ) = 1.3 + 3.5 + 5.7 + .......... + ( 2n 1)( 2n + 1) =

n ( 4n 2 + 6n 1)
3

1 4 (1) + 6 1 1

P (1) = ( 2 1 1)( 2 1 + 1) =
3
P (1) is true.

Now,

let P ( n ) be true for n = k

For n = 1

P ( k ) = 1.3 + 3.5 + 5.7 + .......... + ( 2k 1)( 2k + 1) =

3=3

k ( 4k 2 + 6k 1)
3

For n = k + 1
P ( k + 1) = 1.3 + 3.5 + 5.7 + .......... + ( 2k 1)( 2k + 1) + 2 ( k + 1) 1 2 ( k + 1) + 1

k ( 4k 2 + 6k 1)
3

+ 2 ( k + 1) 1 2 ( k + 1) + 1

4k 3 + 6k 2 k + 3 ( 4k 2 + 8k + 3)
4k 3 + 6k 2 k
P ( k + 1) =
+ ( 2k + 1)( 2k + 3) =
3
3

2
4k 3 + 6k 2 k + 12k 2 + 24k + 9 4k 3 + 18k 2 + 23k + 9 ( k + 1) ( 4k + 14k + 9 )
P ( k + 1) =
=
=
3
3
3
P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


8.

Let P ( n ) = 1.2 + 2.22 + 3.23 + .......... + n.2n = ( n 1) 2n +1 + 2

P (1) = 1 21 = (1 1) 21+1 + 2

For n = 1

2=2

P (1) is true.

Now,

let P ( n ) be true for n = k

P ( k ) = 1.2 + 2.22 + 3.23 + .......... + k .2k = ( k 1) 2k +1 + 2

For n = k + 1

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

P ( k + 1) = 1.2 + 2.22 + 3.23 + .......... + k .2k + ( k + 1) .2k +1 = ( k 1) 2k +1 + 2 + ( k + 1) .2k +1

P ( k + 1) = ( k 1) .2k +1 + 2 + ( k + 1) .2k +1 = 2k +1 ( k 1 + k + 1) + 2 = 2 k +1 2k + 2 = k .2 k + 2 + 2

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


9.

Let P ( n ) =
For n = 1

1 1 1
1
1
+ + + .......... + n = 1 n
2 4 8
2
2
1
1
P (1) = 1 = 1 1
2
2

P (1) is true.

Now,

let P ( n ) be true for n = k

P (k ) =

1 1
=
2 2

1 1 1
1
1
+ + + .......... + k = 1 k
2 4 8
2
2

For n = k + 1
1 1 1
1
1
1
1
+ + + .......... + k + k +1 = 1 k + k +1
2 4 8
2
2
2 2
1
1
1
2 1
P ( k + 1) = 1 k k +1 = 1 k +1 = 1 k +1
2
2 2
2
P ( k + 1) =

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


10. Let P ( n ) =

1
1
1
1
n
+
+
+ .......... +
=
2.5 5.8 8.11
( 3n 1)( 3n + 2 ) ( 6n + 4 )
P (1) =

For n = 1

( 3 1 1)( 3 1 + 2 )

P (1) is true.

Now,

let P ( n ) be true for n = k

P(k ) =

1
( 6 1 + 4 )

1
1
=
10 10

1
1
1
1
k
+
+
+ .......... +
=
2.5 5.8 8.11
( 3k 1)( 3k + 2 ) ( 6k + 4 )

For n = k + 1

P ( k + 1) =

1
1
1
1
1
+
+
+ .......... +
+
2.5 5.8 8.11
( 3k 1)( 3k + 2 ) 3 ( k + 1) 1 3 ( k + 1) + 2
=

k +1
1
+
6 ( k + 1) + 4 3 ( k + 1) 1 3 ( k + 1) + 2

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

P ( k + 1) =

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

( 3k + 2 ) 2 3k + 5 ( 3k + 2 ) 2 ( 3k + 5) ( 3k + 2 ) 2 ( 3k + 5)

P ( k + 1) =

k +1
6k + 10

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


11. Let P ( n ) =

n ( n + 3)
1
1
1
1
+
+
+ .......... +
=
1.2.3 2.3.4 3.4.5
n ( n + 1)( n + 2 ) 4 ( n + 1)( n + 2 )
P (1) =

For n = 1

1(1 + 3)
1
=
1(1 + 1)(1 + 2 ) 4 (1 + 1)(1 + 2 )

P (1) is true.

Now,

let P ( n ) be true for n = k

P(k ) =

1 1
=
6 6

k ( k + 3)
1
1
1
1
+
+
+ .......... +
=
1.2.3 2.3.4 3.4.5
k ( k + 1)( k + 2 ) 4 ( k + 1)( k + 2 )

For n = k + 1

R.H.S. =

And

L.H.S. =

( k + 1)( k + 4 )
4 ( k + 2 )( k + 3)
k ( k + 3)
1
+
4 ( k + 2 )( k + 3) ( k + 1)( k + 2 )( k + 3)

.(i)

[Using eq. (i)]

k 3 + 6k 2 + 9k + 4
k 2 + 3k
1
1
+
=

4 ( k + 3)
k + 3 ( k + 1)( k + 2 )
( k + 1)( k + 2 ) 4

( k + 1) 2 ( k + 4 )
( k + 1)( k + 4 )
=

=
( k + 1)( k + 2 ) 4 ( k + 3) 4 ( k + 2 )( k + 3)
1

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


12. Let P ( n ) = a + ar + ar 2 + .......... + ar n 1 =
For n = 1

P (1) = ar11 =

a ( r 1)

a ( r n 1)
r 1

r 1

P (1) is true.

Now,

let P ( n ) be true for n = k

a=a

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

P ( k ) = a + ar + ar + .......... + ar
2

k 1

a ( r k 1)

For n = k + 1
R.H.S.

L.H.S.

a ( r k +1 1)

r 1

.(i)

r 1

L.H.S. =

a ( r k +1 1)
r 1

+ ar k

[Using eq. (i)]

ar k
a
a
a
1

+ ar k = ar k
= ar k
+ 1

r 1 r 1
r 1 r 1
r 1 r 1

k +1
ar k +1
a
ar k +1 a a ( r 1)

=
=
r 1 r 1
r 1
r 1
P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


2
3 5 7
2n + 1
13. Let P ( n ) = 1 + 1 + 1 + .......... 1 + 2 = ( n + 1)
n
1 4 9

( 2 1 + 1) = 1 + 1 2
P (1) = 1 +
For n = 1
4=4
( )
12

P (1) is true.

Now,

let P ( n ) be true for n = k

2
3 5 7
2k + 1
P ( k ) = 1 + 1 + 1 + .......... 1 + 2 = ( k + 1)
k
1 4 9

For n = k + 1

R.H.S.

= ( k + 2)

2k + 3
2
L.H.S. = ( k + 1) 1 +

( k + 1)2

.(i)

[Using eq. (i)]

( k + 1)2 + 2k + 3
2
L.H.S. = ( k + 1)
= k 2 + 4k + 4 = ( k + 2 )
2

( k + 1)

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


1 1 1
1
14. Let P ( n ) = 1 + 1 + 1 + .......... 1 + = ( n + 1)
1 2 3
n
1
For n = 1

P (1) = 1 + = 1 + 1
2=2
1

P (1) is true.

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

Now,

let P ( n ) be true for n = k

1 1 1
1
P ( k ) = 1 + 1 + 1 + .......... 1 + = ( k + 1)
1 2 3
k
R.H.S. = k + 2
For n = k + 1
1

L.H.S. = ( k + 1) 1 +
[Using eq. (i)]

k +1
k +1+1
L.H.S. = ( k + 1)
= ( k + 2)
k +1

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.

n ( 2n 1)( 2n + 1)
3
1( 2 1 1)( 2 1 + 1)
2
P (1) = ( 2 1 1) =
For n = 1
3

P (1) is true.

15. Let P ( n ) = 12 + 32 + 52 + .......... + ( 2n 1) =


2

Now,

1=1

let P ( n ) be true for n = k

k ( 2k 1)( 2k + 1)
3
( k + 1)( 2k + 1)( 2k + 3)
For n = k + 1
R.H.S. =
3
k ( 2k 1)( 2k + 1)
2
+ ( 2k + 1)

L.H.S. =
[Using eq. (i)]
3
P ( k ) = 12 + 32 + 52 + .......... + ( 2k 1) =
2

.(i)

2
k ( 2k + 1)

k 2 k + 6k + 3 ( 2k + 1) ( 2k + 5k + 3)
+ ( 2k + 1) = ( 2k + 1)
= ( 2k + 1)
=
3
3
3

( 2k + 1)( k + 1)( 2k + 3) = ( k + 1)( 2k + 1)( 2k + 3)


=
3
3
P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


16. Let P ( n ) =
For n = 1

1
1
1
1
n
+
+
+ .......... +
=
1.4 4.7 7.10
( 3n 2 )( 3n + 1) ( 3n + 1)
P (1) =

( 3 1 2 )( 3 1 + 1)

1
( 3 1 + 1)

1 1
=
4 4

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

P (1) is true.

Now,

let P ( n ) be true for n = k

P(k ) =

1
1
1
1
k
+
+
+ .......... +
=
1.4 4.7 7.10
( 3k 2 )( 3k + 1) ( 3k + 1)

For n = k + 1
L.H.S. =

R.H.S. =

k +1
3k + 1

.(i)

L.H.S. =

k
1
+
3k + 1 ( 3k + 1)( 3k + 4 )

1 3k 2 + 4k + 1
1 ( 3k + 1)( k + 1) k + 1
1
1
=
=
k
+

3k + 4
3k + 1
3k + 4 3k + 1 3k + 4 3k + 1
3k + 4
P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


17. Let P ( n ) =

1
1
1
1
n
+
+
+ .......... +
=
3.5 5.7 7.9
( 2n + 1)( 2n + 3) 3 ( 2n + 3)
P (1) =

For n = 1

( 2 1 + 1)( 2 1 + 3)

P (1) is true.

Now,

let P ( n ) be true for n = k

P(k ) =

1
3 ( 2 1 + 3)

1
1
1
1
k
+
+
+ .......... +
=
3.5 5.7 7.9
( 2k + 1)( 2k + 3) 3 ( 2k + 3)

For n = k + 1
L.H.S. =

R.H.S. =

k +1
3 ( 2k + 5 )

1
1
=
15 15

.(i)

L.H.S. =

k
1
+
3 ( 2k + 3) ( 2k + 3)( 2k + 5)

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

( 2 k + 3 ) 3 2 k + 5 ( 2 k + 3 ) 3 ( 2 k + 5 ) ( 2k + 3 ) 3 ( 2k + 5 )
=

k +1
3 ( 2k + 5 )

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


18. Let P ( n ) = 1 + 2 + 3 + .......... + n <
For n = 1

P (1) = 1 <

1
2
( 2n + 1)
8

1
2
( 2 1 + 1)
8

P (1) is true.

Now,

let P ( n ) be true for n = k

1<

9
8

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

P ( k ) = 1 + 2 + 3 + .......... + k <

For n = k + 1 ,

1
2
( 2k + 1)
8

.(i)

P ( k + 1) = 1 + 2 + 3 + .......... + k + ( k + 1) <

1
2
( 2k + 1) + ( k + 1)
8

Now, adding ( k + 1) on both sides of eq. (i), we have


1
2
( 2k + 1) + ( k + 1)
8
1
1 + 2 + 3 + .......... + k + ( k + 1) < ( 4k 2 + 4k + 1 + 8k + 8 )
8
1
1 + 2 + 3 + .......... + k + ( k + 1) < ( 4k 2 + 12k + 9 )
8
1
2
1 + 2 + 3 + .......... + k + ( k + 1) < ( 2k + 3 )
8
( k + 1)( k + 2 ) < 1 2k + 3 2

4 ( k + 1)( k + 2 ) < 4k 2 + 9 + 6k
(
)
2
8
1 + 2 + 3 + .......... + k + ( k + 1) <

4 ( k 2 + 3k + 2 ) < 4k 2 + 9 + 6k

8<9

P ( k + 1) is true.

Therefore, P ( k ) is true.

4 k 2 + 12 k + 8 < 4k 2 + 9 + 6 k

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


19. Let P ( n ) = n ( n + 1)( n + 5 ) is a multiple of 3.

P (1) = 1 (1 + 1) (1 + 5) is a multiple of 3 = 12 is a multiple of 3

For n = 1,

P (1) is true.
Let P ( n ) be true for n = k ,

k ( k + 1)( k + 5) = 3

For n = k + 1 ,

P ( k ) = k ( k + 1)( k + 5) is a multiple of 3.

k 3 + 6 k 2 + 5k = 3

k 3 = 3 6 k 2 5k

P ( k + 1) = ( k + 1)( k + 2 )( k + 6 ) is a multiple of 3

( k + 1)( k + 2 )( k + 6 ) = k 3 + 9k 2 + 20k + 12 = 3 6k 2 5k + 9k 2 + 20k + 12 [Using (i)]


= 3 + 3k 2 + 15k + 12 = 3 ( + k 2 + 5k + 4 ) = ( k + 1)( k + 2 )( k + 6 ) is a multiple of 3

P ( k + 1) is true.
Therefore, P ( k ) is true.

P ( k + 1) is true.
Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.
Let P ( n ) = 102 n 1 + 1 is divisible by 11.
For n = 1,
P (1) = 10211 + 1 is divisible by 11 = 11 is divisible by 11
Now,

20.

.(i)

P (1) is true.

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

Let P ( n ) be true for n = k ,

P ( k ) = 102 k 1 + 1 is divisible by 11 = 10 2 k 1 + 1 = 11

10 2 k 1 = 11 1

.(i)

P ( k + 1) = 10

For n = k + 1,

2( k +1) 1

+ 1 is divisible by 11

P ( k + 1) = 102 k +1 + 1 is divisible by 11

Now,

10 2 k +1 + 1 = 10 2 k 1.10 2 + 1 = (11 1) .102 + 1 = 1100 100 + 1 = 11(100 9 )

102( k +1)1 + 1 is divisible by 11


P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


21. Let P ( n ) = x 2 n y 2 n is divisible by ( x + y )

P (1) = x 21 y 21 is divisible by ( x + y ) = ( x + y )( x y ) is divisible by ( x + y )

For n = 1,

P (1) is true.
Let P ( n ) be true for n = k ,

P ( k ) = x 2 k y 2 k is divisible by ( x + y ) = x 2 k y 2 k = ( x + y )

x 2 k y 2k = ( x + y )

.(i)

P ( k + 1) = x

For n = k + 1,

2( k +1)

2( k +1)

is divisible by ( x + y )

x 2 k + 2 y 2 k 2 = x 2 k + 2 x 2 k y 2 + x 2 k y 2 y 2 k 2 = x 2 k .x 2 x 2 k y 2 + x 2 k y 2 y 2 k . y 2

Now,

= x 2 k ( x 2 y 2 ) + y 2 ( x 2 k y 2 k ) = x 2 k ( x 2 y 2 ) + y 2 . ( x + y )

[From eq. (i)]

= ( x + y ) x 2 k ( x y ) + y 2
2( k +1)

2( k +1)

is divisible by ( x + y )

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


22. Let P ( n ) = 32 n + 2 8n 9 is divisible by 8.

P (1) = 321+ 2 8 1 9 is divisible by 8 = 64 is divisible by 8

For n = 1,

P (1) is true.
Let P ( n ) be true for n = k ,

P ( k ) = 32 k + 2 8k 9 is divisible by 8 = 32 k + 2 8k 9 = 8

32 k + 2 = 8 + 8k + 9

For n = k + 1,

.(i)

P ( k + 1) = 3

2( k +1) + 2

8 ( k + 1) 9 is divisible by 8

P ( k + 1) = 32 k + 2.32 8k 8 9 is divisible by 8

Now,

32 k + 2.9 8k 17 = ( 8 + 8k + 9 ) .9 8k 17

[From eq. (i)]

= 72 + 72k + 81 8k 17 = 72 + 64k + 64 = 8 ( 9 + 8k + 8 )
Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in
Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

2 k +1) + 2

8 ( k + 1) 9 is divisible by 8

3(

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


23. Let P ( n ) = 41n 14n is a multiple of 27.

P (1) = 411 141 is a multiple of 27 = 27 is a multiple of 27

For n = 1,

P (1) is true.
Let P ( n ) be true for n = k ,

P ( k ) = 41k 14k is a multiple of 27 = 41k 14 k = 27

For n = k + 1,

P ( k + 1) = 41k +1 14k +1 is a multiple of 27

Now,

41k +1 14 k +1 = 41k +1 41k .14 + 41k .14 14 k +1

= 41k ( 41 14 ) + 14 ( 41k 14 k )
= 41k 27 + 14 27

[From eq. (i)]

= 27 ( 41k + 14 )

41k +1 14 k +1 is a multiple of 27
P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.


24. Let P ( n ) = ( 2n + 7 ) < ( n + 3)

For n = 1,
P (1) = ( 2 1 + 7 ) < (1 + 3)

9 < 16
P (1) is true.
Let P ( n ) be true for n = k
P ( k ) = ( 2k + 7 ) < ( k + 3)

.(i)

For n = k + 1
P ( k + 1) = 2 ( k + 1) + 7 < ( k + 1 + 3) = 2 ( k + 1) + 7 < ( k + 4 )
2

Now, adding 2 on both sides in eq. (i),

( 2k + 7 ) + 2 < ( k + 3) + 2
2 ( k + 1) + 7 < k 2 + 9 + 6k + 2
2 ( k + 1) + 7 < k 2 + 6k + 11
2 ( k + 1) + 7 < k 2 + 6k + 11
2

..(i)

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

Also

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

2 ( k + 1) + 7 < ( k + 4 )

P ( k + 1) is true.

Therefore, P ( k ) is true.

P ( k + 1) is true.

Hence by Principle of Mathematical Induction, P ( n ) is true for all n N.

Material downloaded from http://myCBSEguide.com and http://onlineteachers.co.in


Portal for CBSE Notes, Test Papers, Sample Papers, Tips and Tricks

You might also like