0% found this document useful (0 votes)
10 views30 pages

INDUCTION

The document explains the technique of mathematical induction, which is used to prove the validity of statements about integers. It provides a structured approach, including examples and exercises to illustrate the process of proving statements through induction. Each example demonstrates how to establish the truth of a formula for all integers greater than or equal to a starting integer.

Uploaded by

Eranilde Osei
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views30 pages

INDUCTION

The document explains the technique of mathematical induction, which is used to prove the validity of statements about integers. It provides a structured approach, including examples and exercises to illustrate the process of proving statements through induction. Each example demonstrates how to establish the truth of a formula for all integers greater than or equal to a starting integer.

Uploaded by

Eranilde Osei
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 30

INTRODUCTION EXAMPLES EXERCISES

Outline

1 INTRODUCTION

2 EXAMPLES

3 EXERCISES
INTRODUCTION EXAMPLES EXERCISES

INTRODUCTION

This is a set pattern in which natural induction can be carried out.

It is a technique for proving the validity of statements about the integer n


that are suspected to be true for all integers greater than or equal to
some starting integer n.

Suppose we have a sequence of identities or theorems or rules and we


wish to prove that they are all true.
INTRODUCTION EXAMPLES EXERCISES

Let us call the nth term of the sequence Pn . For the simple form of
mathematical induction, the pattern is that we have to show that:
1 P1 is true
2 If P1 , P2 , . . . , Pn for any n are true, then Pn+1 is also true.

For a general form of mathematical induction, the pattern is that we


have to show that
1 If P1 is true
2 And if Pn is true for any n, then Pn+1 is true.
INTRODUCTION EXAMPLES EXERCISES

Outline

1 INTRODUCTION

2 EXAMPLES

3 EXERCISES
INTRODUCTION EXAMPLES EXERCISES

EXAMPLE 1

Prove by mathematical induction that

1 + 3 + 5 + . . . + (2n − 1) = n2
INTRODUCTION EXAMPLES EXERCISES

SOLUTION

Let Pn = 1 + 3 + 5 + . . . + (2n − 1) = n2
For P1 : LHS = 1 ; RHS = 12 = 1 which is true.
For P2 : LHS = 1 + 3 = 4 ; RHS = 22 = 4 which is true.
..
.
⇒ Pn is true.
INTRODUCTION EXAMPLES EXERCISES

If Pn is true then Pn+1 is also true.

Pn+1 = Pn + (n + 1)th term


= 1 + 3 + 5 + . . . + (2n − 1) + (2[n + 1] − 1) = n2 + 2[n + 1] − 1
= 1 + 3 + 5 + . . . + (2n − 1) + 2n + (2n + 1) = n2 + 2n + 1
= 1 + 3 + 5 + . . . + (2n − 1) + 2n + (2n + 1) = (n + 1)(n + 1)
Pn+1 = (n + 1)2

=⇒ The formula holds for integral values of n.


INTRODUCTION EXAMPLES EXERCISES

EXAMPLE 2

Prove by mathematical induction that


 2
n(n + 1)
13 + 23 + 33 + . . . + n3 =
2
INTRODUCTION EXAMPLES EXERCISES

SOLUTION

h i2
n(n+1)
Let Pn = 13 + 23 + 33 + . . . + n3 = 2

h i2
1(1+1)
For P1 LHS = 13 = 1 ; RHS = 2 =1 which is true

h i2
2(2+1)
For P2 LHS = 23 = 1 ; RHS = 2 = 32 = 9 which is true
..
.
=⇒ Pn is true.

If Pn is true, then Pn+1 is also true.


INTRODUCTION EXAMPLES EXERCISES

 2
n(n + 1)
Pn+1 = 13 + 23 + 33 + . . . + n3 + (n + 1)3 = + (n + 1)3
2
n2 (n + 1)2
Pn+1 = + (n + 1)3
4
n2 (n + 1)2 + 4(n + 1)3
=
4
(n + 1)2 2
= [n + 4(n + 1)]
4
(n + 1)2 2
= (n + 4n + 4)
4
(n + 1)2
= (n + 2)2
4
 2
(n + 1)(n + 2)
Pn+1 =
2

which holds for all positive integral vaues of n


INTRODUCTION EXAMPLES EXERCISES

EXAMPLE 3

