Chapter 12

Mathematical Equations

Exercise 12.1

O T IS
1. If P (n) is the statement “n(n+1) is even”, then what is P(3) ?
N A D
CO N
Solution:
O UC AA
T IO
PY
Given:
= + 1 is even.
,
ED PR

P(3) = 3(3 +1)

= 3(4)
©

= 12
Hence, P(3) = 12, P(3) is also even.

2. If P(n) is the statement “n” +n is divisible by 3”, Prove that P (3)

is true but P(4) is not true.
D

Solution:
Given:
P(n) = + is divisible by 3
We have P(n) = +
So,
P (3) = 3 + 3
= 27 + 3
= 30
P(3) = 30, so it divisible by 3
Now, let’s check with P(4)
P(4) = 4 + 4

O T IS
= 64 + 4

N A D
CO N
= 68
O UC AA
P(4) = 68, so it is not divisible by 3

T IO
PY
Hence, P(3) is true and P(4) is not true.
ED PR

3. If P(n) is the statement " ≥ ", and true, prove

that + .
©

Solution:
Given:
P(n) = "2 ≥ 3 ", and p(r) is true.
We have, P (r) is true.
So,
"2 ≥ 3 "
D

Since, P(r) is true

So,
"2! ≥ 3""
Now, let’s multiply both side by 2
2 × 2! ≥ 3" × 2
2!$% ≥ 6"
2!$% ≥ 3" + 3" [Since 3r > 3 = 3r + 3r ≥ 3 + 3"]
∴ 2!$% ≥ 3 " + 1
Hence, P(r + 1) is true.

4. If P(n) is the statement " + " is even, and if P(r) is true, then

O T IS
P(r + 1) is true.
N A D
CO N
Solution:
O UC AA
T IO
PY
given:
P(n) = )
+ is even and P (r) is true, then " ) + " is even
Let us consider " ) + " = 2* ……..(i)
ED PR

Now, " + 1 )
+ "+1
" ) + 1 + 2" + " + 1
" ) + " +2" + 2
©

2* + 2" + 2 [," - ./0123 3 ]

2 *+"+1
24
∴ "+1 )
+ " + 1 35 67. .
" + 1 35 2"0..
D

Hence,
5. Given an example of a statement P(n) such that it is true for all
n∈ 9.
Solution:
Let us consider
$%
= 1 + 2 + 3 + ………….+
)
=
So,
35 2"0. , " 1:: 120"1: 0-;."5.

O T IS
Hence, P (n) is true for all n∈ <.
N A D
CO N
6. If P(n) is the statement " − + > is prime”, Prove that P(1),
O UC AA
T IO
PY
P(2) and P(3) are true. Prove also that P(41) is not true.
Solution:
ED PR

Given:
= )
− + 41 is prime
= )
− + 41
©

1 = 1 − 1 + 41
= 41
P(1) is Prime.
Similarly,
P(2) = 2) − 2 + 41
D

= 4 – 2 + 41
= 43
P(2) is prime.
Similarly,
P(3) = 3) − 3 + 41
= 9 – 3 + 41
= 47

O T IS
P(3) is prime.
N A D
CO N
Now,
P (41) = 41 )
− 41 + 41
O UC AA
T IO
PY
= 1681
P(41) is not prime
ED PR

Hence, P(1), P(2), P(3) are true but P(41) is not true.
©
D
 Exercise 12.2

Prove the following by the principal of mathematical induction :

$
1. 1 + 2 + 3 + …n = i.e. the sum of the first n natural numbers
$

O T IS
is .

N A D
CO N
Solution:
$%
O UC AA
T IO
PY
)
Let us consider P(n) = 1 + 2 + 3 +… + n =

For, =1
ED PR

LHS of P(n) = 1
% %$%
)
RHS of P(n) = = 1
©

So, LHS = RHS

Since, P(n) is true for =1
Let us consider P(n) be the true for = *, 5
? ?$%
)
1+2+3+… +k= ..(i)

Now,
D

