Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
79 views2 pages

Discrete Math Lesson 2

1. This document uses mathematical induction to prove 5 statements for all positive integers n. It shows the base case of n=1 and inductive step of n=k+1 for each statement. The 5 statements proved are: 1) 1 + 3 + 5 + ...+ (2n-1) = n2, 2) 4n − 1 is evenly divisible by 3, 3) 1 + 5 + 9 + . . . + (4n – 3) = n(2n – 1), 4) 1 1 1 1 n 1 .2 + 2 .3 + 3 .4 +. . . + n(n+1) = n+1, and 5)

Uploaded by

Vinci Van Montiel
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
79 views2 pages

Discrete Math Lesson 2

1. This document uses mathematical induction to prove 5 statements for all positive integers n. It shows the base case of n=1 and inductive step of n=k+1 for each statement. The 5 statements proved are: 1) 1 + 3 + 5 + ...+ (2n-1) = n2, 2) 4n − 1 is evenly divisible by 3, 3) 1 + 5 + 9 + . . . + (4n – 3) = n(2n – 1), 4) 1 1 1 1 n 1 .2 + 2 .3 + 3 .4 +. . . + n(n+1) = n+1, and 5)

Uploaded by

Vinci Van Montiel
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/ 2

Name: Vinci Van O.

Montiel Course: BSIS – II – A


Subject: Discrete Mathematics Time: 2:30 – 4:00 PM

Assessment of Mathematical Induction

Use the Principle of Mathematical Induction to prove that the statement holds for all positive
integers. (5 points each)
1. 1 + 3 + 5 + …+ (2n-1) = 𝒏𝟐
In order to prove the statement is true, first, we have to show the solution in a basis form. Thus;
n=1,
1 + 3 + 5 + …+ (2(1)-1) = 12
1 + 3 + 5 + …+ (1) = 1 //since it is equal to one, therefore it is true.

And now, we will prove it by using induction step.

Assume that n = k show true n = k + 1

1 + 3 + 5 + …+ (2k - 1) = 𝑘 2 //adding 2k + 1 both sides


1+3+5+⋯+(2k−1) + (2k+1) = 𝑘 2 + (2k+1) = (k + 1)2
(2k – 1) + 2k + 1) = 𝑘 2 + (2k + 1) = (k + 1) (k + 1)
Eliminate = 𝑘 2 + (2k + 1) = (k + 1) (k + 1)
𝑘 2 + (2k + 1) = 𝒌𝟐 + 2k + 1 we obtained that by using FOIL method from this
 the result is true for n = k + 1. The statement holds the positive integers.

2. 𝟒𝒏 − 𝟏 is evenly divisible by 3 for all positive integers n.


Base case n = 1;
41 − 1 = 4 – 1 = 3 //true
Inductive Step n=k+1

4𝑘+1 − 1 = 4 * 4𝑘 – 1 = 4𝑘 – 1 + 3 * 4𝑘
𝟒𝒌+𝟏 − 𝟏 = 𝟒𝒌 – 1 + 3 * 4𝑘 // the result is true for n = k + 1. The statement
holds the positive integers

3. 1 + 5 + 9 + . . . + (4n – 3) = n(2n – 1)

Base case n = 1;

(4(1) – 3) = 1 (2(1) – 1) = 1 = 1 (1) = 1 = 1 //true

Inductive Step n=k+1

(4k- 3) + [4(k+ 1) – 3] = 𝟐𝒌𝟐 -k+4k+ 4-3


(4k- 3) + (4k – 3) = 𝟐𝒌𝟐 + 3k + 1
= (k + 1) (2k + 1)
= (k + 1) [2 (k + 1) – 1] = 1 // it proves that n = k + 1. It holds positive integer.
Name: Vinci Van O. Montiel Course: BSIS – II – A
Subject: Discrete Mathematics Time: 2:30 – 4:00 PM
1 1 1 1 𝑛
4. 1 .2
+ 2 .3 + 3 .4 +. . . + 𝑛(𝑛+1) = 𝑛+1

Base case n = 1;
1 1 𝟏 𝟏
1(1+1)
= 1+1
=𝟐= 𝟐
// true

Inductive Step n=k+1


1 𝑘 1 1 𝑘 1
𝑘(𝑘+1)
= 𝑘+1
= 𝑘(𝑘+1) + (𝑘+1)+(𝑘+2)
= 𝑘+1 + (𝑘+1)+(𝑘+2)

𝑘 (𝑘+2)+1
= (𝑘+1)(𝑘+2)

𝑘 2 +2𝑘+1
=
(𝑘+1)+(𝑘+2)

(𝑘+1)2
= (𝑘+1)+(𝑘+2)

𝑘+1
=
𝑘+2

 it proves that n = k + 1. The statement holds the positive integers.

5. 2 + 4 + 6 + . . . + 2n = 𝑛2 + 𝑛

Base case n = 1;
2(1) = 11 + 1 = 2 = 2
Inductive Step n=k+1

2(k + 1) = 𝑘 2 + k + 2(k + 1)
= 𝑘 2 + k +2k +2
= 𝑘 2 + 2k + 1 + k + 1
= (𝑘 + 1)2 + (k + 1)
= (k + 1) (k + 2)
 it proves that n = k + 1. The statement holds the positive integers.

You might also like