1

Republic of the Philippines

Department of Education
Region I
SCHOOLS DIVISION OFFICE I PANGASINAN
BAYAMBANG NATIONAL HIGH SCHOOL
MAGSAYSAY ST., BAYAMBANG, PANGASINAN

MODULE IN PRECALCULS
School Year : 2020-2021

Module8
Mathematical Induction

What this module is about?

We have derived and used formulas for the terms of arithmetic and geometric
sequences and series. These formulas and many other theorems involving positive integers
can be proven with the use of a technique called mathematical induction.
There are many mathematical results that can be proven using mathematical induction.
In this module, we will focus on three main categories: summation identities, divisibility
statements, and inequalities.

What you are expected to learn?

After studying the lessons in this module, you are expected to:
(1) illustrate the Principle of Mathematical Induction; and
(2) apply mathematical induction in proving identities.

How to learn from this module?

Here is a simple guide for you in going about the module.
1. Read and follow the instructions very carefully.
2. Take the pretest (10-item multiple-choice test) to determine how much you know about the
lessons in the module.
3. Be very honest in taking the test so you know how much knowledge you already have about
the topic.
4. Perform all the activities, as these will help you have a better understanding of the topic.
5. Take the self-tests at the end of each lesson to determine how much you learned about the
lesson.
6. Take the posttest (10-item multiple choice test) to assess how much you learned in this
module.
Have fun in learning these lessons about mathematical induction! Good luck!

What t o d o before (Pretest)?

Multiple Choice : Write the letter of the best answer:
1. It is a method of mathematical proof but does not generate answers.
A. abduction B. deduction C. induction D. reduction
2. The following are steps of mathematical induction EXCEPT
A. base case B. inductive hypothesis C. proof D. recommendations
3. =
A. n(n+1)/2 B. n2 C. n2 + n D. n2 (n+1)2/4
n n
4. 4 - 1: divisible by 3 ; 7 - 1 ; divisible by ____________
A. 3 B. 4 C. 5 D. 6
5. What part of the mathematical induction is the assumption?
A. base case B. inductive hypothesis C. proof D. recommendations
6. Identify the smallest possible value of n in 2 n > 2n
A. 0 B. 1 C. 2 D. 3
7. The sum of the first n odd integers is n
n(n  1)(2n  1)

n n
A.  2i  1  n 2 B.  2i  n 2  n C. =n(n+1)/2 i2  D.
i 1 i 1 6
i 1
 2

8. The following numbers are possible values of n in 5 k -1 is divisible by 4 EXCEPT

A. 0 B. 1 C. 2 D. 3
9. What property of inequality is applied to (2k) > (2k) → 2(2k) > 2(2k) ?
A. addition B. subtraction C. multiplication D. division
10. What law of exponent best illustrates 5k+1 -1 → 5(5k) - 1?
A. product B. power C. power of product D. quotient

Lesson 2.3. Mathematical Induction

Mathematical induction is method of proof . It does not generate answers: it

only can prove them. There are three parts:
1) Base case(s): show it is true for one element,
2) Inductive hypothesis: assume it is true for any given element, and
3) Show that if it is true for the next highest element.

2.3.1. Proving Summation Identities

We first state the Principle of Mathematical Induction, and see how the principle works
in general sense.
The Principle of Mathematical Induction
Let P(n) be a property or statement about an integer n. Suppose that the following
conditions can be proven:
(1) P(n0) is true (that is, the statement is true when n = n0).
(2) If P(k) is true for some integer k > n0, then P(k + 1) is true (that is, if the statement is
true for n = k, then it is also true for n = k + 1).
Then the statement P(n) is true for all integers n > n0.
The Principle of Mathematical Induction is often compared to climbing an infinite
staircase. First, you need to be able to climb up to the first step. Second, if you are on any step
(n = k), you must be able to climb up to the next step (n = k + 1). If you can do these two
things, then you will be able to climb up the infinite staircase.

Another analogy of the Principle of Mathematical Induction that is used is toppling an

infinite line of standing dominoes. You need to give the first domino a push so that it falls down.
Also, the dominoes must be arranged so that if the k th domino falls down, the next domino will
also fall down. These two conditions will ensure that the entire line of dominoes will fall down.
Example 2.3.1. Using mathematical induction, show that the sum of the first n odd
n
integers is n2 .  2i  1  n 2
i 1

Part I. Base case: Part II. Inductive Step:

n=1 n=2 n=k n = k+1
1 2 k k 1

 2(i)  1  1
i 1
2
1  2(i)  1  1  3  2
i 1
2
 2i  1  k
i 1
2
 2i  1  (k  1)
i 1
2
 k 2  2k  1

k
Part III. Proof k 1

 2i  1  2i 1[2(k1)1]k 2k 1

2
( by Extension Rule) i1
i 1
n

Example 2.3.2. Show that  2i  n

i 1
2
n
Part I. Base case: Part II. Inductive Step:
n 1= 1 n=2 n=k n = k+1
2 k k 1
 2(i)  1
i 1
2
1  2  2(i)  2 2
26  2i  k 2
k  2i  (k  1) 2
 (k  1)
i 1 i 1 i 1
Part III. Proof
k 1 k

 2i   2i  2(k  1)
i 1 i 1
= k2 k 2(k 1) (k 1)2 (k 1)
 3

n
n(n  1)(2n  1)
Example 2.3.3. Show  i 
2

i 1 6
Part I. Base case: Part II. Inductive Step:
n=1 n=2 n=k n = k+1
1
1(1  1)(2  1) 2
2(2  1)(4  1) k
k (k  1)(2k  1) k 1
(k 2  3k  2)(2k  3)