? ?$%
1 + 2 + 3 + ⋯+ * + * + 1 = + *+1
)
?
= * + 1 A + 1B
)
[ ?$% ?$) ]
)
=
 C ?$% [ ?$% $%]D
)
=

P (n) is true for =*+1

P (n) is true on for all ∈<
So, by the principal of Mathematical induction
$%
is true for all n ∈ <.
)
Hence, P(n) = 1 + 2 + 3 + …..+ n =

O T IS
[ $ $ ]
+ + N A D + ⋯+

CO N
E
2. =
O UC AA
T IO
PY
Solution:
[ $% ) $% ]
Let us consider P(n) = 1) + 2) + 3) + ⋯ + )
F
=
=1
ED PR

For,
[% %$% )$% ]
1 =
F
©

1=1
is true for n = 1
Let P(n) is true for n = k, so
[G$% ?$) )?$ ]
P(K): 1) + 2) + 3) + ⋯ + * ) + * + 1 )
=
F

1) + 2) + 3) + ⋯ + * ) + * + 1 )
D

[G$% ?$) )?$ ]

F$ ?$% H
=
KHLH MLN

= I+1 J O
PMQ R
Q
 C)? H $?$F?$FD
= *+1
F

C)? H $S?$FD
= *+1
F

C)? H $T?$ ?$FD

*+1
F
=

O T IS
[)? ?$) $ ?$) ]
= *+1 N A D
CO N
F
O UC AA
T IO
PY
[ ?$% )?$ ?$) ]
F
=
P(n) is true for n = * + 1
ED PR

Hence, P(n) is true for all n ∈ <.

©

K V N
3. + + +⋯+ U
=
Solution:
W U%
Let P (n) = 1 + 3 + 3 + ⋯ + 3 ) U%
)
=
Now for N = 1
W U% )
D

) )
P(1) = 1 = = =1
P(n) is true for n = 1
Now, let’s check for P (n) is true for n = k
K L U%N
P(k) = 1 + 3 + 3 + …….. + 3
) ?U%
)
= ….(i)
Now, we have to show P(n) is true for =*+ 1
K LMQ U%N
I + 1 = 1 + 3 + 3 + …….+3 = ) ?
)

Then, X1 + 3 + 3) + ⋯ + 3?U% Y + 3 ?U%$%

?U%
+ 3? using equation (i)
)
=
K ?U%$) × L N
)
=
× ?U%

O T IS
)
=
K LMQ U%N N A D
CO N
)
=
P (n) is true for n = * + 1
O UC AA
T IO
PY
Hence, P (n) is true for all n ∈ <.
ED PR

. . .> $ $
4. + + + ….. + =
©

Solution:
% % % %
%.) ). .T $% $%
Let P(n) = + + + ….. + =

For, =1
% %
= +
%.) %$%
% %
) )
=
D

35 true for =1
Let’s check for P (n) is true for = *,
% % % % ? ?$%
+ + + …..+
%.) ). .T ? ?$% ?$% ?$) ?$)
+ =

Then
% % % % ?
+ + + …..+
%.) ). .T ? ?$% ?$% ?$)
+

Q
?
LMQ
+
G$) ?$%
=

% ? ?$) $%
[ \
?$% ?$)
=

O T IS
Q
?
LMQ
+
?$) ?$%
=
N A D
CO N
O UC AA
% [? ?$) $%]

T IO
PY
?$% ?$)
=
ED PR

% [? H $)?$%]
?$% ?$)
=
% [ ?$% ?$% ]
?$% ?$)
=
©

?$%
?$)
=

P(n) is true for =*+1

Hence, 35 true for all ∈ <.
D
5. + + ] + ⋯+ − = i.e., the sum of first n odd
natural numbers is .
Solution:
Let : 1 + 3 + 5 + ….+ (2n – 1 ) = )

Let us check P(n) is true for =1

1 = 1 = 1)

O T IS
1=1
N A D=1

