GEG 115: Engineering ALGEBRA 1

MATHEMATICAL INDUCTION
By

Dr Eganoosi Esme ATOJUNERE

Department of Systems Engineering

University of Lagos
Nigeria
• Mathematical Induction is a mathematical technique which is used to prove a
statement, a formula or a theorem is true for every natural number.
• The technique involves two steps to prove a statement, as stated below −
Step 1(Base step) − It proves that a statement is true for the initial value. Eg, n =
0. The base case does not necessarily begin with n = 0, but often with n = 1, and
possibly with any fixed natural number n = N, establishing the truth of the
statement for all natural numbers n ≥ N.

Step 2(Inductive step) − It proves that if the statement is true for the nth iteration
(or number n), then it is also true for (n+1)th iteration ( or number n+1), k+1
Basis Step: Verify that P(1) is true.
Inductive Step: Show that if P(k) is true for some integer k≥1 , then P(k+1) is
also true.

Verify that P(1) is true.

Assume that P(k) is true for some integer k≥1 .
Show that P(k+1) is also true.
+ ... + n 3 = n 2 (n + 1) 2 / 4
STEP 1: We first show that p (1)
is true.
Problem 4
Problem 5
EXERCISE 1
Prove that for any positive integer number n , n 3 + 2 n is
divisible by 3
EXERCISE 2
Prove that 3 n > n 2 for n = 1, n = 2 and use the
mathematical induction to prove that 3 n > n 2 for n a
positive integer greater than 2.
EXERCISE 3
• Prove that n ! > 2 n for n a positive integer greater than
or equal to 4. (Note: n! is n factorial and is given by 1 *
2 * ...* (n-1)*n.)
4