Scribd
Upload
64 views22 pages

Principle of Mathematical Induction

Let's think through this step-by-step: - n2 ≥ 3n - For this to be true, n must be greater than or equal to 3 - When n = 1, n2 = 1 < 3n = 3 - When n = 2, n2 = 4 < 3n = 6 - The statement is true only when n ≥ 3 The correct option is C, as the statement n2 ≥ 3n is true for all natural numbers n that are greater than or equal to 3. The statement is not true for all natural numbers in N (option A) or for all natural numbers greater than 1 (option B). It is also not limited to only odd natural numbers

Uploaded by

Asmi John
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
64 views22 pages

Principle of Mathematical Induction

Let's think through this step-by-step: - n2 ≥ 3n - For this to be true, n must be greater than or equal to 3 - When n = 1, n2 = 1 < 3n = 3 - When n = 2, n2 = 4 < 3n = 6 - The statement is true only when n ≥ 3 The correct option is C, as the statement n2 ≥ 3n is true for all natural numbers n that are greater than or equal to 3. The statement is not true for all natural numbers in N (option A) or for all natural numbers greater than 1 (option B). It is also not limited to only odd natural numbers

Uploaded by

Asmi John
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

Welcome to

Principles of Mathematical Induction


𝑛 𝑛+1
∑𝑛 = 1 + 2 + 3 + ⋯ + 𝑛 =
2

𝑛(𝑛+1)(2𝑛+1)
∑𝑛2 = 12 + 22 + 32 + ⋯ + 𝑛2 =
6
Key Takeaways

Mathematical Induction:

• Mathematical Induction is a technique which is used to prove a


mathematical statement, a formula or a theorem valid for every
natural number starting from some initial value.

• Suppose there is a given statement 𝑃(𝑛) involving natural number 𝑛.


• To prove the statement, we follow these two steps:
Key Takeaways

𝑖 BASE STEP (Basis):

Prove that statement is true for initial value of 𝑛.

𝑖𝑖 INDUCTIVE STEP:

Prove that if the statement is true for 𝑛 = 𝑘

(where 𝑘 is positive integer greater than the initial value)

then the statement is also true for 𝑛 = 𝑘 + 1

i.e. truth of 𝑃(𝑘) implies truth of 𝑃 𝑘 + 1 .

Then, 𝑃 𝑛 is true for all naturals numbers given in the statement.


Prove using principle of mathematical induction for all 𝑛 ∈ ℕ.
𝑛 𝑛+1
1 + 2 + 3 + ⋯+ 𝑛 =
2

Let the given statement is 𝑃 𝑛 , i.e.


𝑛 𝑛+1
𝑃 𝑛 = 1+2 +3 +⋯+𝑛 =
2

For 𝑛 = 1,
1 2
𝑃 1 =1= = 1 which is true
2

Assume that 𝑃(𝑘) is true for some positive integer 𝑘, i.e.


𝑘 𝑘+1
𝑃 𝑘 = 1 + 2 + 3 + ⋯+ 𝑘 = ⋯ (𝑖)
2
Prove using principle of mathematical induction for all 𝑛 ∈ ℕ.
𝑛 𝑛+1
1 + 2 + 3 + ⋯+ 𝑛 =
2

𝑛 𝑛+1
𝑃 𝑛 = 1+2 +3 +⋯+𝑛 =
2

𝑘 𝑘+1
𝑃 𝑘 = 1 + 2 + 3 + ⋯+ 𝑘 = ⋯ (𝑖)
2

Now, prove that 𝑃 𝑘 + 1 is also true

1+2 +3 +⋯+𝑘 + 𝑘 +1
𝑘 𝑘+1 𝑘 𝑘+1 𝑘+2
= + 𝑘+1 = 𝑘+1 +1 =
2 2 2

Thus, 𝑃(𝑘 + 1) is true, whenever 𝑃 𝑘 is true.

Hence, statement 𝑃 𝑛 is true for all natural numbers 𝑛.


Prove using principle of mathematical induction for all 𝑛 ∈ ℕ.
𝑛(𝑛+1)(2𝑛+1)
12 + 22 + 32 + ⋯ + 𝑛 2 =
6