CO N
P (n) is true for
< `, a.2 b 5 cℎ.c* 35 2"0. , " =*
O UC AA
T IO
PY
e * = 1 + 3 + 5 + …. + ( 2k – 1) = * ) ….(i)
We have to show that
ED PR

1 + 3 + 5+ … + 2* − 1 + 2 * − 1 − 1 = * + 1 )

Now,
1 + 3 + 5 + ….. + 2* − 1 + 2 * + 1 − 1
©

= * ) + 2* + 1
= * ) + 2* + 1
= *+1 )

P (n) is true for n = * + 1

∈ <.
D

Hence, P (n) is true for all

 + + + ….. + =
.] ].f f. U $ E $>
6.

Solution:
% % % %
+ + + ….. + =
).g g.h h.%% U% $) F $T
Let P(n) =

Let us check Up P(n) is true for n = 1

% % %
= ⇒
).g F.%$T %j
P(1) :

O T IS
P(1) is true for n = 1
P(1) is true
N A D
CO N
% % % % ?
+ + + ….. + =
).g g.h h.%% ?U% ?$) F?$T
Now,
O UC AA
T IO
PY
% % % % %
*+1 : + + + ….. + + ∶
).g g.h h.%% ?U% ?$) ?$ U% ?$ $)
? %
+
ED PR

F?$T ?$) ?$g

?$%
F ?$% $T
:
©

P(k+1) is true.
Hence proved by mathematical induction.

+ + + …..+ =
.> >.l l. m U $ $
7.

Solution:
D

% % % %
+ + + …..+ =
%.T T.S S.%j U) $% $%
Let P(n) =

Let us check for n = 1,

% %
=
%.T T
P(1) :
% %
=
T T
P (n) is true for n = 1.
Now, let us check for P (n) is true for n = k, and have to prove that
* + 1 35 2"0..
% % % % ?
* = + + + …..+ =
%.T T.S S.%j ?U) ?$% ?$%
….(i)

So,
% % % % %
[ + + + ⋯+ \+
%.T T.S S.%j ?U) ?$% ?$% ?$T

O T IS
? %
+
?$% ?$% ?$T
=
N A D
CO N
% ? %
[ + \
?$% % ?$T
=
O UC AA
T IO
PY
% K ? H $T?$%N
[ \
?$% ?$T
=
ED PR

% C ? H $ ?$?$%D
?$% ?$T
=
©

[ ? ?$% $ ?$% ]
[ ?$T ?$% ]
=

[ ?$% ?$% ]
=[
?$T ?$% ]
D

?$%
?$T
=

P (n) is true for n = * + 1

Hence, P(n) is true for all n ∈ <.
 + + + …..+
.] ].l l.n $ $ $
8. =

Solution:
= + + + …..+
.] ].l l.n $ $ $
Let =

Let us check for = 1,

% %
.g ).%$
P(1): =

O T IS
% %
:
%g
=
%g N A D
CO N
= 1.
O UC AA
P(n) is true for

T IO
PY
Now, let us check for P(n) is true for = *, and
ℎ17. 2 e" 7. 2ℎ12 * + 1 35 2"0..
% % % % ?
* = =
ED PR

.g g.S S.o )?$% )?$ )?$

+ + + …. + …..(i)

So,
% % % % %
©

+ [)
.g g.S S.o )?$% )?$ ?$% $%][ ) ?$% $ ]
+ + + …. +
% % % % %
.g g.S S.o )?$% )?$ )?$ )?$g
+ + + …. + +

Now substituting the value of P(k) we get,

? %
=[ \+
)?$ )?$ )?$g
D

[? )?$g $ ]
=[
)?$ )?$g ]

?$%
[ ) ?$% $ ]
=

P(n) is true for =*+1

Hence, P(n) is true for all n∈ <.

O T IS
+ =
.l l. . ] > U > $ > $
9. + + ….. +
N A D
CO N
Solution:
O UC AA
T IO
PY
% % % %
+ =
.S S.%% %%.%g T U% T $ T $
Let P (n) = + + ….. +

Let us check for = 1,

ED PR

P (1) : Let us check for = 1,

% % % %
1 : =
.S T.%U% T$ )% )%
= :
©

P(n) is true for n = 1.

Now, let us check for P(n) is true for n = k, and have to prove that P
* + 1 is true.
% % % % ?
+ +…+ =
.S S.%% %%.%g T?U% T?$ T?$
P(k) : + …(i)

So,
D

% % % % ?
+ +…+ =
.S S.%% %%.%g T?U% T?$ T?$ T?$S
+

Substituting the value of P(k) we get,

? %
+
T?$ T?$ T?$S
=
% T? H $SG$
[ \
T?$ T?$S
=
 % T? H $ G$T?$
[ \
T?$ T?$S
=
% T? ?$% $ ?$%
[ \
T?$ T?$S
=
% T?$ ?$%
[ \
T?$ T?$S
=
?$%
=[
T?$S ]

O T IS
P(n) is true for n = * + 1
N A D ∈ <.

CO N
Hence, P(n) is true for all
O UC AA
T IO
PY
10. . + . + . +……+ . = − $
+
ED PR

Solution:
Let P(n) = 1.2 + 2.2) + 3.2 +……+ . 2 = −1 2 $%
+2
©

Let us check for n = 1.

P(1) : 1.2 = 0.2j + 2
:2=2
P(n) is true for n = 1.
Now, let us check for P(n) is true for =
*, 1 q ℎ17. 2 e" 7. 2ℎ12 * + 1 35 2"0..
D

* : 1.2 + 2.2) + 3.2 +……+ *. 2? = * − 1 2?$% + 2 ….(i)

So,
X1.2 + 2.2) + 3.2 + ⋯ … + *. 2? Y + * − 1 2?$%
Now, substituting the value of P(k) we get,
= [ * − 1 2?$% + 2 + * + 1 2?$% 053 r ./0123 3 ]
= * − 1 2?$% + 2 + * + 1 2?$%
= 2?$% * − 1 + * + 1 + 2
= 2?$% × 2* + 2
= * × 2?$) + 2
P(n) is true for n = * + 1
Hence, P(n) is true for all ∈ <.

O T IS
11. +]+f+ + ….+ (3n-1) = +
N A D
CO N
Solution:
O UC AA
T IO
PY
%
3 +1
)
Let P(n) = 2 + 5 + 8 + 11 + ….+ (3n-1) =
Let us check for = 1,
ED PR

%
×1 ×4
)
P(1) : 2 =
:2=2
= 1.
©

P(n) is true for

Now, let us check for P(n) is true for n = k, and have to prove that
P(k+1) is true.
%
P(k) = 2 + 5 + 8 + 11 + ….+ (3k-1) = * 3* + 1 …..(i)
)
So,
2 + 5 + 8 + 11 + ….+ (3k-1) + 3* + 2
D

Now, substituting the value of P(k) we get,

%
× * 3* + 1 + 3* + 2 ;s 053 r ./0123 3
)
=
C ? H $?$) ?$) D
)
=
 C ? H $?$F?$)D
)
=
C ? H $S?$)D
)
=
C ? H $T?$ ?$)D
)
=
[ ? ?$% $T ?$% ]
)
=
[ ?$% ?$T ]

O T IS
)
=

N A D
CO N
P(n) is true for n = * + 1
∈ <.
O UC AA
T IO
PY
Hence, P(n) is true for all
ED PR

12. . + . > + . ] + ⋯ + + = + +l
E
Solution:
©

%
: 1.3 + 2.4 + 3.5 + ⋯ + +2 = +1 2 +7
F
Let
Let us check for = 1,
%
×1 ×2 ×9
F
P(1) = 1.3 =
: 3=3
= 1.
D

P(n) is true for

Now, let us check for P(n) is true for = *, and have to prove that
P(k+1) is true.
%
* * + 1 2* + 7 ….(i)
F
P(k) : 1.3 + 2.4 + 3.5 + …. + k.(k+2) =
So,
1.3 + 2.4 + 3.5 + …. + .(k+2) + (k + 1) (k+3)
Now, substuting the value of P(k) we get,
%
* * + 1 2* + 7 + * + 1 * + 3 ;s using equation (i)
F
=
? )?$S ?$
= * + 1 [u v+u v\
F %
CK)? H $S?$F?$%hND
= *+1
F

C)? H $% ?$%hD
= *+1

O T IS
F
C)? H $o?$T?$%hD
= *+1 N A D
CO N
F
O UC AA
T IO
PY
[)? ?$) $o ?$) ]
= *+1
F
ED PR

[ )?$o ?$) ]
= *+1
F
%
* + 1 * + 2 2* + 9
©

F
=
P(n) is true for =*+1
Hence, is true for all ∈ <.

K> $E U N
13. . + . ] + ]. l + ⋯ + − + =
D

Let us check for = 1,

% T.%H $F.%U%
P(1) : (2.1 – 1)(2.1 +1) =
% T$FU%
:1×3=
: 3=3
 35 2"0. , " = 1.
Now, let us check for is true for = *, 1 q ℎ17. 2 e" 7. 2ℎ12
* + 1 is true.
?KT? H $F?U%N
* : 1.3 + 3.5 + 5.7 + ….+ 2* − 1 2* + 1 = …(i)
So,
1.3 + 3.5 + 5.7 + ….+ 2* − 1 2* + 1 + 2* + 1 2* + 3

O T IS
Now, substituting the value of P(k) we get,

N A D
CO N
KT? H $F?U%N
=* + 2* + 1 2* + 3 by using equation (i)
O UC AA
T IO
PY
C?KT? H $F?U%N$ KT? H $F?$)?$ ND
=
CT? w $ F? H U?$%)? H $%h?$F?$oD
ED PR

=
CT? w $%h? H $) ?$oD
=
©

CT? w $ T? H $ %T? H $%T?$o?$oD

=
C ?$% KT? H $h?$T$F?$FU%ND
=
[ ?$% T[ ?$% H $F ?$% U%]
=
P(n) is true for =*+1
D

Hence, 35 2"0. , " 1:: ∈ <.

[ $ $ ]
14. . + . + . > + ⋯ + + =
Solution:
 [ $% $) ]
Let P(n) : 1.2 + 2.3 + 3.4 + ⋯ + +1 =
Let us check for = 1.
[% %$% %$) ]
1 :1 1+ 1 =
:2=2
P(n) is true for = 1.
Now, let us check for P(n) is true for = *, 1 q ℎ17. to prove that
* + 1 35 2"0..

O T IS
[? ?$% ?$) ]
* : 1.2 + 2.3 + 3.4 + ⋯ + k * + 1 =
N A D
CO N
…(i)
O UC AA
T IO
PY
So,
[? ?$% ?$) ]
1.2 + 2.3 + 3.4 + ….+ * * + 1 = ….(i)
ED PR

So,
1.2 + 2.3 + 3.4 + ……+ * * + 1 + * + 1 * + 2
Now, substituting the value of P(k) we get,
©

[? ?$% ?$) ]
= + * + 1 * + 2 by using equation (i)
?
= * + 2 * + 1 [ + 1\
)
[ ?$% ?$) ?$ ]
=
P(n) is true for =*+1
35 2"0. , " 1:: ∈ <.
D

Hence,

= −
> f
15. + + + ….+
Solution:
% % % % %
= + + + ….+ =1−
) T h )W )W
Let
Let us check for = 1,
% %
=1−
)Q )Q
P(1) :
% %
) )
: =
35 2"0. , " = 1.
Now, let us check for P(n) is true for n =k, and have to prove that
P(k+1) is true.
% % % % %
* : + + +….+ L = 1−

O T IS
) T h ) )L
Let …(i)
N A D
CO N
So,
% % % % %
+ + +….+ L +
O UC AA
T IO
PY
) T h ) )LMQ
Now, substituting the value of P(k) we get,
% %
+
ED PR

)L )LMQ
=1- by using equation (i)
)U%
=1−A B
)LMQ
©

P(n) is true for n = k +1

Hence, P(n) is true for all ∈ <.

16. + + ] +……+ − = > −

Solution:
: = 1,
D

Let
%
P(1): 2.1 − 1 )
= ×1 × 4−1
:1=1
P(n) is true for = 1.
Now, let us check for P(n) is true for = *, 1 q ℎ17. 2 e" 7.
2ℎ12 * + 1 35 2"0..
 %
* : 1) + 3) + 5) + ⋯ + 2* − 1 )
= * 4* ) − 1 ….(i)
So,
1) + 3) + 5) + ⋯ + 2* − 1 )
+ 2* + 1 )

Now, substituting the value of P(k) we get,

%
= * 4* ) − 1 + 2* + 1 )
by using equation (i)
%
= * 2* + 1 2* − 1 + 2* + 1 )

O T IS
)?U%
= 2* + 1 [u* + 2* + 1 v\
N A D
CO N
)?$% C)? H U?$ )?$% D
O UC AA
=

T IO
PY
)?$% [)? H U?$F?$ ]
=
C )?$% )? H $g?$ D
ED PR

=
[ )?$% )? ?$% $ ?$% ]
=
©

[ )?$% )?$ ?$% ]

=
?$%
= [4* ) + 6* + 2* + 3]

?$%
= [4* ) + 8* − 1]
D

?$%
= [4 * + 1 )
− 1]
P(n) is true for n = k +1
Hence, P(n) is true for all ∈ <.
 [ U ]
17. y + y + y + ….+ y U
=y [ U ]
, ≠

Solution:
[ U ]
Let P(n) : 1 + 1" + 1" ) +….. + 1" U%
= 1 [A [ ]
B\
U

Let us check for n =1,

U
1 :1 = 1
U

: 1=1

O T IS
N A D
CO N
P(n) is true for n = 1.
O UC AA
T IO
PY
Now, let us check for P(n) is true for n = k, and have to prove that
P(k+1) is true.
U
* : 1 + 1" + 1" ) +….. + 1" U%
=1[ \ …..(i)
ED PR

So,
1 + 1" + +1" ? +….. + 1" ?U% + 1" ?
©

Now, substituting the value of P(k) we get,

yK | U N
= { } + 1" ? by using equation (i)
U

~C | U $ | U D
!U%
=
~C | U $ | U D
D

!U%
=
~C | U $ |M U V| D
!U%
=
~C | U D
!U%
=

P(n) is true for n = k + 1

Hence, is true for all ∈ <.

18. y + y + • + y + • + ⋯ + y + − • = [ y+
− •]
Solution:
: 1 + 1 + q 1 + 2q +…+(1 + − 1 q = [21 +
)
Let
− 1 q]

O T IS
N A D
CO N
Let us check for n = 1,
%
P(1) : 1 = [21 + 1 − 1 q ]
O UC AA
T IO
PY
)
:1=1
ED PR

P(n) is true for n =1.

Now, let us check for P (n) is true for n=k, and have to prove that
P(k+1)is true.
?
P(k): 1 + 1 + q + 1 + 2q +…. + 1 + * − 1 q = [21 +
©

)
* − 1 q ] …(i)
So,
1 + 1 + q + 1 + 2q + …..+ 1 + * − 1 q + 1 + * q
Now, substituting the value of P (k) we get,
?
[21 + * − 1 q ] + 1 + *q ;s 053 r ./0123 3
D

)
=
[)?~$? ?U% €$) ~$?€ ]
)
=
C)?~ $ ? H €U?€$)~$)?€D
)
=
[)?~$)~$? H € $?€]
)
=
 [)~ ?$% $€ ? H $? ]
)
=
?$%
)[)~$?€]
=

P(n) is true for =*+1

?$%
)[)~$?€]
=

P(n) is true for =*+1

35 2"0. , " 1:: ∈ <.

O T IS
Hence,

N A D
CO N
19. ] U
divisible by 24 for all ∈9
O UC AA
T IO
PY
Solution:
Let : 5) U%
35 divisible by 24
= 1,
ED PR

Let us check for

P(1) : 5) − 1 = 25 − 1 = 24
P(n) is true for n =1, where P(n) is divisible by 24
©

Now, let us check for P(n) is true for n=k, and have to prove that P(k+1)
is true.
* : 5)?U% is divisible by 24
: 5)?U% = 24•…….(i)
We have to prove,
5)?$% – 1 is divisible by 24
D

5) ?$%
− 1 = 24μ
So,
= 5) ?$%
−1
= 5)? . 5) − 1
= 25. 5)? − 1
= 25 24• + 1 − 1 by using equation (1)
= 25.24• + 24
= 24•
P (n) is true for n = * + 1
Hence, P(n) is true for all ∈ <.

O T IS
N A D
CO N
+ l is divisible by 8 for all ∈9
O UC AA
T IO
PY
20.
Solution:
: 3) + 7 is divisible by 8
ED PR

Let
Let us check for = 1,
P (1) : 3) + 7 = 9 + 7 = 16
= 1, `ℎ.". P (n) is divisible by 8
©

