Scribd
Upload
100 views

Mathcentre Proof2

This document contains examples of proofs by mathematical induction. It demonstrates proofs for equations involving sums, powers, and divisibility. Exercises at the end ask the reader to prove similar statements using induction.

Uploaded by

Jeff Emi
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
100 views

Mathcentre Proof2

This document contains examples of proofs by mathematical induction. It demonstrates proofs for equations involving sums, powers, and divisibility. Exercises at the end ask the reader to prove similar statements using induction.

Uploaded by

Jeff Emi
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/ 2

community project

mathcentre community project


encouraging academics to share maths support resources
All mccp resources are released under an Attribution Non-commerical Share Alike licence

Proof by Induction : Further Examples


mccp-dobson-3111
Example

Prove by induction that 11n − 6 is divisible by 5 for every positive integer n.

Solution

Let P (n) be the mathematical statement

11n − 6 is divisible by 5.

Base Case: When n = 1 we have 111 − 6 = 5 which is divisible by 5. So P (1) is correct.

Induction hypothesis: Assume that P (k) is correct for some positive integer k. That means 11k − 6
is divisible by 5 and hence 11k − 6 = 5m for some integer m. So 11k = 5m + 6.

Induction step: We will now show that P (k + 1) is correct. Always keep in mind what we are
aiming for and what we know to be true. In this case we want to show that 11k+1 − 6 can be
expressed as a multiple of 5, so we will start with the formula 11k+1 − 6 and we will rearrange it
into something involving multiples of 5. At some point we will also want to use the assumption that
11k = 5m + 6 .

11k+1 − 6 = (11 × 11k ) − 6 by the laws of powers


= 11(5m + 6) − 6 by the induction hypothesis
= 11(5m) + 66 − 6 by expanding the bracket
= 5(11m) + 60
= 5(11m + 12) since both parts of the formula have a common factor of 5.

As 11m + 12 is an integer we have that 11k+1 − 6 is divisible by 5, so P (k + 1) is correct. Hence by


mathematical induction P (n) is correct for all positive integers n.

Example
n(n+1)(2n+1)
Prove by induction that 12 + 22 + 32 + . . . + n2 = 6
for every positive integer n.

Solution
n(n+1)(2n+1)
Let P (n) be the statement 12 + 22 + 32 + . . . + n2 = 6
.

Base Case: When n = 1 the left hand side of the equation is 1 and the right hand side is
1(1+1)(2+1)
6
= 2×3
6
= 1. So P (1) is correct.

c
Katy Dobson Alan Slomson
www.mathcentre.ac.uk University of Leeds University of Leeds
Induction hypothesis: Assume that P (k) is correct for some positive integer k. That means that
the left hand side of the equation equals the right hand side, so 12 + 22 + 32 + . . . + k 2 = k(k+1)(2k+1)
6
.

Induction step: We will now show that P (k + 1) is correct. Keep in mind what we are aiming for,
mathcentre community project
so in this case the right hand side of the equation should be (k+1)((k+1)+1)(2(k+1)+1)
So starting with the left hand side we have
6
= (k+1)(k+2)(2k+3)
6
.
encouraging academics to share maths support resources
2 2 2 All mccp resources
2 are released
2 under an Attribution Non-commerical Share Alike licence
1 + 2 + 3 + . . . + k + (k + 1) =
= (12 + 22 + 32 + . . . + k 2 ) + (k + 1)2
k(k + 1)(2k + 1)
= + (k + 1)2 by the induction hypothesis
6
k(k + 1)(2k + 1) 6(k + 1)2
= + by making each part a fraction over 6
6 6
k(k + 1)(2k + 1) + 6(k + 1)2
= by making it a single fraction over 6
6
(k + 1)[k(2k + 1) + 6(k + 1)]
= by taking out the common factor
6
(k + 1)(2k 2 + 7k + 6)
= by expanding out the square brackets
6
(k + 1)(k + 2)(2k + 3)
= by factorizing
6
(k + 1)((k + 1) + 1)(2(k + 1) + 1)
= this is the right hand side.
6
So P (k + 1) is correct. Hence by mathematical induction P (n) is correct for all positive integers n.

Example

Prove by induction that 2n > 2n for every positive integer n > 2.

Solution

Let P (n) be the mathematical statement


2n > 2n.
Base Case: When n = 3 we have 23 = 8 > 6 = 2 × 3. So P (3) is correct.
Induction hypothesis: Assume that P (k) is correct for some positive integer k. That means that
2k > 2k.
Induction step: We will now show that P (k + 1) is correct.
2k+1 = 2 × 2k > 2 × 2k by the induction hypothesis
= 2(k + 1).
So P (k + 1) is correct. Hence by mathematical induction P (n) is correct for all positive integers
n > 2.

Exercises

Prove by induction that


1 1 1 1 n
1. 1×2
+ 2×3
+ 3×3
+ ...+ n×(n+1)
= n+1
for all positive integers.

2. n3 − n is divisible by 6 for all positive integers.


3. 2n+2 + 32n+1 is divisible by 7 for all positive integers.

c
Katy Dobson Alan Slomson
www.mathcentre.ac.uk University of Leeds University of Leeds

You might also like