Let the given statement is 𝑃 𝑛 , i.e.


𝑛(𝑛+1)(2𝑛+1)
𝑃 𝑛 = 12 + 22 + 32 + ⋯ + 𝑛 2 =
6

For 𝑛 = 1,
1 2 (3)
𝑃 1 =1= = 1 which is true
6

Assume that 𝑃(𝑘) is true for some positive integer 𝑘, i.e.


𝑘 𝑘+1 2𝑘+1
𝑃 𝑘 = 12 + 22 + 32 + ⋯ + 𝑘 2 = ⋯ (𝑖)
6
Prove using principle of mathematical induction for all 𝑛 ∈ ℕ.
𝑛(𝑛+1)(2𝑛+1)
12 + 22 + 32 + ⋯ + 𝑛 2 =
6

𝑘 𝑘+1 2𝑘+1
𝑃 𝑘 = 12 + 22 + 32 + ⋯ + 𝑘 2 = ⋯ (𝑖)
6

Now, prove that 𝑃 𝑘 + 1 is also true


12 + 22 + 32 + ⋯ + 𝑘 2 + 𝑘 + 1 2

𝑘(𝑘+1)(2𝑘+1) 2
= + 𝑘+1
6
𝑘 2𝑘+1 𝑘+1 𝑘+2 2𝑘+3
= 𝑘+1 + 𝑘+1 =
6 6

Thus, 𝑃(𝑘 + 1) is true, whenever 𝑃 𝑘 is true.

Hence, statement 𝑃 𝑛 is true for all natural numbers 𝑛.


Prove using principle of mathematical induction for all 𝑛 ∈ ℕ.
1 1 1 1 1
+ + + ⋯+ 𝑛 = 1 − 𝑛
2 4 8 2 2

Let the given statement is 𝑃 𝑛 , i.e.


1 1 1 1 1
𝑃 𝑛 = + + +⋯+ =1−
2 4 8 2𝑛 2𝑛
1 1 1
For 𝑛 = 1, 𝑃 1 = = 1 − = which is true
2 2 2

Assume that 𝑃(𝑘) is true for some positive integer 𝑘, i.e.


1 1 1 1 1
𝑃 𝑘 = + + + ⋯+ =1− ⋯ (𝑖)
2 4 8 2𝑘 2𝑘

Now, prove that 𝑃 𝑘 + 1 is also true


1 1 1 1 1
+ + +⋯+ +
2 4 8 2𝑘 2𝑘+1

1 1 1
=1− + =1−
2𝑘 2𝑘+1 2𝑘+1

Thus, 𝑃(𝑘 + 1) is true, whenever 𝑃 𝑘 is true.

Hence, statement 𝑃 𝑛 is true for all natural numbers 𝑛.


Prove using principle of mathematical induction for all 𝑛 ∈ ℕ.
1 1 1 1 𝑛
+ + + ⋯+ =
2⋅5 5⋅8 8⋅11 3𝑛−1 3𝑛+2 6𝑛+4

Let the given statement is 𝑃 𝑛 , i.e.


1 1 1 1 𝑛
𝑃 𝑛 = + + +⋯+ =
2⋅5 5⋅8 8⋅11 3𝑛−1 3𝑛+2 6𝑛+4

For 𝑛 = 1,
1 1 1
𝑃 1 = = = which is true
2⋅5 10 6+4

Assume that 𝑃(𝑘) is true for some positive integer 𝑘, i.e.


1 1 1 1 𝑘
𝑃 𝑘 = + + +⋯+ = ⋯ (𝑖)
2⋅5 5⋅8 8⋅11 3𝑘−1 3𝑘+2 6𝑘+4
Prove using principle of mathematical induction for all 𝑛 ∈ ℕ.
1 1 1 1 𝑛
+ + + ⋯+ =
2⋅5 5⋅8 8⋅11 3𝑛−1 3𝑛+2 6𝑛+4

Now, prove that 𝑃 𝑘 + 1 is also true


1 1 1 1 1
+ + + ⋯+ +
2⋅5 5⋅8 8⋅11 3𝑘−1 3𝑘+2 3𝑘+2 3𝑘+5

𝑘 1
= +
6𝑘+4 3𝑘+2 3𝑘+5