P (n) is true for

Now, let us check for P(n) is true for = *, and have to prove that
P(k+1) is true.
P(k) : 3)? + 7 is divisible by 8
: 3)? + 7 = 8•
: 3)? = 8• − 7 ….(i)
D

We have to prove,
3) ?$%
+ 7 is divisible by 8
3)?$) + 7 = 84
So,
= 3) ?$%
+7
= 3)? . 3) + 7
= 9. 3)? + 7
= 9. 8• − 7 + 7 by using equation (i)
= 72• − 63 + 7
= 72 • − 56
= 8 9• − 7
= 84

O T IS
P(n) is true for n = k + 1
N A D ∈ <.

CO N
Hence, P(n) is true for all
21. ] $
− > − ] is divisible by 576 for all ∈9
O UC AA
T IO
PY
Solution:
Let P(n) : 5) $)
− 24 − 25 is divisible by 576
ED PR

Let us check for n =1,

P(1): 5).%$) − 24.1 − 25
©

: 625 – 49
: 576
P(n) is true for = 1, `ℎ.". , 35 q37353;:. ;s 576
Now, let us check for P(n) is true for n =k, and have to prove that P(k+1)
is true.
P(k): 5)?$) − 24* -25 is divisible by 576
D

: 5)?$) − 24* − 25 = 576• ……..(i)

we have to prove
5)?$T − 24 * + 1 − 25 is divisible by 576
5 )?$) $)
− 24 * + 1 − 25 = 5764
So,
=5 )?$) $)
− 24 * + 1 − 25
=5 )?$) $)
. 5) − 24* − 24 − 25
= ( 576 • + 24* + 25 25 − 24* − 49 by using equation (i)
= 25. 576 • + 576* + 576
= 576 25• + * + 1
= 5764

O T IS
N A D
CO N
O UC AA
T IO
PY
P(n) is true for n = k +1
Hence, P(n) is true for all n∈ <.
ED PR

22. $
− f − n is divisible by 8 for all n∈ 9
Solution:
©

Let P(n) = 3) $)
− 8 − 9 is divisible by 8
Let us check for n =1,
P(1) : 3).%$) − 8.1 − 9
: 81 – 17
: 64
= 1. `ℎ."., 35 q37353;:. ;s 8
D

