Mathematics Extension 1

Syllabus: 7.4 Mathematical Induction. Applications

Mathematical
Induction

A compilation of material from Stuart Palmer and Pauline Hunt.

Practising Induction Prerequisities Sue Thomson, Ian Forster

Practising Indudion Prerequisites

Show Ihese expres_ ions are true.

(i) 2K

(ii) 3K +

3 = 2(K

I)

= 3(K

I)

(iii) 5K

5(K + I)

(iv) K - I = (K

I
2

I) - 2

(v) 5K + ~ = 5(K 11) - 1

. . Complele lhese expressions.

(i) K+3 = (K+I) _

(ii) 2K
(iii) 7K

+ 11

(iv) K - 3

= 2(K +
= 7(K

= (K +

(vii) 2 X 2K

_ __

= 2 --

(viii) 6 K X 6 = 6 --

I) _ __ _

(ix) 2K

+ 1) _ __ _

+ 2K

= _ _ X 2K
- 2-

I) _ _ __

(v) 2K - 1 = 2(K

1) _ _ __

(vi) 5K - 1 = 5(K

I) _

(x) 3K

+ 3 A-

3K =

= 3

_ __

Show these expres ions are true by faclorising the left hand side (LHS).

1Hinl. remove a fraclion and a binomial faclor.)

I

(i) "jK(K

+ I) + (K

(ii) iK(K - I)

(iii)

~(K +

I)

-t I)(K

+ K(K +

+ (K

+ 2) = /K

~K(3K +

I)

I) =

I)(K

+ 2)

1)(4K

= 1K + 1)(7K

+ 8)

. . Provc the. e idenlilie. truc.

(i) 2K(K - 2)