Prove by mathematical induction that


n
X n(n + 1)
r=
r =1
2
INTRODUCTION EXAMPLES EXERCISES

SOLUTION

Pn n(n+1)
r =1 r = 1 + 2 = 3 + ··· + n = 2

n(n+1)
Let Pn = 1 + 2 = 3 + · · · + n = 2

1(1+1)
For P1 : LHS = 1 ; RHS = 2 =1 which is true

2(2+1)
For P2 : LHS = 1 + 2 = 3 ; RHS = 2 =3 which is true
..
.
=⇒ Pn istrue

If Pn is true, then Pn+1 is also true


INTRODUCTION EXAMPLES EXERCISES

Pn+1 = Pn + (n + 1)th term

n(n + 1)
Pn+1 = 1 + 2 = 3 + · · · + n + (n + 1) = + (n + 1)
2
n(n + 1) + 2(n + 1)
Pn+1 =
2
(n + 1)(n + 2)
=
2
INTRODUCTION EXAMPLES EXERCISES

EXAMPLE 4

Prove by mathematical induction that

1 + 7 + 13 + . . . + (6n − 5) = n(3n − 2)
INTRODUCTION EXAMPLES EXERCISES

SOLUTION

Let Pn = 1 + 7 + 13 + . . . + (6n − 5) = n(3n − 2)

For P1 : LHS = 1 ; RHS = 1(3(1) − 2) = 3 − 2 = 1 which is true

For P2 : LHS = 1 + 7 = 8 ; RHS = 2(3(2) − 2) = 2(4) = 8 which is


true
..
.
=⇒ Pn is true

If Pn is true, then Pn+1 is also true


INTRODUCTION EXAMPLES EXERCISES

Pn+1 = Pn + (n + 1)th term


