Xavier D.

Domingo
Math – 29 – D1

1.) Prove the following theorem

For every integer 𝑛 ≥ 5, 2𝑛 > 𝑛2

Mathematical induction:
1.) 𝑛 = 5, 2𝑛 > 𝑛2
2.) Let 𝑛 = 𝑘 be true, means 2𝑘 > 𝑘 2 (𝑘 > 5)

∴ 2𝑘 2 − (𝑘 + 1)2

= 𝑘 2 − 2𝑘 − 1

= (𝑘 − 1)2 − 2 > 0 (𝑘 > 5)

∴ 2𝑘 2 > (𝑘 + 1)2

∴ 2𝐾+1 = 2 . 2𝑘 > 2 𝑘 2 (𝑘 + 1)2

𝑆𝑜, 𝑛 ≥ 5, 2𝑛 > 𝑛 2
 Xavier D. Domingo
Math – 29 – D1

1 1 1
2.) Find a formula for + + ⋯ + (𝑛+1)(𝑛+2) by examining the
2. 3 3. 4
values of this expression for small values of 𝑛 ∈ ℤ. Use Mathematical
induction to prove your conjecture.

1 1 1 1
𝑛=1 = − =
2.3 2 3 6

1 1 1 1 1 1 1
𝑛=2 + = + = = −
2 .3 3 .4 6 12 4 2 4

1 1 1 1 1
Assume that + + ⋯ + (𝑛+1)(𝑛+2) = − holds for 𝑛 = 𝑘
2. 3 3 . 4 2 𝑛+2

1 1 1 1 1
+ + ⋯ + (𝑘+1)(𝑘+2) = − when 𝑛 = 𝑘 + 1
2. 3 3 . 4 2 𝑘+2

1 1 1 1
+ + ⋯+ +
2. 3 3 . 4 (𝑘 + 1)(𝑘 + 2) (𝑘 + 2)(𝑘 + 3)
1 1 1
= − +
2 𝑘 + 2 (𝑘 + 2)(𝑘 + 3)

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

1 1 1 1
= − satisfies formula −
2 𝑘+3 2 𝑛+2

1 1 1 1 1 𝑛
So, for 𝑛 ∈ ℤ + + ⋯ + (𝑛+1)(𝑛+2) = − =
2. 3 3 . 4 2 𝑛+2 2(𝑛+2)
 Xavier D. Domingo
Math – 29 – D1

3.) Disprove the following theorem:

If the product of two integers is positive then their sum is positive

There exist two integers such that their product is positive, and their sum
is negative

−5 × −10 = 50
−5 + (−10) = −15

4.) Disprove the following theorem:

For every 𝜖 > 0, there exist a 𝛿 > 0 such that if ⎸x – 2 ⎸< 𝛿 then ⎸x + 1 ⎸≥ 2

Negation: ∃𝜀 > 𝑜, such that for ∀𝛿 > 0, we have that ⎸x – 2 ⎸< 𝛿 and ⎸x + 1 ⎸ ≥
𝜖
Note: we have that 0 ≤ ⎸x – 2 ⎸ < 𝛿 ∀δ > 0
⎸x – 2 ⎸ = 0 =𝑥=2
⎸x + 1 ⎸ = ⎸2 + 1 ⎸ = 3

Choose 𝜀 = 2 since 3 > 2

Then we have that ∀𝛿 > 0 ⎸x – 2 ⎸< 𝛿 and ⎸x + 1 ⎸ ≥ 2

Additionally,

∴ 𝐼𝑓 ⎸𝑎 ⎸ < 𝑏
∴ ⎸x – 2 ⎸ < 𝛿 [ ]
⟹ −𝑏 < 𝑎 < 𝑏
⟹ −𝛿 < 𝑥 − 2 < 𝛿
⟹2−𝛿 <𝑥 <𝛿+2

∴ ⎸x + 2 ⎸ < 𝜖

⟹ −𝜖 <𝑥+1< 𝜖
⟹ − 𝜖−1<𝑥 < 𝜖−1

The first inequality shows that x is true (+), but the second inequality shows that x
is (-), which is not possible together at a time. Hence, theorem is disproved.
Xavier D. Domingo
Math – 29 – D1