3.3.1
Mathematical Induction
basis assertion
conditional assertion
conclusion
basis assertion
conditional assertion
conditional assertion
conclusion
Chapter 3
3.3.2
MATHEMATICAL REASONING
induction hypothesis
(n)
and
0
n+1
imply
Coursenotes by Prof.
Section 3.3
3.3.3
Mathematical Induction
k
(k) (2j 1) = k 2
j=1
Chapter 3
3.3.4
MATHEMATICAL REASONING
k
Basis Step. (2j 1) = k 2 when k = 0
j=1
k
Ind Hyp. (2j 1) = k 2 when k = n
j=1
(2j 1) =
j=1
n
j=1
n
(2j 1) + [2(n + 1) 1]
(2j 1) + 2n + 1
j=1
= n2 + 2n + 1 by ind. hyp.
= (n + 1)2 by factoring
Why is induction important to CS majors?
It is the method used to prove that a loop or a
recursively dened function correctly calculates
the intended result. (just for a start)
Coursenotes by Prof.
Section 3.3
3.3.5
Mathematical Induction
Coursenotes by Prof.
Chapter 3
3.3.6
MATHEMATICAL REASONING
k
k(k + 1)
.
Proposition 3.3.1.
j=
2
j=1
Basis Step.
k
j=
j=1
01
k(k + 1)
=
when k = 0.
2
2
k
k(k + 1)
Ind Hyp.
j=
when k = n.
2
j=1
Ind. Step.
n+1
j=1
n
+ (n + 1)
j=1
=
=
=
=
=
Coursenotes by Prof.
n(n + 1)
+ (n + 1) by ind hyp
2
n(n + 1) 2(n + 1)
+
by arithmetic
2
2
n(n + 1) + 2(n + 1)
by arithmetic
2
(n + 2)(n + 1)
distrib in numerator
2
(n + 1)(n + 2)
commutativity
2
Jonathan L. Gross for use with Rosen:
Section 3.3
3.3.7
Mathematical Induction
Coursenotes by Prof.
Chapter 3
3.3.8
MATHEMATICAL REASONING
basis premise
ind prem
conclusion
Coursenotes by Prof.
basis premise
ind prem
conclusion
Section 3.3
3.3.9
Mathematical Induction
Coursenotes by Prof.
Chapter 3
3.3.10
MATHEMATICAL REASONING
Example 3.3.4:
arithmetic
= 2k + 2k
arithmetic
> k2 + k2
ind. hyp.
> k 2 + (2k + 1)
= (k + 1)2
by Example 3.3.3
arithmetic
Section 3.3
3.3.11
Mathematical Induction
conclusion
Coursenotes by Prof.
Chapter 3
3.3.12
MATHEMATICAL REASONING
Mind-Benders re Induction
1. 2/3 ancestry
2. All solid billiard balls are the same color.
3. Everyone is essentially bald.
Coursenotes by Prof.