Mathematical Induction

Discrete Structures 1
Lecture 6

Discrete Mathematics and Its Applications by

em.parac@gmail.com Kenneth H. Rosen 1
Applications of Mathematical Induction

 Mathematical induction is used extensively to

prove results about a large variety of discrete
objects.
 For example, it is used to prove results about
the complexity of algorithms, the correctness
of certain types of computer programs,
theorems about graphs and trees, as well as
a wide range of identities and inequalities.

Discrete Mathematics and Its Applications by

em.parac@gmail.com Kenneth H. Rosen 2
Principle of Mathematical Induction

 Mathematical induction is used to prove

propositions of the form n P(n), where the
universe of discourse is the set of positive
integers.
 A proof by mathematical induction that P(n) is
true for every positive integer n consists of
two steps:
 BASIS STEP: The proposition P(1) is shown to be
true.
 INDUCTIVE STEP: The implication P(k)P(k+1)
is shown to be true for every positive integer k.
Discrete Mathematics and Its Applications by
em.parac@gmail.com Kenneth H. Rosen 3
Principle of Mathematical Induction

 The statement P(k) for a fixed positive integer

k is called the inductive hypothesis.
 When we complete the two steps of proof by
mathematical induction, we have proved that
P(n) is true for all positive integers n; that is,
we have shown that n P(n) is true.
 Expressed as a rule of inference, this proof
technique can be stated as
 [P(1)  k (P(k)  P(k+1))]  n P(n).
Discrete Mathematics and Its Applications by
em.parac@gmail.com Kenneth H. Rosen 4
 Remark: In a proof by mathematical induction
it is not assumed that P(k) is true for all
positive integers! It is only shown that if it is
assumed that P(k) is true, then P(k+1) is also
true.

Discrete Mathematics and Its Applications by

em.parac@gmail.com Kenneth H. Rosen 5
 Example

 Prove by mathematical induction that

A. The sum of the first n positive integers is equal to

n(n+1)/2.

B. The sum of the first n odd positive integers is n2:

1+3+5+…+(2n-1) = n2

C. The sum of the squares of the first n positive integers

is equal to n(n+1)(2n+1)/6:
12+22+32+…+n2 = n(n  1)(2n  1)
6
Discrete Mathematics and Its Applications by
em.parac@gmail.com Kenneth H. Rosen 6