Discrete Mathematics

LECTURE 24, 25
MATHEMATICAL
INDUCTION
Course Instructor:
1 Rida Memon
Mathematical Induction

 Mathematical induction is a mathematical

proof technique.

 It requires two cases to be proved:

1. The first case, called the BASIS STEP, proves that the
property holds for the number 0.

2. The second case, called the INDUCTION STEP, proves

that, if the property holds for one natural number n, then
it holds for the next natural number n + 1.

2
Mathematical Induction
 These two steps establish the property P(n) for every natural
number n = 0, 1, 2, 3, ...

 The BASIS STEP need not begin with zero.

 Often it begins with the number one, and it can begin with any
natural number, establishing the truth of the property for all natural
numbers greater than or equal to the starting number.

3
Mathematical Induction

 Logically, it can be expressed as:

Basis Step
↓

↑
Induction Step

4
Example: Summations

5
Example: Summations

6
Task 1

7
Task 1

8
Task 2

9
Task 2

10
Task 3

11
Task 3

12
Reading Assignment

 Chapter 5
 Section 5.1
 Page: 311 - 324

13
Thanks

 End of Lecture
 Q/As

14