i 1
i 
2

6
1 
i 1
i 
2

6
5 
i 1
i2 
6

i 1
i 2 
6

Part III. Proof

k
k(k 1)(2k 1)
  2k 3k  k  6k 12k  6
k 1 3 2 2

 i 2 i  (k  1)
2 2
  (k 1)2 6 6
ii
11 6
2k 3
 9k 2
 13k  6 (k 2  3k  2)(2k  3)
 
6 6

2.3.2. Proving Divisibility Statements

Example 2.3.4.Show that 7n – 1 is divisible by 6 for every nonnegative integer n.

Part I. Base case: Part II. Inductive Step:
n=1 n=k
71 – 1 = 6 Assume that 7k – 1
n=2 n = k+1
72 – 1 = 49-1 = 48 Show that 7k+1 – 1 is also divisible by 6
Part III. Proof:
7k+1 – 1 = 7(7k) – 1 = 6(7k) + 7k – 1 ,
By definition of divisibility, 6 · 7 k is divisible by 6. Also, by the hypothesis (assumption),
7 is divisible by 6. Hence, their sum (which is equal to 7 k+1 - 1) is also divisible by 6.
k+1

Therefore, by the Principle of Math Induction, 7n - 1 is divisible by 6 for all positive integers n.

2.3.3. Proving Inequalities

Example 2.3.5. Use mathematical induction to prove that 2 n > 2n for every integer n > 3.
Part I. Base case: Part II. Inductive Step:
n=1 n=3 n=k n = k+1
21 = 2(1) 23 > 2(3), 8 > 6 2k > 2k 2k+1 > 2(k+1)
Alternative 1 Alternative 2
(2k) > (2k) (2k) > (2k)
k k
2(2 ) > 2(2k) multiplication property of inequality 2 +2> 2k+2 addition property of inequality
k+1
2 > 2k+2k > 2k+2 2k+2k> 2k +2 > 2k+2
k+1
2 > 2(k+1) 2(2k) > 2k+2 > 2k+2
Hence, 2k+1 > 2(k+1)

What will you do?

Self Test 2.3.
Complete the proof.
Using mathematical induction, show that the sum of the first n even
integers is n2 +n , n
 2i  n 2  n
i 1
Part I. Base case: Part II. Inductive Step:
n=1 n=2 n=k n = k+1

Part III. Proof:

 4

Activity 2.3 Prove Me Right!

Most Essential Learning Competency: (1) illustrate the Principle of Mathematical
Induction; and(2) apply mathematical induction in proving identities.
K to 12 BEC CG: STEM_PC11SMI-Ih-4 and STEM_PC11SMI-Ih-i-1

1. Use Mathematical Induction to prove that 5 n – 1 is divisible by 4 for every

nonnegative integer n. (Refer to Example 2.3.4.)
2. Prove that n2 > 2n for every integer n > 5. (Refer to Example 2.3.4.)

Let’s summarize.
Mathematical induction is method of proof . It does not generate
answers: it only can prove them. There are three parts: 1) Base case(s): show it is true for one
element, 2) Inductive hypothesis: assume it is true for any given element, and 3) Show that if it
is true for the next highest element.

Post Test

Multiple Choice : Write the letter of the best answer:

1. It is a method of mathematical proof but does not generate answers.
A. abduction B. deduction C. induction D. reduction
2. Which of the following is the first step of mathematical induction ?
A. base case B. inductive hypothesis C. proof D. recommendations
3. =
A. n(n+1)/2 B. n2 C. n2 + n D. n2 (n+1)2/4
4. 4n - 1: divisible by 3 ; 11n - 6 ; divisible by ____________
A. 3 B. 4 C. 5 D. 7
5. What part of the mathematical induction is the assumption?
A. base case B. inductive hypothesis C. proof D. recommendations
2 n
6. Identify the smallest possible value of n in n > 2
A. 3 B. 4 C. 5 D. 7
7. The sum of the first n even integers is n
n(n  1)(2n  1)

n
A.  2i  1  n B.  2i  n  n
n
2 2 C. =n(n+1)/2 i2  D.
i 1 i 1 6
i 1
8. The following numbers are possible values of n in 5 k -1 is divisible by 4 EXCEPT
A. 0 B. 1 C. 2 D. 3
k k
9. What property of inequality is applied to (2 ) > (2k) → 2 +2> 2k+2?
A. addition B. subtraction C. multiplication D. division
k+1
10. Which of the following is equal NOT to 5 -1 ?
A. 5(5k)-1 B. 4(5k) + 5k -1 C. 3(5k) + 2(5k)-1 D. (5k) + 5k -1

REFERENCES

Bacani, J., Eden, R., Estrada, G., Francisco, F., Vidallo, M. 2016. Teaching Guide for Senior
High School Pre-Calculus Core Subjects. DepEd Commission on Higher Education.
Batucan, Alma Mae G. Precalculus – Grade 11 Alternative Delivery Mode
Ambat, C. , Palma R, Ventura K., Precalculus Activity Sheets, DepEd SDO1
Equation of a Parabola, n. d. Retrieved from https://www.google.com
Pelias, J. 2016. RBS Pre-Calculus. Retrieved from www.rexpublishing.com.ph
 5

Congratulations!!! You have finished Module 8.

Prepared by:

JONATHAN B. DONA
SSMT-I

Checked by:

PAUL JAMES H. CAPACIA

Subject Group Head – STEM III-A

Approved:

ELVIRA P. BERDUL
SSHT VI / OIC

Noted:

VIRGIL R. GOMEZ
Principal IV