P (n) is true for

Now, let us check for P(n) is true for n =k, and have to prove that P(k+1)
is true.
P(k) : 3)?$) − 8* − 9 is divisible by 8
: 3)?$) − 8* − 9 = 8• ….(i)
We have to prove,
: 3)?$T − 8 * + 1 − 9 35 q37353;:. ;s 8
= 3 )?$) $)
− 8 * + 1 − 9 = 84
So,
= 3) ?$%
. 3) − 8 * + 1 − 9
= 8• + 8* + 9 9 − 8* − 8 − 9
= 72• + 72* + 81 − 8* − 17 using equation (i)
= 72• + 64* + 64

O T IS
= 8 9• + 8* + 8
N A D
CO N
= 84
O UC AA
T IO
PY
P(n) is true for n = k + 1
∈ <.
ED PR

Hence, P(n) is true for all

©

23. y‚ = y ‚ for all ∈9

Solution:
Let P(n) : 1; = 1 ;
Let us check for n = 1,
1 : 1; %
= 1% ;
1 : 1; %
= 1% ; %
D

: ab = ab
P(n) is true for n = 1.
Now, let us check for P(n) is true for n = k, and have to prove that
P(k+1) is true.
* : 1; ?
= 1? ; ? …..(i)
We have to prove,
1; ?$%
= 1?$% . ; ?$%
So,
= 1; ?$%