1 𝑘 1 𝑘+1 3𝑘+2 𝑘+1


= + = =
3𝑘+2 2 3𝑘+5 2 3𝑘+2 3𝑘+5 6𝑘+10

Thus, 𝑃(𝑘 + 1) is true, whenever 𝑃 𝑘 is true.

Hence, statement 𝑃 𝑛 is true for all natural numbers 𝑛.


For every positive integer 𝑛, prove that 32𝑛+2 − 8𝑛 − 9 is divisible by 8.

Let the given statement is 𝑃 𝑛 , i.e.

𝑃 𝑛 : 32𝑛+2 − 8𝑛 − 9 is divisible by 8

For 𝑛 = 1,

𝑃 1 = 81 − 17 = 64 (64 is divisible by 8) which is true

Assume that 𝑃(𝑘) is true for some positive integer 𝑘 , i.e.

𝑃 𝑘 : 32𝑘+2 − 8𝑘 − 9 is divisible by 8

i.e. 32𝑘+2 − 8𝑘 − 9 = 8𝜆, 𝜆 ∈ ℕ ⋯ (𝑖)


For every positive integer 𝑛, prove that 32𝑛+2 − 8𝑛 − 9 is divisible by 8.

Now, prove that 𝑃 𝑘 + 1 is also true


𝑃 𝑘 : 32𝑘+2 − 8𝑘 − 9 = 8𝜆, 𝜆 ∈ ℕ
32 𝑘+1 +2 − 8 𝑘 + 1 − 9

= 9 ⋅ 32𝑘+2 − 8𝑘 − 9 − 8

= 32𝑘+2 + 8 ⋅ 32𝑘+2 − 8𝑘 − 9 − 8

= 32𝑘+2 − 8𝑘 − 9 + 8 ⋅ 32𝑘+2 − 8

= 8𝜆 + 8(32𝑘+2 − 1) is divisible by 8

Thus, 𝑃(𝑘 + 1) is true, whenever 𝑃 𝑘 is true.

Hence, statement 𝑃 𝑛 is true for all natural numbers 𝑛.


For every positive integer 𝑛, prove that 𝑥 2𝑛 − 𝑦 2𝑛 is divisible by 𝑥 + 𝑦.

Let the given statement is 𝑃 𝑛 , i.e.


𝑃 𝑛 : 𝑥 2𝑛 − 𝑦 2𝑛 is divisible by 𝑥 + 𝑦

For 𝑛 = 1,
𝑃 1 = 𝑥 2 − 𝑦 2 = 𝑥 − 𝑦 𝑥 + 𝑦 is divisible by 𝑥 + 𝑦 which is true

Assume that 𝑃(𝑘) is true for some positive integer 𝑘, i.e.


𝑃 𝑘 : 𝑥 2𝑘 − 𝑦 2𝑘 is divisible by 𝑥 + 𝑦
i.e. 𝑥 2𝑘 − 𝑦 2𝑘 = 𝜆 𝑥 + 𝑦 , 𝜆 ∈ ℕ ⋯ (𝑖)
For every positive integer 𝑛, prove that 𝑥 2𝑛 − 𝑦 2𝑛 is divisible by 𝑥 + 𝑦.

Now, prove that 𝑃 𝑘 + 1 is also true

𝑥 2 𝑘+1 − 𝑦 2 𝑘+1

= 𝑥 2 ⋅ 𝑥 2𝑘 − 𝑥 2 ⋅ 𝑦 2𝑘 + 𝑥 2 ⋅ 𝑦 2𝑘 − 𝑦 2 ⋅ 𝑦 2𝑘

= 𝑥 2 𝑥 2𝑘 − 𝑦 2𝑘 + 𝑦 2𝑘 𝑥 2 − 𝑦 2

= 𝜆 𝑥 + 𝑦 𝑥 2 + 𝑦 2𝑘 𝑥 2 − 𝑦 2

= 𝑥+𝑦 𝜆𝑥 2 + 𝑦 2𝑘 𝑥 − 𝑦

Thus, 𝑃(𝑘 + 1) is true, whenever 𝑃 𝑘 is true.

Hence, statement 𝑃 𝑛 is true for all natural numbers 𝑛.