+ 4(K + I) - 6 = 2(K

(ii) jK(K + I)(K + 2)

(iii)

~K(3K

I)

+ (K

KI3(K

+ I)(K + 2)
I) -

K(K+I)

16

11

= !(K

! K(9K

(K

(iv) (K + I) + (K + IH(K + I)

(v) 2(2K

I)[(K

I]

(K

I) - 2J
+ I)(K

I) - 1J[2 K

+ I)

I) + IJ

Sue Thomsoo. lan ~et andEffiCfilld

+ 3)

5)

(K' + l r

I)" [2(K

+ 2)(K

(K+I)I(K+I)+I]
212(K + I)
I1

3A-

Mathematical Induction (Extension 1)

Warm-up activity:
Calculation
1 11 2
2 11 2 + 2 1 3
3 11 2 + 2 1 3 + 3 1 4
4 11 2 + 2 1 3 + 3 1 4 + 4 1 5
5 11 2 + 2 1 3 + 3 1 4 + 4 1 5 + 5 1 6
6 11 2 + 2 1 3 + 3 1 4 + 4 1 5 + 5 1 6 + 6 1 7
7 11 2 + 2 1 3 + 3 1 4 + 4 1 5 + 5 1 6 + 6 1 7 + 7 1 8
8 11 2 + 2 1 3 + 3 1 4 + 4 1 5 + 5 1 6 + 6 1 7 + 7 1 8 + 8 1 9
etc
etc
n?
In this topic, you will learn a method of
proof, called mathematical induction, with
which you can prove that the sum of an
infinite pattern is equal to a simple
expression.

Mathematical Induction
Syllabus: 7.4 Mathematical Induction. Applications

Mathematical Induction is a method of proof that can be used to prove that a statement IS true for
ALL positive integers n.
There are 3 main types of induction questions:
1. Proving a summation statement:
Prove that 1+ 3+ 5 + ...+ (2n 1) = n2 , for all positive integers n.
2. Proving a divisibility statement:
Prove that 5n 1 is divisible by 4, for all positive integers n.
3. Proving an inequality statement:
Prove that 2 n > n2 , for n > 4 .

How to do a proof by induction

Step 1:
Show that the statement is true for the smallest
value of n (usually n =1)

1st

Prove that the first

budgie is blue.
Substitute n = 1

Step 2:
Assume that the statement is true for n = k

kth

Assume it is blue.
Replace n with k.

Step 3:
Prove that the statement is true for n = k +1

Check all budgies tell the truth.

Step 4: (The conclusion)

If the result is true for n = k, then it is also true
for n = k +1.
Since it is true for n = 1, it must also be true for
n = 2, n = 3 and so on for all positive integers
n.
or
Hence the statement is true for all integers
n 1 , by induction.

We have assumed the kth budgie is blue, then

proved that the (k + 1)th budgie (i.e. the next
one in line) is also blue.
Since the first one is blue, so is the second and
therefore so is the third and the fourth so on.

WORKSHEETS ON MATHEMATICAL INDUCTION

Example 1: TYPE 1 SUMMATION
Show by induction that :

1
12 + 2 2 + 32 + ....+ n 2 = n(n +1)(2n +1)
6
for n a positive integer

step 1: Test n = 1

step 2: Assume true for n = k

step 3: Prove result is true for n = k + 1

step 4: True for all positive integers n 1 by induction

Your question
Show by induction that : 1+ 2 + 3 + ....+ n =
for n a positive integer

n
(n +1)
2

Example 2: TYPE 1 SUMMATION

Show by induction that :

Show by induction that :

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

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

for n a positive integer

step 1: Test n = 1
LHS: Tn = n(n +1)(n + 2) T1 = 1 .2.3 =

Sn =

RHS:

S1 =

Your question

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

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

True for n = 1
step 2: Assume true for n = k

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

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

step 3: Assume true for n = k + 1

ie Sk+1 =

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

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

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

becomes

k
(k +1)(k + 2)(k + 3) + (k +1)(k + 2)(k + 3)
4
(This is just Sk + Tk+1)
Factorise (k+1) (k+2) (k+3) from both terms

k
+1
4

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

k k 4
1
+1 = + then take out factor of
4 4 4
4
1
= (k +1)(k + 2)(k + 3) [ k + 4 ]
4

since

If the result is true for n = k then it is true for n = k+1

step 4: True for all positive integers n 1 by induction

n
1.2 + 2.3 + 3.4....+ n(n +1) = (n +1)(n + 2)
3
for n a positive integer

Example 3: TYPE 1 SUMMATION

Your question

Show by induction that :

Show by induction that :

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

2
2
2
1
+
+ ......+
= 1
1.3 3.5
(2n 1)(2n +1)
2n +1

for n a positive integer

for n a positive integer

step 1: Test n = 1

1
1
; T1 =
(3n 2)(3n +1)
(3 2)(3 +1)
1
=
4
n
RHS: Sn = 1
3n +1
1
1
S1 = 1
=
= LHS
3 +1
4
LHS:

Tn =

True for n = 1
step 2: Assume true for n = k

2
2
1
k
+
+ ......+
= 1
1.4 4.7
(3k 2)(3k +1)
3k +1
step 3: Assume true for n = k + 1
2
2
1
1
k +1
+
+ ......+
+
= 1
1.4 4.7
(3k 2)(3k +1) (3 ( k +1) 2)(3 ( k +1) +1)
3 ( k +1) +1

2
1
1
k +1
+
+ ......+
= 1

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

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

LHS =

= 1 k +1
3k + 4
= RHS

If the result is true for n = k then it is true for n = k+1

step 4: True for all positive integers n 1 by induction

Type 1: Summation Additional Questions:

example 1: Prove by induction for n a positive integer:
1 2
3
3
3
3
2
a) 1 + 2 + 3 + ....+ n = n (n +1)
4
2
b) 1+ 3 + 5 + ....+ (2n 1) = n

2
2
2
2
c) 1 + 3 + 5 + ....+ (2n 1) =

d) 1+ 2 + 2 + ...+ 2
2

n1

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

= 2n 1

example 2: Prove by induction for n a positive integer:

a) 1 + 2 + 3 + ....+ n =
3

1 2
n (n +1)2
4