= 1; ?
1;
= 1? ; ? 1; using equation (i)
= 1?$% ; ?$%

O T IS
P(n) is true for n = k + 1
N A D
CO N
Hence, P(n) is true for all ∈ <.
+1 + 5 is a multiple of 3 for all n∈ <.
O UC AA
T IO
PY
24.
Solution:
+1 + 5 is a multiple of 3
ED PR

Let :
Let us check for n =1,
1 :1 1 +1 1+5
:2×6
©

: 12
P (n) is true for n = 1, Where, P(n) is a multiple of 3
Now, let us check for P(n) is true for n =k, and have to prove that P(k+1)
is true.
P(k) : * * + 1 * + 5 is a multiple of 3
D

: k (k+1) (k+5) = 3• ……….(i)

We have to prove,
(k+1) [ * + 1 + 1][ * + 1 + 5] is a multiple of 3
(k+1) [(k+1)+1][(k+1) + 5] = 34
So,
= * + 1 [ * + 1 + 1] [ * + 1 + 5]
= * + 1 * + 2 [ * + 1 + 5]
= [k(k+1) (k+5)+k (k+1)]+2 * + 1 * + 5 + 2 * + 1
= 3• + * ) + * + 2 * ) + 6* + 5 + 2* + 2
= 3• + * ) + * + 2* ) + 12* + 10 + 2* + 2
= 3• + 3* ) + 15* + 12
= 3 • + * ) + 5* + 4