Pn+1 = 1 + 7 + 13 + . . . + (6n − 5) + [6(n + 1) − 5] = n(3n − 2) + [6(n + 1) −
Pn+1 = 1 + 7 + 13 + . . . + (6n − 5) + (6n + 1) = n(3n − 2) + 6n + 1
Pn+1 = 3n2 − 2n + 6n + 1
= 3n2 + 4n + 1
= (n + 1)(3n + 1)
Pn+1 = (n + 1)[3(n + 1) − 2]

=⇒ The formula holds for all positive integral values of n.


INTRODUCTION EXAMPLES EXERCISES

EXAMPLE 5

Prove by mathematical induction that

n(n + 1)(n + 2)
1 · 2 + 2 · 3 + 3 · 4 + . . . + n(n + 1) = .
3
INTRODUCTION EXAMPLES EXERCISES

SOLUTION

n(n+1)(n+2)
Let Pn = 1 · 2 + 2 · 3 + 3 · 4 + . . . + n(n + 1) = 3

(1)(2)(3)
For P1 : LHS = 1 · 2 = 2 ; RHS = 3 =2 which is true

(2)(3)(4)
For P2 : LHS = 1 · 2 + 2 · 3=8 ; RHS = 3 =8 which is true
..
.
=⇒ Pn is true

If Pn is true, then Pn+1 is also true


INTRODUCTION EXAMPLES EXERCISES

Pn+1 = Pn + (n + 1)th term

Pn+1 = 1 · 2 + 2 · 3 + 3 · 4 + . . . + n(n + 1) + (n + 1)(n + 2)


n(n + 1)(n + 2)
= + (n + 1)(n + 2)
3
n(n + 1)(n + 2) + 3(n + 1)(n + 2)
Pn+1 =
3
(n + 1)(n + 2)
= [n + 3]
3
(n + 1)(n + 2)(n + 3)
Pn+1 =
3
=⇒ The formula holds for all positive integral values of n.
INTRODUCTION EXAMPLES EXERCISES

EXAMPLE 6

Prove by mathematical induction that the sum of the first n terms of an


AP is
1
Sn = n{2a + (n − 1)d}
2
INTRODUCTION EXAMPLES EXERCISES

SOLUTION

Let Sn = a + (a + d) + (a + 2d) + . . . + [a + (n − 1)d] = n2 [2a + (n − 1)d]

When n = 1; S1 : LHS = a;RHS = 21 [2a + (1 − 1)d] = a (which is true)

When n = 2; S2 :
LHS = a + (a + d) = 2a + d;RHS = 22 [2a + (2 − 1)d] = 2a + d (which is
true)
=⇒ Pn is true
If Pn is true, then Pn+1 is also true.
INTRODUCTION EXAMPLES EXERCISES

Pn+1 = Pn + (n + 1)th term

Pn+1 = a + (a + d) + . . . + [a + (n − 1)d] + [a + ([n + 1] − 1)d]


n
= [2a + (n − 1)d] + a + dn
2
n
= [2a + dn − d] + a + dn
2
n(2a + dn − d) + 2(a + dn)
=
2
INTRODUCTION EXAMPLES EXERCISES

2an + dn2 − dn + 2a + 2dn


=
2
2an + dn2 + 2a + dn
=
2
(2an + 2a) + (dn2 + dn)
=
2
2a(n + 1) + dn(n + 1)
=
2
n+1 n+1
= [2a + dn] = [2a + [(n + 1) − 1]d]
2 2
This holds for all positive integral values of n.
INTRODUCTION EXAMPLES EXERCISES

EXAMPLE 7

Prove by mathematical induction that


n  
X 1 1 1 1 1 1 3 1 1
= + + +. . .+ = − −
r =1
r (r + 2) 1·3 2·4 3·5 n(n + 2) 2 2 n+1 n+2
INTRODUCTION EXAMPLES EXERCISES

SOLUTION

h i
1 1 1 1 1 3 1 1
Let Pn = 1·3 + 2·4 + 3·5 + ... + n(n+2) = 2 2 − n+1 − n+2

1
For n = 1 , P1 : LHS = 1·3 = 31 ;

1
3 1 1
 1 9−3−2
 2 1
RHS = 2 2 − 2 − 3 = 2 6 = 6 = 3 True.

1 1 1 1 8+3 11
For n = 2 , P2 : LHS = 1·3 + 2·4 = 3 + 8 = 24 = 24 ;

RHS = 12 23 − 13 − 14 = 1
   18−4−3  1
 11  11
2 12 = 2 12 = 24 (True)
..
.
=⇒ Pn is true
INTRODUCTION EXAMPLES EXERCISES

If Pn is true, then Pn+1 is also true.

Pn+1 = Pn + (n + 1)th term

1 1 1 1 1
Pn+1 = 1·3 + 2·4 + 3·5+ . . . + n(n+2) + (n+1)(n+3)
h i
1 3 1 1 1
= 2 2 − n+1 − n+2 + (n+1)(n+3)

1
Expressing in partial fractions
(n + 1)(n + 3)
INTRODUCTION EXAMPLES EXERCISES

1 1
h i
1 1 1 1
(n+1)(n+3) = 2
n+1 − 2
n+3 = 2 n+1 − n+3

h i h i
1 3 1 1 1 1 1
= 2 2 − n+1 − n+2 + 2 n+1 − n+3

h i
1 3 1 1 1 1
= 2 2 − n+1 − n+2 + n+1 − n+3

h i
1 3 1 1
= 2 2 − n+2 − n+3 which is true for all n.
INTRODUCTION EXAMPLES EXERCISES

Outline

1 INTRODUCTION

2 EXAMPLES

3 EXERCISES
INTRODUCTION EXAMPLES EXERCISES

EXERCISES

Pn h i2
3 n(n+1)
1. r =1 r = 2

Pn n(n+1)(4n−13)
2. r =1 r (2r − 5) = 6

Pn 1 n(n+3)
3. r =1 r (r +1)(r +2) = 4(n+1)(n+2)

Pn 1 n
4. r =1 r (r +1) = n+1

Pn n(n+1)(n+2)
5. r =1 r (r + 1) = 3
INTRODUCTION EXAMPLES EXERCISES

EXERCISES

Pn 1 n
6. r =1 (3r −1)(3r +2) = 6n+4

7. 13 + 33 + 53 + · · · + (2n − 1)3 = 2n4 − n2

8. 1 + 3 + 5 + · · · + (2n − 1) = n2

Pn
9. r =1 r (r + 1)(r + 2) = n4 (n + 1)(n + 2)(n + 3)

5 6 7 n+4 n(3n + 7)
10. 1·2·3 + 2·3·4 + 3·4·5 + ··· + n·n+1·n+2 =
2(n + 1)(n + 2)

You might also like