Scribd
Upload
48 views21 pages

Discrete Structures: Slides For A Course Based On The Text (6 Edition)

The document discusses mathematical induction, which is a technique for proving that a predicate P(n) is true for all natural numbers n. It involves showing that P(0) is true, and if P(n) is true then P(n+1) is also true. This is known as the "domino effect" or basis step and inductive step. Examples are provided to demonstrate how to structure an inductive proof by showing the basis step, inductive step, and conclusion that P(n) is true for all n. A second principle of strong induction is also introduced.

Uploaded by

Hassan AlAshour
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
48 views21 pages

Discrete Structures: Slides For A Course Based On The Text (6 Edition)

The document discusses mathematical induction, which is a technique for proving that a predicate P(n) is true for all natural numbers n. It involves showing that P(0) is true, and if P(n) is true then P(n+1) is also true. This is known as the "domino effect" or basis step and inductive step. Examples are provided to demonstrate how to structure an inductive proof by showing the basis step, inductive step, and conclusion that P(n) is true for all n. A second principle of strong induction is also introduced.

Uploaded by

Hassan AlAshour
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/ 21

College of Information Technology

Discrete Structures

Slides for a Course Based on the Text


Discrete Mathematics & Its Applications
(6th Edition)

11/9/2008

Inductive Proofs
Rosen 6th ed., 4.1

11/9/2008

4.1: Mathematical Induction


A powerful, rigorous technique for proving
that a predicate P(n) is true for every
natural number n, no matter how large.
Essentially a domino effect principle.
Based on a predicate-logic inference rule:
P(0)
The First Principle
of Mathematical
n0 (P(n)P(n+1))
Induction
n0 P(n)
11/9/2008

The Domino Effect


Premise #1: Domino #0 falls.
Premise #2: For every nN,
if domino #n falls, then so
does domino #n+1.
Conclusion: All of
the dominoes fall
2
down!
1
0
11/9/2008

6
5
4

Note:
this works
even if there
are infinitely
many dominoes!
3

The principle of mathematical induction


is a useful tool for proving that a certain
predicate is true for all natural numbers.
It cannot be used to discover theorems, but
only to prove them.

11/9/2008

If we have a propositional function P(n), and we


want to prove that P(n) is true for any natural
number n, we do the following:

Show that P(0) is true.


(basis step)
Show that if P(n) then P(n + 1) for any nN.
(inductive step)
Then P(n) must be true for any nN.
(conclusion)
11/9/2008

Induction Example

Show that n < 2n for all positive integers n.


Let P(n) be the proposition n < 2n.
1. Show that P(1) is true.
(basis step)
P(1) is true, because 1 < 21 = 2.
11/9/2008

Induction Example 1
2. Show that if P(n) is true, then P(n + 1) is true.
(inductive step)

Assume that n < 2n is true.


We need to show that P(n + 1) is true, i.e.
n + 1 < 2n+1

We start from n < 2n:


n + 1 < 2n + 1 2n + 2n = 2n+1
Therefore, if n < 2n then n + 1 < 2n+1

11/9/2008

Induction Example 1
Then P(n) must be true for any positive
integer.
(conclusion)
n < 2n is true for any positive integer.
End of proof.
11/9/2008

Induction Example 2
1 + 2 + + n = n (n + 1)/2
Show that P(0) is true.
(basis step)
For n = 0 we get 0 = 0. True.

11/9/2008

10

Induction Example 2
Show that if P(n) then P(n + 1) for any nN.
(inductive step)
1 + 2 + + n = n (n + 1)/2
1 + 2 + + n + (n + 1) = n (n + 1)/2 + (n + 1)

= (2n + 2 + n (n + 1))/2

= (2n + 2 + n2 + n)/2

= (2 + 3n + n2 )/2

= (n + 1) (n + 2)/2

= (n + 1) ((n + 1) + 1)/2
11/9/2008

11

Induction Example 2
Then P(n) must be true for any nN.
(conclusion)
1 + 2 + + n = n (n + 1)/2 is true for all
n N.
End of proof.
11/9/2008

12

Outline of an Inductive Proof


Let us say we want to prove n P(n)
Do the base case (or basis step): Prove P(0).
Do the inductive step: Prove n P(n)P(n+1).
E.g. you could use a direct proof, as follows:
Let nN, assume P(n). (inductive hypothesis)
Now, under this assumption, prove P(n+1).

The inductive inference rule then gives us


n P(n).
11/9/2008

13

Induction Example 3
Prove that the sum of the first n odd
positive integers is n2. That is, prove:
n

n 1 : (2i 1) = n

i =1

Proof by induction.

P(n)

Base case: Let n=1. The sum of the first 1 odd


positive integer is 1 which equals 12.
(Cont)
11/9/2008

14

Example 3 cont.
Inductive step: Prove n1: P(n)P(n+1).
Let n1, assume P(n), and prove P(n+1).

n
(2i 1) = (2i 1) + (2(n + 1) 1)

i =1

i =1
By inductive
2
= n + 2n + 1 hypothesis P(n)
n +1

= (n + 1)

11/9/2008

15

Induction Example 4
Prove that 11! + 22! + + nn! = (n+1)! - 1, n
Base case (n= 1): 11! = (1+1)! - 1?
11! = 1, 2! - 1 = 1
Assume P(k): 11! + 22! + + kk! = (k+1)! - 1
Prove that 11! + + kk! + (k+1)(k+1)! = (k+2)! - 1
11! + + kk! + (k+1)(k+1)! = (k+1)! - 1 + (k+1)(k+1)!
= (1 + (k+1))(k+1)! - 1
= (k+2)(k+1)! - 1
= (k+2)! - 1
11/9/2008

16

Second Principle of Induction


A.k.a. Strong Induction
Characterized by another inference rule:
P(0)
n0: (0kn P(k)) P(n+1)
n0: P(n)
The only difference between this and the
1st principle is that:
the inductive step here makes use of the
stronger hypothesis that P(k) is true for all
smaller numbers k<n+1, not just for k=n.
11/9/2008

17

Second Principle of Induction


Show that P(0) is true.
(basis step)
Show that if P(0) and P(1) and and P(n),
then P(n + 1) for any nN.
(inductive step)
Then P(n) must be true for any nN.
(conclusion)
11/9/2008

18

Second Principle of Induction


Example
Example: Show that every integer greater
than 1 can be written as the product of
primes.
Show that P(2) is true.
(basis step)
2 is the product of one prime: itself.
11/9/2008

19

Second Principle of Induction


Example cont.
Show that if P(2) and P(3) and and P(n),
then P(n + 1) for any nN. (inductive step)

Two possible cases:


If (n + 1) is prime, then obviously P(n + 1) is true.
If (n + 1) is composite, it can be written as the product of
two integers a and b such that
2 a b < n + 1.

By the induction hypothesis, both a and b can be


written as the product of primes.

Therefore, n + 1 = ab can be written as the product of


primes.

11/9/2008

20

Second Principle of Induction


Example cont.
Then P(n) must be true for any nN.
(conclusion)
End of proof.
We have shown that every integer greater
than 1 can be written as the product of
primes.
11/9/2008

21

You might also like