O T IS
= 34
N A D
CO N
=*+1
O UC AA
T IO
PY
P(n) is true for
Hence, P(n) is true for all n ∈ <.
ED PR

25. 7) + 2 U
. 3 − 1 is divisible by 25 for all n∈ <
©

Solution:
Let P(n) : 7) + 2 U
. 3 − 1 is divisible by 25
Let us check for n = 1,
P(1) : 7) + 2j . 3j
: 49 + 1
D

: 50
P(n) is true for n =1. Where , P(n) is divisible by 25
Now, let us check for P(n) is true for n=k, and have to prove that P
* + 1 35 2"0..
P(k): 7)? + 2 ?U
. 3* − 1 is divisible by 25
: 7)? + 2 ?U
. 3?U% = 25• …(i)
We have to prove that :
7)?$% + 2 ?
. 3? is divisible by 25
7)?$) + 2 ? . 3? = 254
So,
= 7) ?$%
+ 2 ? . 3?
= 7)? . 7% + 2 ? . 3?
= 25• − 2 ?U
. 3?U% 49 + 2 ? . 3* by using equation (i)

O T IS
)wL L
= 25•. 49 − N A D . . 49 + 2 ? . 3?
h

CO N
= 24 × 25 × 49• − 2 ? . 3? . 49 + 24. 2 ? . 3?
O UC AA
T IO
PY
= 24 × 25 × 49• − 25. 2 ? . 3?
= 25 24. 49• − 2 ?
. 3?
ED PR

= 254
P(n) is true for n = * + 1
∈ <.
©

Hence, P(n) is true for all

D
 ©
ED PR
D
O UC AA
N A D
O T IS
T IO
CO N
PY