Professional Documents
Culture Documents
A : I will start this material with the definition. Do you know the definition of Mathematical
Induction is? Raise your hand if you know the answer.
B angkat tangan.
A : Okay Zakia
B : Mathematical induction is a standard proof technique in mathematics.
A : Good.
The teacher draw a picture of domino in the blackboard. B buka buku dan menulis.
A : Do you know what is this?
B : Is that domino Miss?
A: Exactly. The principle of mathematical induction has a domino effect.
The teacher explain it with the book.
A : I will explain it using the book. I will arrange this book with a certain distance. Suppose this
book is the dominoes card that arranged very long. What happens if I drop this one to another
like this?
B : All of dominoes card will falling Miss.
A : Good, all of dominoes card will falling. If the dominoes are arranged in a line with a certain
distance, when one end of the domino is dropped towards another domino, then all the dominoes
will fall one by one.
A : Who are know how much the principle of mathematical induction? Raise your hand if you
know the answer.
B angkat tangan.
A : Okay Zakia
B : 2 Miss
A : Good, what is this?
B : Basis step and induction step.
The teacher write it in the blackboard.
A : Excelent. To prove a formula in mathematical induction, we can assume that P (n) is a
natural number expression. Statement P (n) is true if it fulfills the following steps:
a. Basis Step: to prove P (1) is correct.
A : So the basis step is not always chosen for n = 1, n = 2, or n = 3, but any value of n can be
selected. Furthermore, what is found in the basis step is the modal for the next step. That is, if P
(1) is true, then P (2) is true; if P (2) is true then P (3) is true; and so on until it is concluded that
P (k) is correct.
b. Induction Step: if P (k) is true, then P (k + 1) is true, for every k natural numbers.
Using P (k) is correct, it is shown that P (k + 1) is correct.
A : Do you understand? Or do you have any question?
B : I have a question Miss.
A : Okay
B : If the formula only fulfill one step and another step is false, is the formula proven or not
Miss?
A : Good question. If P (n) satisfies both principles of mathematical induction, then the formula
P (n) is proven correct. If either of the two principles is not met, the formula P (n) is wrong. So
the answer for your question is you have to fulfill both of these steps to prove the formula.
B : Thank you, Miss.
A : You are welcome. Anybody has question again?
B : Not yet, Miss.
A : Okay, I will continue to the example. Have you done with it?
Prove that 1 + 3 + 5 + 7 + … + (2n – 1) = n2 for n ≥ 1
Let P(n) = 1 + 3 + 5 + 7 + … + (2n – 1) = n2
a. Basis Step
As a basis, n = 1 is taken because it will prove the truth of the statement for n ≥ 1
(smallest n = 1), so that:
P (n) = n2 ⇔ 2n - 1 = n2
For n = 1 ⇒ 2 ∙ 1 - 1 = 12
⇔1=1
Left segment = Right segment
Thus, the statement is true for n = 1.
So, the basis step is correct.
b. Induction Step
P (k) is true then P (k + 1) is true.
P (k) true means 1 + 3 + 5 + 7 +… + (2k - 1) = k2
For P (k + 1)
1 + 3 + 5 + 7 +… + (2k - 1) = k2
Add 2(k+1) – 1 in both sides
1 + 3 + 5 + 7 +… + (2k - 1) + (2(k+1) – 1) = k2 + 2(k+1) – 1
1 + 3 + 5 + 7 +… + (2k - 1) + (2k + 1) = k2 + 2k +2 – 1
1 + 3 + 5 + 7 +… + (2k - 1) + (2k + 1) = k2 + 2k + 1
So the root of ... is
1 + 3 + 5 + 7 +… + (2k - 1) + (2k + 1) = (k + 1) (k + 1)
1 + 3 + 5 + 7 +… + (2k - 1) + (2k + 1) = (k + 1)2
So the induction step is correct.
Based on steps (1) and (2), it is concluded that P (n) is true for n ≥ 1.
A : It is clear?
B : Clear, Miss.
n3
Prove that 12 + 22 + 32 + . . . + n2 > for n is a real number
3
Solution
2 2 2 n3
2
P(n) = 1 + 2 + 3 + . . . + n >
3
a. Basis step
For n = 3
27
P(3) = 12 + 22 + 32 = 14 >
3
Basis step is correct
b. Langkah Induksi
k3
P(k) = 12 + 22 + 32 + . . . + k2 >
3
For P(k + 1), so
P(k +1) = 12 + 22 + 32 + . . . + (k + 1)2 > ¿ ¿
Add (k + 1)2 in both sides
k3
P(k +1) = 12 + 22 + 32 + . . . + k2 + (k + 1)2 > + (k + 1)2
3
k 3 +3 k 2 +6 k + 3
⇔ P(k +1) = 12 + 22 + 32 + . . . + k2 + (k + 1)2 >
3
(k + 1)3 +3 k +2
⇔ P(k +1) = 12 + 22 + 32 + . . . + k2 + (k + 1)2 >
3
(k + 1)3 3 k 2 +2
2 2 2 2
⇔ P(k +1) = 1 + 2 + 3 + . . . + k + (k + 1) > 2
+
3 3
(k + 1)3 3 k 2 +2
It is true that + > ¿ ¿ for every k is positive integer
3 3
Based on steps (1) and (2), it is concluded that P (n) is true for n is a real number.
B : Yes Miss.
B : Me Miss
A : Yes please
B menulis jawaban di papan tulis