b) 1.2 + 2.4 + 3.5 + ...+ n(n + 2) =

n
(n + 1)(2n + 7)
6

example 3: Prove by induction for n a positive integer:

1
1
1
n
+
+ ......+
=
a)
1.3 3.5
(2n 1)(2n +1) ( 2n +1)
b)

c)

1
1
1
1
+
+ ......+
= 1
1.2 2.3
n(n +1)
n +1
1
1 1 1
1
1
2 3 ...... n = n
x 0 or 1
x 1 x x
x
x
x ( x 1)

Example 4: TYPE 2 DIVISIBILITY

Show by induction that : 5
for n a positive integer

1 is divisible by 4

step 1: Test n = 1
when n = 1 5 1 = 5
which is divisible by 4
n

1 = 4

True for n = 1
step 2: Assume true for n = k
or

5 k 1 = 4 x P where P is any integer

5 k = 4P + 1

step 3: Prove result is true for n = k + 1

5 k+1 1 is divisible by 4
5 k+1 1 = 4 x Q where Q is an integer
LHS:

5 k+1 1 = 5 k.51 1
= ( 4P + 1)5 -1
= 20P + 5 - 1
= 20P - 4
= 4 ( 5P - 1)
=4xQ
which is divisible by 4

If the result is true for n = k then it is true for n = k+1

step 4: True for all positive integers n 1 by induction

Type 2: Divisibility Additional Questions:

example 4: Prove by induction
a) if n is even then n2 + 2n is divisible by 8
b) if n is even then 9n - 3 is a multiple of 6

Your question
2n

Show by induction that : 3

for n a positive integer

1 is divisible by 8

Example 5: TYPE 2 DIVISIBILITY

Show by induction that : x
positive integer

1 is divisible by (x-1) for n a

step 1: Test n = 1
when n = 1: x - 1 is divisible by (x-1)

(itself)

True for n = 1
step 2: Assume true for n = k

x k 1 = ( x 1) P

where P is any polynomial

step 3: Prove result is true for n = k + 1

x k+1 1 is divisible by (x - 1)
k+1
ie: x 1 = (x-1).Q where Q is any polynomial
LHS:

x k+1 1 = x k .x1 1
=

x k+1 x + x 1

=x

.x1 x + x 1

x ( x k 1) +1( x 1)

x ( x 1) P +1( x 1)

( x 1) ( Px +1)

( x 1) Q

which is divisible by (x-1)

If the result is true for n = k then it is true for n = k+1

step 4: True for all positive integers n 1 by induction

Your question
Show by induction that : a
a positive integer

1 is divisible by (a-1) for n

Example 6: TYPE 3 INEQUALITIES

Show by induction that
integer

3n 1+ 2n for n a positive

step 1: Test n = 1
when n = 1:

31 1+ 2

31 3
True for n = 1
step 2: Assume true for n = k

3k 1+ 2k
step 3: Prove result is true for n = k + 1
show
ie:

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

3k+1 2k + 3 ***

3k+1 = 31.3k
k
from step 2: 3 1+ 2k
31.3k 3(1+ 2k)
LHS:

31.3k 3 + 6k
3k+1 2k + 3 + 4k *** break 6k up into 2k +4k
3k+1 2k + 3 + 4k 2k + 3
since k is a positive integer

If the result is true for n = k then it is true for n = k+1

step 4: True for all positive integers n 1 by induction

Type 3: Inequality Additional Questions:

example 6: Prove by induction
(1+ p)n 1+ np where p > -1

Your question
Show by induction that : 5
integer

1+ 4n for n a positive

Additional Exercises:
Prove the following, using mathematical induction, for all positive integers n
(except when asked to do otherwise):
n

S1:

! r = 2 (n + 1)
r =1

S2:

! (3r 1) = 2 (3n + 1)
r =1

S3:

!2

r 1

= 2n 1

r =1

S4:

! 3(4

r 1

) = 4n 1

r =1

S5:

!r

r =1

S6:

