Scribd
Upload
13 views2 pages

Lecture 17 Complete

This lecture covers the concept of strong induction, including its principles and proof strategies. It presents two proofs: one demonstrating that a recursively defined sequence equals a specific formula, and another proving that every positive natural number can be expressed as the product of an odd number and a power of 2. The lecture emphasizes the use of multiple base cases and more complex induction hypotheses.

Uploaded by

a04017229
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
13 views2 pages

Lecture 17 Complete

This lecture covers the concept of strong induction, including its principles and proof strategies. It presents two proofs: one demonstrating that a recursively defined sequence equals a specific formula, and another proving that every positive natural number can be expressed as the product of an odd number and a power of 2. The lecture emphasizes the use of multiple base cases and more complex induction hypotheses.

Uploaded by

a04017229
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

Lecture 17

Strong Induction
Wednesday, Feb. 26

In This Lecture. . .
Multiple base cases!
More complicated induction hypotheses!
Using the unlimited power of strong induction!

Theorem 17.0: Strong Induction Principle


Let p(n) be a logical formula defined for n ∈ N. Then ∀n ∈ N, p(n) is true if the following hold:
p(0) is true.
∀n ∈ N, ([∀k ∈ N, (0 ≤ k ≤ n ⇒ p(k))] ⇒ p(n + 1)) is true.

Proof (sketch): Apply the weak induction principle to the proposition q(n) defined for any n ∈ N
by ∀k ∈ N, (0 ≤ k ≤ n ⇒ p(k)).

Proof Strategy: Strong Induction


To prove a proposition of the form ∀n ≥ n0 , p(n) (where n and n0 are integers),
1. Prove p(n0 ), p(n0 + 1), . . . , p(n1 ) for some integer n1 ≥ n0 (the base cases).
2. Let n ≥ n1 be an integer and assume that p(k) is true for all integers k with n0 ≤ k ≤ n
(the induction hypothesis), then prove that p(n + 1) is true. This is called the induction
step.

A sequence of numbers is defined recursively by a0 = 0, a1 = 1, and an+1 = 3an − 2an−1 for n ≥ 1.


Prove that an = 2n − 1 for all n ∈ N.
1
Solution

Proof: We proceed by strong induction on n.


Base cases.
When n = 0, we have a0 = 0 = 20 − 1.
When n = 1, we have a1 = 1 = 21 − 1.
Induction hypothesis. Let n ∈ N with n ≥ 1. Assume that ak = 2k − 1 for all k ∈ N with
0 ≤ k ≤ n.

1
Induction step. We want to show that an+1 = 2n+1 − 1. As n ≥ 1, we have

an+1 = 3an − 2an−1


= 3(2n − 1) − 2(2n−1 − 1) (by the IH for k = n and k = n − 1)
n n
= 3 · 2 − 3 − (2 − 2)
= 2 · 2n − 1
= 2n+1 − 1,

which proves the claim for all n ∈ N.

Prove that every positive natural number is the product of an odd number and a power of 2.
2 Solution

Proof: Induct on n.
Base case. When n = 1, we have 1 = 1 · 20 , which is the product of an odd number and a
power of 2.
Induction hypothesis. Let n ∈ N with n ≥ 1. Assume that every number k ∈ N with
1 ≤ k ≤ n can be written as the product of an odd number and a power of 2.
Induction step. We want to show that n + 1 can be written as the product of an odd number
and a power of 2.

Case 1: n + 1 is odd.
In this case, we have n + 1 = (n + 1) · 20 , which is the product of an odd number and
a power of 2, as desired.
Case 2: n + 1 is even.
By definition of even, there exists a k ∈ Z such that n + 1 = 2k. As n ≥ 1, we have
n+1 1+1
k= ≥ =1
2 2
and
n+1 n+n
k= ≤ = n.
2 2
Since 1 ≤ k ≤ n, we can apply the induction hypothesis to say that k = a · 2b , where
a is an odd number and b ∈ N. Then n + 1 = 2k = 2(a · 2b ) = a · 2b+1 , which is the
product of an odd number and a power of 2.

In both cases, we can write n + 1 as the product of an odd number and a power of 2, which
completes the induction.

You might also like