Scribd
Upload
97 views2 pages

Examples On Mathematical Induction: Divisibility 3: Created by Mr. Francis Hung Last Updated: December 14, 2011

This document contains 8 examples of proofs using mathematical induction. Each example proves that a certain expression is divisible by 3 for all non-negative integers n. The examples use the standard structure of mathematical induction, establishing the base case and inductive step to prove the property holds for all integers.

Uploaded by

Kxng Bryce
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
97 views2 pages

Examples On Mathematical Induction: Divisibility 3: Created by Mr. Francis Hung Last Updated: December 14, 2011

This document contains 8 examples of proofs using mathematical induction. Each example proves that a certain expression is divisible by 3 for all non-negative integers n. The examples use the standard structure of mathematical induction, establishing the base case and inductive step to prove the property holds for all integers.

Uploaded by

Kxng Bryce
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

Examples on Mathematical Induction: divisibility 3

Created by Mr. Francis Hung Last updated: December 14, 2011


n
1. Prove by mathematical induction 7 + 5 is divisible by 3 for all non-negative integer n.
1. Let P(n) be the statement “7n + 5 is divisible by 3 for all positive integers n.”
n = 1, 71 + 5 = 12 which is divisible by 3. P(1) is true.
Suppose P(k) is true for some positive integer k.
i.e. 7k + 5 = 3m for some integer m.
7k = 3m – 5
when n = k + 1, 7k+1 + 5 = 7(7k) + 5
= 7(3m – 5) + 5
= 21m – 30
= 3(7m – 10)
since 7m – 10 is an integer, 7k+1 + 5 is divisible by 3
P(k + 1) is true when P(k) is true.
By the principle of Mathematical Induction, P(n) is true for all positive integer n.
2. Prove by mathematical induction 22n – 1 is divisible by 3 for all non-negative integer n.
3. Prove by mathematical induction n(n2 + 2) is divisible by 3 for all non-negative integer n.
4. 1984 Paper 2
Prove by mathematical induction that, for all positive integers n, 4n3 – n is divisible by 3.
5. 1996 Paper 2 Q4
Prove by mathematical induction, that for all positive integers n, (2n3 + n) is divisible by 3.
6. HKCEE Additional Mathematics 2006 Q8
Prove that n3 – n + 3 is divisible by 3 for all positive integers n.
Let P(n) ≡ “n3 – n + 3 is divisible by 3 for all positive integers n.”
n = 1, 13 – 1 + 3 = 3, which is divisible by 3.
Suppose k3 – k + 3 is divisible by 3 for some positive integer k.
i.e. k3 – k + 3 = 3m for some integer m.
When n = k + 1, (k + 1)3 – (k + 1) + 3
= k3 + 3k2 + 3k + 1 – k – 1 + 3
= (k3 – k + 3) + 3(k2 + k)
= 3m + 3(k2 + k)
= 3(m + k2 + k)
which is a multiple of 3.
∴ If P(k) is true, then P(k + 1) is also true.
By the principle of mathematical induction, P(n) is true for all positive integer n.

http://www.hkedcity.net/ihouse/fh7878/ Page 1
Divisibility 3 Mr. Francis Hung

7. HKCEE Additional Mathematics 2010 Q8


Prove, by mathematical induction, that n(n2 – 3n + 5) is divisible by 3 for all positive integers
n.
Let P(n) ≡ “n(n2 – 3n + 5) is divisible by 3”, where n is a positive integer.
n = 1, 1×(1 – 3 + 5) = 3 which is divisible by 3.
∴ P(1) is true.
Suppose k(k2 – 3k + 5) is divisible by 3 for some positive integer k.
k(k2 – 3k + 5) = 3m, where m is an integer.
When n = k + 1,
(k + 1)[(k + 1)2 – 3(k + 1) + 5]
= (k + 1)(k2 + 2k + 1 – 3k – 3 + 5)
= (k + 1)(k2 – k + 3)
= k3 – k2 + 3k + k2 – k + 3
= k3 + 2k + 3 = (k3 – 3k2 + 5k) + (3k2 – 3k + 3)
= 3m + 3(k2 – k + 1) = 3(m + k2 – k + 1)
Q m + k2 – k + 1 is an integer
∴ 3(m + k2 – k + 1) is divisible by 3
∴ (k + 1)[(k + 1)2 – 3(k + 1) + 5] is divisible by 3
∴ If P(k) is true then P(k +1) is also true.
By M.I., P(n) is true for all positive integer n.
8. HKCEE Additional Mathematics 2011 Q2
8. Prove that 5n – 2n is divisible by 3 for all positive integers n.
8. Let P(n) ≡ “5n – 2n is divisible by 3”, where n is a positive integer.
n = 1, 5 – 2 = 3, which is divisible by 3.
P(1) is true.
Suppose P(k) is true.
i.e. 5k – 2k = 3m for some positive integer m.
When n = k + 1.
5k+1 – 2k+1 = 5×5k – 2×2k
= 5×(2k + 3m) – 2×2k
= 5×2k – 2×2k + 5×3m
= 3×2k + 5×3m
= 3×(2k + 5m)
Q 2k + 5m is an integer
∴ 5k+1 – 2k+1 is divisible by 3
If P(k) is true, then P(k + 1) is also true.
By the principle of mathematical induction, P(n) is true for all positive integer n.

http://www.hkedcity.net/ihouse/fh7878/ Page 2

You might also like