Strong Induction EECS 203: Discrete PowerPoint Presentation, PPT - DocSlides

2019-03-15 1K 1 0 0

Description

Mathematics. 1. Mathematical . vs. Strong Induction . To prove that . P. (. n. ) is true for all positive . n. .. Mathematical. induction:. Strong. induction:. 2. Climbing the Ladder (Strongly). We want to show that ∀. ID: 756520

Embed code:

DownloadNote - The PPT/PDF document "Strong Induction EECS 203: Discrete" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Presentations text content in Strong Induction EECS 203: Discrete

Slide1

Strong Induction

EECS 203: Discrete Mathematics

1

Slide2

Mathematical vs Strong Induction

To prove that P(n

) is true for all positive

n

.Mathematical induction:Strong induction:

2

Slide3

We want to show that ∀n≥1 P(n) is true.

Think of the positive integers as a ladder.

1, 2, 3, 4, 5, 6, . . .

You can reach the bottom of the ladder: P(1)Given

all lower steps, you can reach the next.

P(1) → P(2), P(1) ∧

P

(2) →

P(3), . . . ∀k≥1 P(1) ∧ … ∧ P(k) → P(k+1)Then, by strong induction: ∀n≥1 P(n)

3

Slide4

Is Strong Induction Really Stronger?

No. Anything you can prove with strong induction can be proved with regular mathematical induction. And vice versa.

B

oth are equivalent to the

well-ordering property.But strong induction can simplify a proof.How?

Sometimes P(k) is not enough to prove P(k+1).But P(1) ∧ . . . ∧ P(k) is strong enough.

4

Slide5

5

Slide6

Coin problem

What is the largest cent-value that cannot be formed using only 3-cent and 5-cent stamps?(A) 2(B) 4

(

C

) 7(D) 8(E) 116

Slide7

Proof for our Coin problem

Let P(k) = “k cents can be formed using 3-cent and 5-cent stamps.”

Claim

:

∀n≥8 P(n).

Proof by strong induction:Base cases:P

(8): 8 = 3 + 5P(9): 9 = 3 + 3 + 3P(10): 10 = 5 + 5.

7

Slide8

Proof for

our Coin problem

Inductive step:

Let

k

be an integer ≥ 11.

Inductive hypothesis: P(j)

is true when 8 ≤

j < k

.

P

(

k

-3) is true.

Therefore, P(

k

) is true. (Add a 3-cent stamp.)

This completes the inductive step.

8

Inductive hypothesis:

P

(

j

) is true whenever

8

≤ j

<

k.