#Just get into action and make it Happen!

Call/Text/App 0717376437/0772655123. Email Address: linkstyletechnologycenter@gmail.com

PRIVATE TUITION

A+ PURE MATHEMATICS EXAM PACKAGE CODE: 0720

THE PRINCIPLE OF MATHEMATICAL INDUCTION

Proving Divisibility Results:
 Proof by Mathematical induction is used when you are given a mathematical statement
that is true for all natural number, n.
 It is basically used to prove statements that assert that P(n) is true for all positive integer
values of n, where P(n) is a propositional function.
 The Proof by Mathematical Induction is done using the following steps:

Steps for a Proof by Mathematical Induction:

 Step 1: Base case ( Basis step) (Prove for n = 1, i.e P(1))

 Step 2: Inductive Hypothesis (Assumption) (Assume true for n = k, i.e P(k))
 Step 3: Inductive step ( Process) (Prove true for n = k + 1, i.e P(k + 1)
 Step 4: Conclusion. (Make some concluding remarks)
 All the above steps are best explained in the following worked examples.
 Worked Example 1
 Use mathematical induction to prove that n2 + n is divisible by 2 whenever n is a positive
integer. [5]

 Suggested Solution:

 Let p(n) = n2 + n
 Base case:
 Prove true for n = 1
 p(n) = (1)3 + (1)
 = 2 which is divisible by 2
 P(n) is true for n = 1

©All rights reserved: LTC 2020. Eng Kassy 0717376437 Its passion that propels you!!
 #Just get into action and make it Happen!

 Inductive Hypothesis:

 For n = k
Assume that the statement is true for n = k.
 That is: p(k) = k2 + k is divisible by 2, where k is an arbitrary positive integer.

 Inductive step:
 Prove that the statement is also true for n = k + 1
 That is: P(k) = (k + 1)2 + (k + 1) is divisible by 2

 (Now quickly try addition or subtraction of P(k+1) and P(k))
 ………………
 P(k + 1) + P(k) = 2A (should also be divisible by 2)
 ……………….
 LHS
 (k + 1)2 + (k + 1) + k2 + k
 k2 + 2k + 1+ k + 1 + k2 + k
 2k2 + 4k + 2
 2(k2 + 2k + 1)
 2A (Where A = k2 + 2k + 1)
 Which is divisible by 2
 Since the sum of P(k+1) and P(k) is divisible by 2, both P(k) and P(k+1) are divisible by
2.

 .
 Conclusion:
 Whenever the statement, p(n) is true for n = k, it is also true for the next term,
 n = k + 1. Since the statement has been proved to be true for n = 1, it is also true for
n = 2, n = 3, 4, 5 and so on. Therefore, by the Principle of Mathematical Induction
(PMI), n2 + n is divisible by 2 whenever n is a positive integer.

 Worked Example 2
 Prove by mathematical induction that 3 divides n3 + 2n whenever n is a positive integer.
[5]
 …………………………………………………………………………………………..
 Suggested solution
 Let P(n) = n3 + 2n
 For n = 1
 P(1) = (1)3 + 2(1)
 =1+2

©All rights reserved: LTC 2020. Eng Kassy 0717376437 Its passion that propels you!!
 #Just get into action and make it Happen!

 = 3 which is exactly divisible by 3.

 P(n) is true for n = 1

 Assume true for n = k

 That is: P(k) = k3 + 2k is divisible by 3

 For n = k + 1
 Prove that P(k+1) = (k + 1)3 + 2(k + 1) is divisible by 3
 (Now quickly try addition or subtraction of P(k+1) and P(k))

 ……………………
 P(k + 1) – P(k) = 3A (should also be divisible by 3)
 ……………………
 LHS
 (k + 1)3 + 2(k + 1) – (k3 + 2k)
 (k + 1)[k2 + 2k + 1] + 2(k + 1) – k3 - 2k
 k3 + 2k2 + k + k2 + 2k + 1 + 2k + 2 - k3 - 2k
 3k2 + 3k + 3
 3(k2 + k + 1)
 3A (Where A = k2 + k + 1)
 Which is divisible by 3.

 Whenever the statement, p(n) is true for n = k, it is also true for the next term,
 n = k + 1. Since the statement has been proved to be true for n = 1, it is also true for
 n = 2, n = 3, 4, 5 and so on. Therefore, by the Principle of Mathematical Induction (PMI),
n3 + 2n is divisible by 3 whenever n is a positive integer.

 Worked Example 3
 Prove by mathematical induction 103n + 13n+1 is divisible by 7 for all n >= 1. [7]
……………………………………………………………………………………….
 Suggested solution:
 Let P(n) = 103n + 13n+1
 For n = 1
 P(n) = 103(1) + 131+1.
 =103 + 132
 =1000 + 169
 =1169 which is divisible by 7
 P(n) is true for n = 1

 Assume true for n = k
 That is: P(k) = 103k + 13k+1 is divisible by 7

©All rights reserved: LTC 2020. Eng Kassy 0717376437 Its passion that propels you!!
 #Just get into action and make it Happen!

 For n = k+1
 Prove that 103(k+1) + 13k+1+1
=103(k+1) + 13k+2 is also divisible by 7
 (Now quickly try addition or subtraction of P(k+1) and P(k))

………………………
P(k + 1) + P(k) = 7A (should also be divisible by 7)
……………………….
LHS
P(k + 1) + P(k)
103(k+1) + 13k+2 +(103k + 13k+1)

103k+3 + 13k+2 +103k +13k+1

103k .103 + 13k.132 +103k + 13k.131
103k .103 + 103k + 13k.132 + 13k.131
1000.103k + 1.103k + 169.13k + 13.13k
1001.103k + 182.13k
7(143.103k + 26.13k)
7A (Where A = 143.103k + 26.13k )
Which is divisible by 7.

 Since the sum of P(k+1) and P(k) is divisible by 7, both P(k) and P(k+1) are divisible by
7.

 Whenever the statement, P(n) is true for n = k, it is also true for the next term,
 n = k + 1. Since the statement has been proved to be true for n = 1, it is also true for
 n = 2, n = 3, 4, 5 and so on. Therefore, by the Principle of Mathematical Induction (PMI),
103n + 13n+1 is divisible by 7 for all n >= 1.

 Worked Example 4
 Use mathematical induction to prove that 52n + 22(n-1)3n-1 is divisible by 13 for all positive
integer values of n. [7]
…………………………………………………………………………………………….
 Suggested solution:
 Let P(n) = 52n + 22(n-1)3n-1
 For n = 1
 52(1) + 22(1-1)31-1
 52 + 1
 25 + 1

©All rights reserved: LTC 2020. Eng Kassy 0717376437 Its passion that propels you!!
 #Just get into action and make it Happen!

 26 (which is divisible by 13)

 P(n) is true for n = 1

 Assume true for n = k.

 That is: P(k) = 52k + 22(k-1)3k-1
 For n = k+1
 Prove that p(k+1) = 52(k+1) + 22(k+1-1)3k+1-1
 = 52(k+1) + 22k3k is also divisible by 13.
 (Now quickly try addition or subtraction of P(k+1) and P(k))

 …………………..
 P(k+1) + P(k) = 13A (Should also be divisible by 13)
 ……………………
 LHS
 P(k+1) + P(k)
 52(k+1) + 22k3k + 52k + 22(k-1)3k-1
 52k + 2 + 22k3k + 52k + 22k-2)3k-1
 52k.52 + 52k + 22k3k + 22k.2-23k.3-1