For every positive integer 𝑛, prove that 2𝑛 > 𝑛.

Let the given statement is 𝑃 𝑛 , i.e.


𝑃 𝑛 : 2𝑛 > 𝑛
For 𝑛 = 1, 𝑃 1 = 2 > 1 , which is true
Assume that 𝑃(𝑘) is true for some positive integer 𝑘, i.e.
𝑃 𝑘 : 2𝑘 > 𝑘
Now, prove that 𝑃 𝑘 + 1 is also true
2𝑘 > 𝑘, multiplying both sides by 2
⇒ 2𝑘+1 > 2𝑘
⇒ 2𝑘+1 > 𝑘 + 𝑘
⇒ 2𝑘+1 > 𝑘 + 1
Thus, 𝑃(𝑘 + 1) is true, whenever 𝑃 𝑘 is true.
Hence, statement 𝑃 𝑛 is true for all natural numbers 𝑛.
Statement: 𝑝(𝑛): 𝑛2 ≥ 3𝑛 is true, then which of the following is correct ?

A ∀𝑛 ∈ ℕ

B ∀𝑛 ∈ ℕ, 𝑛 > 1

C ∀𝑛 ∈ ℕ, 𝑛 ≥ 3

D For all odd natural


numbers 𝑛
Statement: 𝑝(𝑛): 𝑛2 ≥ 3𝑛 is true, then which of the following is correct ?

𝑝 1 : 1 ≥ 3 is not true.
𝑝 2 : 4 ≥ 6 is not true.
𝑝 3 : 9 ≥ 9 is true.
𝑝 4 : 16 ≥ 12 is true.
𝑝 5 : 25 ≥ 15 is true.
By the principle of mathematical induction as shown below that 𝑝(𝑛) is true ∀ 𝑛 ≥ 3
Suppose 𝑝 𝑘 : 𝑘 2 ≥ 3𝑘, 𝑘 ≥ 3 is true
We have to prove that 𝑝 𝑘 + 1 : 𝑘 + 1 2
≥3 𝑘+1
Here 𝑘 + 1 2
= 𝑘 2 + 2𝑘 + 1
𝑘+1 2
≥ 3𝑘 + 2𝑘 + 1 (As 𝑘 ≥ 3, So 2𝑘 + 1 ≥ 3)
Statement: 𝑝(𝑛): 𝑛2 ≥ 3𝑛 is true, then which of the following is correct ?

Here 𝑘 + 1 2
= 𝑘 2 + 2𝑘 + 1

𝑘+1 2
≥ 3𝑘 + 2𝑘 + 1 (As 𝑘 ≥ 3, So 2𝑘 + 1 ≥ 3)

Since, 𝑘 + 1 2
≥ 3𝑘 + 3 = 3 𝑘 + 1
2
𝑘+1 ≥3 𝑘+1

𝑝 𝑘 + 1 is true.

Hence, By the principle of mathematical induction 𝑝 𝑛 : 𝑛2 ≥ 3𝑛; ∀ 𝑛 ∈ ℕ, 𝑛 ≥ 3 is true


Statement: 𝑝(𝑛): 𝑛2 ≥ 3𝑛 is true, then which of the following is correct ?

A ∀𝑛 ∈ ℕ

B ∀𝑛 ∈ ℕ, 𝑛 > 1

C ∀𝑛 ∈ ℕ, 𝑛 ≥ 3

D For all odd natural


numbers 𝑛
Mathematical Induction:
• Mathematical Induction is a technique which is used to prove a
mathematical statement, a formula or a theorem valid for every
natural number starting from some initial value.

𝑖 BASE STEP (Basis):

• Prove that statement is true for initial value of 𝑛.


𝑖𝑖 INDUCTIVE STEP:
• Prove that if the statement is true for 𝑛 = 𝑘 (where 𝑘 is positive integer)
• With the above assumption, prove that the statement is also true for
𝑛 = 𝑘 + 1 i.e. truth of 𝑃(𝑘) implies truth of 𝑃 𝑘 + 1 .

• Then conclude, by Principle of Mathematical Induction(PMI) that 𝑃 𝑛


is true for all naturals numbers given in the statement.
THANK
YOU

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy