MATHEMATICAL INDUCTION

BASIC COMPETENCES

3.1 Menjelaskan metode pembuktian Pernyataan matematis berupa barisan, ketidaksamaan,

keterbagiaan dengan induksi matematika.

4.1 Menggunakan metode pembuktian induksi matematika untuk menguji pernyataan

matematis berupa barisan, ketidaksamaan, keterbagiaan.

INDICATORS

3.1.1 Determine the principle of mathematical induction to prove a statement mathematically

in the form of lines.

3.1.2 Determine the principle of mathematical induction to prove a statement mathematical

form of inequality.

3.1.3 Determine the principle of mathematical induction to prove a statement mathematically

in the form of division.

4.1.1 Apply the principle of mathematical induction to prove a statement mathematically in

the form of lines.

4.1.2 Apply the principle of mathematical induction to prove a statement mathematical form
of inequality.

4.1.3 Apply the principle of mathematical induction to prove a statement mathematically in

the form of division
INTRODUCTION TO MATHEMATICAL INDUCTION

Note the illustration below

Figure 1.1 Illustration as many as n objects (boards) arranged with the distance of two
objects that are close together.

• From the illustration in Figure 1.1, which board falls if the board 𝑆1 dropped to 𝑆2 ?

• If there are 100 arrangement of boards follow the pattern as illustrated above, will the board
to the 𝑆100 also fall?

From the illustration above, you can imagine dropping the 𝑆1 board in the direction of 𝑆2 it
must be the end of the board, call the 𝑆𝑛 board (for every 𝑛 natural number), also falls. In
other words, it can be stated that if the 𝑆1 board fell, the 𝑆15 board also fell and the 𝑆𝑛 board
also fell.

Make study groups! Then, think of contextual problems the pattern is similar to the
illustration in Figure 1.1. Describe the results you get in front of your friends.
I. Inductive and Deductive Reasoning

There are two events to make decisions, namely inductive and deductive reasoning.
Reasoning deductive starts from something that applies in general to something special,
whereas Inductive reasoning is just the opposite. With inductive reasoning, students will
arrive at a statement known as a conjecture that is not necessarily true absolute. With
deductive reasoning, the truth obtained is absolute truth. What about mathematical induction,
does it include inductive or deductive reasoning? Let us consider the following examples.

Let us observe

Example 1.1

Note the following statement. Whatever the natural number we are substituting to 𝑛 in the
form 𝑛2 − 𝑛 + 41, then the result is definitely a prime number.

Let us substitute several consecutive natural numbers in the following table.

𝑛 𝑛2 − 𝑛 + 41 Prime/No Prime
1 41 Prime
2 43 Prime
3 47 Prime
4 53 Prime
5 61 Prime
6 71 Prime
7 83 Prime
8 97 Prime
9 113 Prime
10 131 Prime

From the third column above, it appears that all numbers are prime numbers. For us using the
above cases to make decisions, then we can conclude that 𝑛2 − 𝑛 + 41 is a prime number for
whatever the number of 𝑛. The kind of the reasoning is called inductive reasoning.
This kind of reasoning is legitimate, and this often happens in the development of natural
sciences or social sciences. The conclusion is obtained by inductive ways. In mathematics, the
truth of a statement must be absolute. If it is said that 𝑛2 − 𝑛 + 41 is a prime number for
every natural number 𝑛, then this statement must be true for any natural number.
Unfortunately, the statement that 𝑛2 − 𝑛 + 41 is a prime number for every n natural number
is not true. For example, for 𝑛 = 41, then the value of 𝑛2 − 𝑛 + 41 is a number that is
divisible by 41. Therefore, for 𝑛 = 41, the value of 𝑛2 − 𝑛 + 41 is 412 − 41 + 41 = 412
which is obviously not a prime number. It means, conclusions from the results of inductive
reasoning are not always true for all values n. Therefore, it cannot be accepted as truth
absolute mathematically.

Example 1.2
If 𝑝 is a prime number, then we tend to draw conclusions from inductive reasoning that 2𝑝 −
1 is a prime number too. Why?
Try to substitute some numbers.
If 𝑝 = 2, 3, 5, 7, then 2𝑝 − 1 will be 3, 7, 31, 127 which all are prime numbers. However,
when we substitute 𝑝 = 11, the result is 2047 which is not a number prime. Because, 2047
has other factors besides 1 and 2047, that are 23 and 89. Check that 23 × 89 = 2047. Thus,
such general inductive reasoning does not guarantee the obtaining of a statement true for
every natural number.

Example 1.3
Now consider the inequality 𝑛 < 2𝑛 . Is the inequality true for all natural number n?

Let us check the truth of the inequality by substituting the first 10 natural numbers into the
following table.

𝑛 𝑛 < 2𝑛 True/False
1 1 < 21 = 2 True
2 2 < 22 = 4 True