! r3 =
r =1

n
(n + 1)(2n + 1)
6

n2
(n + 1) 2
4

S7:

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

S8:

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

S9:

! (2r 1) = n

r =1

S10:

x n 1 + x n 2 c + x n 3c 2 + ..... + xc n 2 + c n 1 =
n

S11:

xn cn
xc

! a + (r 1)d = 2 [ 2a + (n 1)d ]
r =1

S12:

! ar i 1 =
i =1

S13:

a (1 r n )
(1 r )

12.2 + 2 2.3 + 32.4 + ......... + n 2 .(n + 1) =

n
( n + 1)( n + 2)(3n + 1)
12

S14:

! (2r 1)

r =1

S15:

! r (r + 1)(r + 2) =
r =1

S16:

! r (1 + r ) =
r =1

S18:

! r (r + 2) =
r =1

S19:

! (3r 2) =
r =1

S20:

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

4

23 + 43 + 63 + ........ + (2n)3 = 2n 2 (n + 1) 2
n

S17:

n
(4n 2 1)
3

n(n + 1)(n + 2)
3
n(n + 1)(2n + 7)
6
n(3n 1)
2

! (4r 3)(4r + 1) = 4n + 1
r =1

S21:

! log
r =1

r +1
= log(n + 1)
r

S22:

! r (r !) = (n + 1)! 1
r =1

S23:

! (r + 1)! =
r =1

(n + 1) 1!
(n + 1)!

S24:

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

S25:

2.20 + 3.21 + 4.2 2 + 5.23 + ..... + (n + 1)2n 1 = n.2n

S26:

! r.2

= (n 1)2n +1 + 2

r =1

S27:

!
i =1

S28:

i (i + 1) n(n + 1)(n + 2)
=
2
6
1

! ( 2 j 1) (2 j + 1) = 2n + 1
j =1

D1:

9n 7 n is even

D2:

n(n + 1)(n + 2) is divisible by 3

D3:

n(n + 1) is even

D4:

7 n 3n is divisible by 4

D5:

9n + 2 4n is a multiple of 5

D6:

n3 + 2n is divisible by 3

D7:

8n 5n is divisible by 3

D8:

n(n + 2) is divisible by 8 if n is even

D9:

3n + 2n is a multiple of 5 when n is odd

D10:

5n 1 is divisible by 4

D11:

n(n + 1)(2n + 1) is divisible by 6

D12:

7 n + 2 is divisible by 3

D13:

7 n + 3n.7 n 1 is divisible by 9

D14.

x 2 n y 2 n is divisible by x + y

D15:

9n +1 8n 9 is divisible by 64

D16:

32 n 1 is divisible by 8

D17:

34 n 1 is divisible by 80

D18:

n 2 + 2n is a multiple of 8 if n is even

D19:

7 2 n 48n 1 is divisible by 2304

D20:

7 n + 19 n is a multiple of 13 when n is odd

For Extension 2 thrill-seekers:

D21:

n5 n is divisible by 30

I1:

3n > n

I2:

3n > 2 n

I3:

2n > n 2 , for n > 4

I4:

3n > n 2

I5:

3n 1 + 2n

I6:

(1 + p ) n 1 + np

I7:

4 n 1 + 3n , for n > 1

I8:

2n 2 n 2 + n + 1 , for n > 1

I9:

n ! > n 2 , for n 4

I10:

n ! > 2 n , for n > 4

I11:

4n (2n)!

, for n > 1
n + 1 (n !) 2

I12:

5n n5 , for n 5

I13:

n ! > 3n , for n 7

Induction HSC Questions (Extension 1)

Year
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1994
1993
1992

Quest Marks Content

3b
3
Summation
4b
3
Divisibility
5dii
3
Summation
4d
3
Inequality
4a
3
3d
3
Summation
5a
3
Summation
6a
3
Divisibility
4a
3
Summation
5a
3
3a
3
Divisibility
5b
5
Summation
3c
Divisibility
5a
Summation
4b
Summation