1 1
 25.52k + 1.52k + 22k3k + 422k3k.3
1
 26.52k + 1. 22k3k + 1222k3k
13
 26.52k + 1222k3k
1
 13(2.52k + 1222k3k)
1
 13A (where A = 2.52k + 1222k3k)
 Which is divisible by 13.
 Since the sum of P(k+1) and P(k) is divisible by 13, both P(k) and P(k+1) are divisible by
13.
………..
 Whenever the statement, P(n) is true for n = k, it is also true for the next term,
 n = k + 1. Since the statement has been proved to be true for n = 1, it is also true for
 n = 2, n = 3, 4, 5 and so on. Therefore, by the Principle of Mathematical Induction (PMI),
52n + 22(n-1)3n-1 is divisible by 13 for all n >= 1.

 Worked Example 5
 Prove by induction that 34n+2 + 52n+1 is divisible by 14 for all ∈ Z+ [7]
…………………………………………………………………………………………….
 Suggested Solution:
 Let P(n) = 34n+2 + 52n+1
 For n = 1
 P(1) = 34(1)+2 + 52(1)+1

©All rights reserved: LTC 2020. Eng Kassy 0717376437 Its passion that propels you!!
 #Just get into action and make it Happen!

 = 36 + 53
 = 854 (Which is divisible by 14)
 P(n) is true for n = 1

 Assume true for n = k
 That is: P(k) = 34k+2 + 52k+1 is divisible by 14.
 For n = k+1
 Prove that P(k+1) = 34(k+1)+2 + 52(k+1)+1
 = 34k+6 + 52k+3 is divisible by 14.
 (In this case, adding P(k+1) and P(k) could not help, so you try other gymnastics like
subtracting 11P(k) from P(k+1).
 ……………………….
 P(k+1) – 11P(k) = 14A
 ………………………..
 LHS
 P(k+1) – 11P(k)
 34k+6 + 52k+3 -11(34k+2 + 52k+1)
 34k+6 + 52k+3 -11. 34k+2 – 11.52k+1
 34k.36 + 52k.53 -11. 34k.32 – 11.52k.51
 729.34k + 125.52k -99.34k – 55.52k
 729.34k - 99.34k + 125.52k - 55.52k
 630.34k + 70.52k
 14(45.34k + 5.52k)
 14A (where A = 45.34k + 5.52k )
 which is divisible by 14

 Since the difference between P(k+1) and 11P(k) is divisible by 14, both P(k) and P(k+1)
are divisible by 14.
………..
 Whenever the statement, P(n) is true for n = k, it is also true for the next term,
 n = k + 1. Since the statement has been proved to be true for n = 1, it is also true for
 n = 2, n = 3, 4, 5 and so on. Therefore, by the Principle of Mathematical Induction (PMI),
34n+2 + 52n+1 is divisible by 14 for all ∈ Z+

 Worked Example 6
 Use mathematical induction to prove that 92n – 52n is divisible by 7 for all ∈ Z+ [7]
…………………………………………………………………………………………
 Suggested solution:
 Let P(n) = 92n – 52n
 For n = 1.
 P(1) = 92(1) – 52(1)

©All rights reserved: LTC 2020. Eng Kassy 0717376437 Its passion that propels you!!
 #Just get into action and make it Happen!

 = 81 – 25
 = 56 (Which is divisible by 7)
 P(n) is true for n = 1
 Assume true for n = k
 P(k) = 92k – 52k
 For n = k+1
 P(k+ 1) = 92(k+1) – 52(k+1)
 = 92k+2 – 52k+2
 (In this case, adding P(k+1) and P(k) could not help, so you try other gymnastics like
subtracting 4P(k) from P(k+1).

 …………………….
 P(k+1) – 4P(k) = 7A
 ……………………..
 LHS
 P(k+1) – 4P(k)
 92k+2 – 52k+2 -4(92k – 52k)
 92k.92 – 52k.52 -4.92k + 4.52k
 81.92k – 4.92k – 25.52k + 4.52k
 77.92k -21.52k
 7(11. 92k -3.52k)
 7A (Where A = 11. 92k -3.52k)
 Which is divisible by 7
 Since the difference between P(k+1) and 4P(k) is divisible by 7, both P(k) and P(k+1)
are divisible by 7.
………..
 Whenever the statement, P(n) is true for n = k, it is also true for the next term,
 n = k + 1. Since the statement has been proved to be true for n = 1, it is also true for
 n = 2, n = 3, 4, 5 and so on. Therefore, by the Principle of Mathematical Induction (PMI),
92n – 52n is divisible by 7 for all ∈ Z+

©All rights reserved: LTC 2020. Eng Kassy 0717376437 Its passion that propels you!!
 #Just get into action and make it Happen!

Examination Practice Questions:

(1) Use mathematical induction to prove that n3 – n is divisible by 3 for all positive integer
values of n. [5]

(2) Use mathematical induction to prove that 5n - 1 is divisible by 4 for all positive integer
values of n. [5]

(3) Prove that 5 divides n5 - n whenever n is a positive integer. [5]

(4) Prove by mathematical induction that 4n+1 + 52n-1 is divisible by 21 for all positive integer
values of n. [7

(5) Prove that 7n + 4n + 1 is divisible by 6 for all n ≥1. [7]

(6) Prove by induction that 52n – 32n is a multiple of 8 for ∈ Z+ [7]

(7) h(n) = 24× 24n + 34n, where n is non-negative integer.

(a) Write down h(n + 1) – h(n) [4]

(b) Prove by induction, that h(n) is divisible by 5. [3]

(8)Prove by mathematical Induction that 26n + 32n-2 is divisible by 5. [7]

(9) Prove that if 11n+1 + 122n-1 is divisible by 133 for ∈ Z+ [7]

(10)It is given that g(n) = 7n(6n + 1) – 1, for n = 1,2,3,…

(a) Show that g(n + 1) – g(n) = 7n(36 + 48) [4]

(b) Hence prove by mathematical induction that g(n) is divisible by 12 for every positive
integer n. [3]

(11) Prove by mathematical induction that 52n – 1 is divisible by 24 for all positive
integers n. [7]

(12) Prove by mathematical induction that 7n+2 + 82n+1 is divisible by 57 for ∈ Z+ [7]
(13) Prove by induction that 92n – 52n is divisible by 7 for ∈ Z* [7]

(14) Use the method of induction to prove that 6n – 1 is divisible by 5 for all positive
integer values of n. [7]
(15) Prove by Induction that 8 – 7n + 6 is divisible by 7 for all positive integral values of
n

n.

©All rights reserved: LTC 2020. Eng Kassy 0717376437 Its passion that propels you!!
 #Just get into action and make it Happen!

(16) Show that, for all positive integral values of n, 22n+1 + 7n is divisible by 3. [7]
……………………………………………………………………………………………
Compiled by Engineer L. kasirowe Khumalo. (Professional Private Tutor)
……………………………………………………………………………………………
For more A+ Exam packages and Tutorials, send the message join International LTC
group to our WhatsApp numbers above or email us on the above email address. Wish
you all the best. God bless you!!

#No stone shall be left unturned!

©All rights reserved: LTC 2020. Eng Kassy 0717376437 Its passion that propels you!!