Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
33 views15 pages

Mathematical Induction: Prepared By: Mr. Israel P. Penero Course Facilitator (Number Theory)

This document discusses mathematical induction, which is a method of proof applicable to statements about natural numbers. It presents the principle of mathematical induction, which involves proving a base case, making an inductive assumption, and proving the next case. Several examples demonstrate applying this principle to prove formulas for the sum of terms and divisibility by 3 for all natural numbers.

Uploaded by

Marielle Landicho
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
33 views15 pages

Mathematical Induction: Prepared By: Mr. Israel P. Penero Course Facilitator (Number Theory)

This document discusses mathematical induction, which is a method of proof applicable to statements about natural numbers. It presents the principle of mathematical induction, which involves proving a base case, making an inductive assumption, and proving the next case. Several examples demonstrate applying this principle to prove formulas for the sum of terms and divisibility by 3 for all natural numbers.

Uploaded by

Marielle Landicho
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/ 15

MATHEMATICAL

INDUCTION
PREPARED BY: MR. ISRAEL P. PENERO
COURSE FACILITATOR (NUMBER THEORY)
Well-Ordering Principle (WOP)

A non-empty set S of non-negative integer contains a least


element. That is, there exists a ∈ S such that a ≤ b for all b ∈ S.

An alternative statement could be; “If S ⊂ N and S is not an


empty set, then S has a least element”.

Illustration:

Say Z+, and n ∈ Z+ where n ≥ 4. Then here, there is a least


element of S that is it could be n = 1. But in n ∈ Q, there is no least
element.
Mathematical induction is a
technique for proving a
statement ( a theorem, or a
formula ) that is asserted
about every natural number.
Principle of Mathematical Induction (PMI)
Let P(n) be a predicate defined for integers n.
Suppose the following statements are true:
1. Basis step:
P(a) is true for some fixed a ∈ Z .
2. Inductive step: For all integers k ≥ a,
if P(k) is true then P(k+1) is true.
Then for all integers n ≥ a, P(n) is true.
Example 1: Prove using the Mathematical Induction

Proof:
i. Verify if it is true for n = 1 For n = 2 For n = 3
ii. Assume that for n = 1, 2, 3, … , k is true.
iii. Show that its true of n = k + 1.
Example 2: Prove using the Mathematical Induction

Proof:

i. Verify if it is true for n = 1 For n = 2


For n = 3
2 2 2 2
ii. Assume that for n = 1 , 2 , 3 , … , k is
true.
iii. Show that its true of n = k + 1.
Example 3: Prove using the Mathematical Induction

Proof:

i. Verify if it is true for n = 1, n = 2, n = 3, …


for n = 1 for n = 2 for n = 3

1 = 12 1 + 3 = 22 1 + 3 + 5 = 32
1 =1 4=4 9=9
ii. Assume it is true of n = k

ii. Assume it is true of n = k + 1


Example 4: Use mathematical induction to prove that 4n – 1 is
divisible by 3 for all positive integer n.

Proof:

i. Verify if it is true of n = 1, n = 2, n = 3, …

For n = 1

41 – 1 = 3. (It is clearly seen that the result is divisible by 3


For n = 2

42 – 1 = 15. (the result is divisible by 3)


For n = 3

43 – 1 = 63. (the result is divisible by 3)


ii. Assume that for n = k, 4k – 1 is divisible by 3, thus 4k – 1 = 3q where
q ∈ Z.
iii. Show that it is true for n = k + 1

4k + 1 – 1
= (4k)(4) – 1
= (4)(4k) – 4 + 3
= 4[ 4k – 1] + 3
= 4(3q) + 3 (by hypothesis of induction)
= 3(4q + 1) where 4q + 1 ∈ Z

Hence, 4k+1 – 1 is divisible by 3

Therefore, by Principle of Mathematical Induction (PMI),


4n – 1 is divisible by 3.
Exercises: Prove the following using the principle
of mathematical induction

a) 1 + 5 + 9 + … + (4n – 3) = n (2n -1)

b) 20 + 21 + 22 + … + 2n = 2n+1 – 1; n ≥ 0

You might also like