M I

1st yea Mathematics 1A.
1.
Using mathematical induction, Show that

(
)(
( )
Sol:
Step-1:
)(
)(
= (1)2
( )
Step-3:
(
)
)(
), (
),
),
),
),
)(
=
=
=
=
=
=
) *
) (
)(
)(
)
(
45
)(
=
(
)(
)(
)(
)(
)(
)*
)(
(
k(k
)(
)(
)
)(k ) (k
)(
)(
)(
)(
)(
)
)
.
( ) is true
for all n N.
Sol: let
(
p (n) =
Step-1:
4.
R.H.S
(
= (1)3
4 45
( )
( )
(
+
)(
=6
L.H.S=R.H.S
)
Step( )
R.H.S
=2.3
)
put n=1
(
)
(
)(
L.H.S
Step-3:
(
)
Step-1:
=1
=1
L.H.S=R.H.S
p ( ) is true for n
( )
Step-
up to n terms
Sol:
put n=1
L.H.S
Using mathematical induction, Show that
(
4
(k+2)(K+3)=
for all n N.
=6
p (1) is true for n=1.
( )
)(
=6
L.H.S=R.H.S
Step-3:
P(k )
)(
( )
=1.2.3
Step)-
put n=1
R.H.S
)(
)(
)(
L.H.S
)(
Step-1:
(
up to n terms
4
)(
( ) is true
2.
Sol: let
( )
)(
3.
)-
)+
true for all n N.
( ) is
=1
( )
Step-
) *
=1
L.H.S=R.H.S
R.H.S
(
put n=1
L.H.S
)
(
6
p ( ) is true for n
( )
(
)(

(
.
( ) Is true
Step-3:
P (k+1) =
)
=
(
(
)(
)(
for all n N.
)
)(
6.
)(
r2
( )
Step-1:
)(
),(
R.H.S
(
=a
L.H.S=R.H.S
=a
( )
( )
r2
( ) is true
(
)
Step-3:
=a.r0
Step-
put n=1
=
=
L.H.S
)(
r2
)
)(
)
(
r2
)
)
for all n N.
(
5.
)
( )
:
,
(
,
=a
p( ) is true for n
( )
(
)
*
(
)
*
(
) +
7.
12+(
=
+22) +(
) (
) ++(
)(
Step-1:
) +(
)*
)*
+
(
) +
R.H.S
)(
=1
L.H.S=R.H.S
32 ) +
)
(
(
) (
put n=1
Step( )
+22) +(
(
L.H.S
(
up to n terms
)
*
32)+
Sol: let p (n) = 12+(
) +
(
(
Step-3:
=a
L.H.S=R.H.S
) -
( ) is true
R.H.S
).
for all n N.
=a+0
Step( )
)= (
put n=1
(
= (
L.H.S
) -
) -
Step-1:
=a { (
)(
(
)
Step-3:
(
)
) (
.
)
=1
p ( ) is true for n
( )
2)
2)
(
) (
) (
2)
(
(
)(
)(
)(
) (
)(
)(
)
2)

(
) (
)(
)* (
)(
)*
)(
)*
)(
)*(
)(
)(
) (
=
=
=
=
)(
)(
)
9.
Show that
Sol:
)+
( )
Step-1:
8.
(
L.H.S=R.H.S
L.H.S
R.H.S
=
9
(
).
)
=1
=1
L.H.S=R.H.S
=1
p ( ) is true for n
( )
Step-
( )
9
).
Step-3:
)+
)(
)(
)* (
)
)
)
)
)
=(
)
(
P (k ) is true
Hence, by the principle of mathematical induction, the
given statement is true for all n N.
)(
)(
)(
)
)
+
(
(
(
( )
)(
= =1
p ( ) is true for n
( )
+(
put n=1
(
Step-
).
Step-1:
Step-3:
).
9
)(
( )
for all n N.
( )
)(
=(
( ) is true
R.H.S
)+
put n=1
L.H.S
(
)(
)
)(
)
(
* (
)
)
P (k ) is true
Hence, by the principle of mathematical induction, the
given statement is true for all n N.
10. Show that
( )
Sol:
Step-1: put n=1
P (1) = 49
6( )
=49+16-1
=64
=64(1)
( )
( )
Step-2:
( ) 49
6
64
49
64
6
. (1)
Step-3: if n=k+1
(
) 49
6(
)
= 49 49
6
6
=49{64
6
} +16k+15
=49.64k-16k.49+49+16k+15
=49.64k-16k.48+64
64

=49.64k-16k.12 4+64
=49.64k-12k.64 4+64
=64{49m-12k+1}
thus the statement is divisible by 64
Hence, by the principle of mathematical induction
49
6
64

2. 4
.
11. Show that

( )
Sol:
Step-1: put n=1
P (1) = 5
= 5
=3(125) +16
=375+16
=391=17
( )
7
( )
Step-2:
( )
5
7
5
7
(1)
Step-3: if n=k+1
(
)
5
= 5
5
= 5( 7
)
8
=25.17m -25.
8
=25.17m-17.
=17(25m)
5
7
13. 2+3.2+3
Sol: let p (n) = 2+3.2+3
Step-1:
put n=1
L.H.S
R.H.S
=2
=2
L.H.S=R.H.S
Stepp (k)
Step-3:
p (k )
is divisible by 11, for all
= 4
=2(64) +81
=128+81
=201=11
9
( )
( )
Step-2:
( )
4
4
Step-3: if n=k+1
(
)
4 (
= 4
4
= 6(
)
=16.11m -16.
=16.11m +11.
=11(26m)
( )
)
7
7
=
=2
p ( ) is true for n
( )
(
)
(
)
(
)
(
)
(
)
= (
)
= (
)
=
(
)
=
(
)
.
( ) is
true for all n N.

12. S.T 2.
( )
Sol: Sol:
Step-1: put n=1
P (1) = 4

M I

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

M I

Uploaded by

Copyright:

Available Formats

1st yea Mathematics 1A.

Using mathematical induction, Show that

Using mathematical induction, Show that

true for all n N.

1st yea Mathematics 1A.

Sol: let p (n) = 12+(

1st yea Mathematics 1A.

1st yea Mathematics 1A.

thus the statement is divisible by 11

11. Show that

is divisible by 11, for all

true for all n N.

1st yea Mathematics 1A.

You might also like