First-year undergraduate Students in the Department of Common

Education in Sciences and Technology

Solutions of Tutorial 1

Solution of exercise 1:

We prove the equivalence (𝑝𝑝 ⟹ 𝑞𝑞) ⟺ (𝑞𝑞� ⟹ 𝑝𝑝̅ ) by drawing the truth table:

𝒑𝒑 𝒒𝒒 �
𝒑𝒑 �
𝒒𝒒 𝒑𝒑 ⟹ 𝒒𝒒 � ⟹ 𝒑𝒑
𝒒𝒒 � (𝒑𝒑 ⟹ 𝒒𝒒) ⟺ (𝒒𝒒
� ⟹ 𝒑𝒑
�)
1 1 0 0 1 1 1
1 0 0 1 0 0 1
0 1 1 0 1 1 1
0 0 1 1 1 1 1

Solution of exercise 2: Write the following proposition with quantifiers

(∃ , ∀) and give the negation of each proposition:

ra
1) 𝑓𝑓 is an increasing function in ℝ ‫داﻟﺔ ﻣﺗزاﯾدة‬

ni
∀𝑥𝑥1 , 𝑥𝑥2 ∈ ℝ: 𝑥𝑥1 < 𝑥𝑥2 ⟹ 𝑓𝑓(𝑥𝑥1 ) ≤ 𝑓𝑓(𝑥𝑥2 )
ou
Negation: 𝑓𝑓 is a non-increasing function in ℝ ‫ﻟﯾﺳت داﻟﺔ ﻣﺗزاﯾدة‬.
M
∃𝑥𝑥1 , 𝑥𝑥2 ∈ ℝ: (𝑥𝑥1 < 𝑥𝑥2 ) ∧ (𝑓𝑓(𝑥𝑥1 ) > 𝑓𝑓(𝑥𝑥2 ))
2) 𝑓𝑓 is a decreasing function in ℝ ‫داﻟﺔ ﻣﺗﻧﺎﻗﺻﺔ‬
IA

∀𝑥𝑥1 , 𝑥𝑥2 ∈ ℝ: 𝑥𝑥1 < 𝑥𝑥2 ⟹ 𝑓𝑓(𝑥𝑥1 ) ≥ 𝑓𝑓(𝑥𝑥2 )

M

Negation: 𝑓𝑓 is a non- decreasing function in ℝ ‫ﻟﯾﺳت داﻟﺔ ﻣﺗﻧﺎﻗﺻﺔ‬

ES

∃𝑥𝑥1 , 𝑥𝑥2 ∈ ℝ: (𝑥𝑥1 < 𝑥𝑥2 ) ∧ (𝑓𝑓(𝑥𝑥1 ) < 𝑓𝑓(𝑥𝑥2 ))

3) 𝑓𝑓 is bounded function on ℝ. ‫داﻟﺔ ﻣﺣدودة‬
rK

∃𝑀𝑀 ∈ ℝ∗+, ∀ 𝑥𝑥 ∈ ℝ ∶ |𝑓𝑓(𝑥𝑥)| ≤ 𝑀𝑀 or ∃𝑎𝑎, 𝑏𝑏 ∈ ℝ, ∀ 𝑥𝑥 ∈ ℝ ∶ 𝑎𝑎 ≤ 𝑓𝑓(𝑥𝑥) ≤ 𝑏𝑏

Negation: 𝑓𝑓 is unbounded function on ℝ :
D

∀𝑀𝑀 ∈ ℝ∗+, ∃ 𝑥𝑥 ∈ ℝ ∶ |𝑓𝑓(𝑥𝑥)| > 𝑀𝑀 or ∀𝑎𝑎, 𝑏𝑏 ∈ ℝ, ∃ 𝑥𝑥 ∈ ℝ ∶ 𝑎𝑎 > 𝑓𝑓(𝑥𝑥) > 𝑏𝑏

4) 𝑓𝑓 is a zero function in ℝ: ∀𝑥𝑥 ∈ ℝ, 𝑓𝑓(𝑥𝑥) = 0

Negation: ∃𝑥𝑥 ∈ ℝ, 𝑓𝑓(𝑥𝑥) ≠ 0

5) A function 𝑓𝑓 has Zeros in ℝ: ∃𝑥𝑥 ∈ ℝ, 𝑓𝑓(𝑥𝑥) = 0

Negation: non-zero function ∀𝑥𝑥 ∈ ℝ, 𝑓𝑓(𝑥𝑥) ≠ 0

6) 𝑓𝑓 is an even function on ℝ : ∀𝑥𝑥 ∈ ℝ, ∃ − 𝑥𝑥 ∈ ℝ, 𝑓𝑓(−𝑥𝑥) = 𝑓𝑓(𝑥𝑥)

Negation: ∃𝑥𝑥 ∈ ℝ, ∀ − 𝑥𝑥 ∈ ℝ, 𝑓𝑓(−𝑥𝑥) ≠ 𝑓𝑓(𝑥𝑥)

Students are expected to be familiar with the content of the lectures of Mathematics I before each
tutorial sessions -----By Dr. Kesmia Mounira Page 1
 First-year undergraduate Students in the Department of Common
Education in Sciences and Technology

7) 𝑓𝑓 is an odd function on ℝ: ∀𝑥𝑥 ∈ ℝ, ∃ − 𝑥𝑥 ∈ ℝ, 𝑓𝑓(−𝑥𝑥) = −𝑓𝑓(𝑥𝑥)

Negation: ∃𝑥𝑥 ∈ ℝ, ∀ − 𝑥𝑥 ∈ ℝ, 𝑓𝑓(−𝑥𝑥) ≠ −𝑓𝑓(𝑥𝑥)

8) 𝑓𝑓 is a periodic function on ℝ: ∃𝑝𝑝 ∈ ℝ, ∀𝑥𝑥 ∈ ℝ: 𝑓𝑓(𝑥𝑥 + 𝑝𝑝) = 𝑓𝑓(𝑥𝑥)

Negation: ∀𝑝𝑝 ∈ ℝ, ∃𝑥𝑥 ∈ ℝ: 𝑓𝑓(𝑥𝑥 + 𝑝𝑝) ≠ 𝑓𝑓(𝑥𝑥)

Solution of exercise 3: By the Counter-example proof, show that the

following statement is false:

∀𝑥𝑥, 𝑦𝑦, 𝑧𝑧, 𝑡𝑡 ∈ ℝ ∶ (𝑥𝑥 ≤ 𝑦𝑦 ∧ 𝑧𝑧 ≤ 𝑡𝑡) ⟹ (𝑥𝑥 − 𝑧𝑧 ≤ 𝑦𝑦 − 𝑡𝑡)

Counter-example:

ra
∃𝑥𝑥 = 3, 𝑦𝑦 = 8, 𝑧𝑧 = −2, 𝑡𝑡 = 5 ∈ ℝ:

ni
(3 ≤ 8 ∧ −2 ≤ 5) ⟹ �3 − (−2)� ≤ 8 − 5)
ou
⟹ 5 ≤ 3 contradiction.

So the given statement is false.

M

Solution of exercise 4: Prove the following inequality by the Induction

IA

proof: 𝑃𝑃(𝑛𝑛): ∀𝑛𝑛 ∈ ℕ: ∀𝑥𝑥 > 0, (1 + 𝑥𝑥)𝑛𝑛 ≥ 1 + 𝑛𝑛𝑛𝑛

M

It suffices to prove it in two steps:

ES

1) 𝑃𝑃(1) is true for 𝑛𝑛 = 1

∀𝑥𝑥 > 0, (1 + 𝑥𝑥)1 ≥ 1 + 1. 𝑥𝑥 ⟹ 1 ≥ 1, holds.
rK

2) We prove the implication following: 𝑃𝑃(𝑛𝑛) ⟹ 𝑃𝑃(𝑛𝑛 + 1) .

That is, if 𝑃𝑃(𝑛𝑛): ∀𝑥𝑥 > 0, (1 + 𝑥𝑥)𝑛𝑛 ≥ 1 + 𝑛𝑛𝑛𝑛 is true, then 𝑃𝑃(𝑛𝑛 + 1) is
D

true, that means we must get:

𝑃𝑃(𝑛𝑛 + 1): ∀𝑥𝑥 > 0, (1 + 𝑥𝑥)𝑛𝑛+1 ≥ 1 + (𝑛𝑛 + 1)𝑥𝑥

Let (1 + 𝑥𝑥)𝑛𝑛+1 = (1 + 𝑥𝑥)𝑛𝑛 . (1 + 𝑥𝑥)

(1 + 𝑥𝑥)𝑛𝑛 ≥ 1 + 𝑛𝑛𝑛𝑛 ⟹ (1 + 𝑥𝑥)𝑛𝑛 . (𝟏𝟏 + 𝒙𝒙) ≥ (1 + 𝑛𝑛𝑛𝑛). (𝟏𝟏 + 𝒙𝒙)

⟹ (1 + 𝑥𝑥)𝑛𝑛+1 ≥ (1 + 𝑛𝑛𝑛𝑛). (𝟏𝟏 + 𝒙𝒙)

⟹ (1 + 𝑥𝑥)𝑛𝑛+1 ≥ (𝟏𝟏 + 𝒙𝒙) + 𝑛𝑛𝑛𝑛(𝟏𝟏 + 𝒙𝒙)

⟹ (1 + 𝑥𝑥)𝑛𝑛+1 ≥ 𝟏𝟏 + 𝒙𝒙 + 𝑛𝑛𝑛𝑛 + 𝑛𝑛𝑥𝑥 2 ≥ 𝟏𝟏 + 𝒙𝒙 + 𝑛𝑛𝑛𝑛

⟹ (1 + 𝑥𝑥)𝑛𝑛+1 ≥ 1 + (1 + 𝑛𝑛)𝑥𝑥

Students are expected to be familiar with the content of the lectures of Mathematics I before each
tutorial sessions -----By Dr. Kesmia Mounira Page 2
 First-year undergraduate Students in the Department of Common
Education in Sciences and Technology

Conclusion: ∀𝑛𝑛 ∈ ℕ: ∀𝑥𝑥 > 0, (1 + 𝑥𝑥)𝑛𝑛 ≥ 1 + 𝑛𝑛𝑛𝑛 holds as required.

Solution of exercise 5: By the Cases Disjunction proof prove the following

statement

If 𝑛𝑛 = 𝑎𝑎2 + 𝑏𝑏 2 , 𝑎𝑎, 𝑏𝑏 ∈ ℕ Then the remainder of the Euclidean division of n

by 4 is different to 3.

We have three cases:

1) a and b are even numbers

∃𝑘𝑘 ∈ ℕ: 𝑎𝑎 = 2𝑘𝑘 ⟹ 𝑎𝑎2 = 4𝑘𝑘 2

ra
2
∃𝑘𝑘 ′ ∈ ℕ: 𝑏𝑏 = 2𝑘𝑘 ′ ⟹ 𝑏𝑏 2 = 4𝑘𝑘 ′

ni
2 2
𝑛𝑛 = 𝑎𝑎2 + 𝑏𝑏 2 = 4𝑘𝑘 2 + 4𝑘𝑘 ′ = 4�𝑘𝑘 2 + 𝑘𝑘 ′ � ⟹

the remainder of the Euclidean division of n by 4 is 𝟎𝟎.

ou
M
2) a is even and b is odd numbers

∃𝑘𝑘 ∈ ℕ: 𝑎𝑎 = 2𝑘𝑘 ⟹ 𝑎𝑎2 = 4𝑘𝑘 2

IA

2
∃𝑘𝑘 ′ ∈ ℕ: 𝑏𝑏 = 2𝑘𝑘 ′ + 1 ⟹ 𝑏𝑏 2 = (2𝑘𝑘 ′ + 1)2 = 4𝑘𝑘 ′ + 4𝑘𝑘 ′ + 1
M

2 2
𝑛𝑛 = 𝑎𝑎2 + 𝑏𝑏 2 = 4𝑘𝑘 2 + 4𝑘𝑘 ′ + 4𝑘𝑘 ′ + 1 = 4�𝑘𝑘 2 + 𝑘𝑘 ′ + 4𝑘𝑘 ′ � + 𝟏𝟏 ⟹
ES

⟹ 𝑛𝑛 = 4𝑘𝑘 ′′ + 𝟏𝟏 ⟹ the remainder of the Euclidean division of n by 4 is 𝟏𝟏

rK

3) a and b are odd numbers

∃𝑘𝑘 ∈ ℕ: 𝑎𝑎 = 2𝑘𝑘 + 1 ⟹ 𝑎𝑎2 = 4𝑘𝑘 2 + 4𝑘𝑘 + 1

D

2
∃𝑘𝑘 ′ ∈ ℕ: 𝑏𝑏 = 2𝑘𝑘 ′ + 1 ⟹ 𝑏𝑏 2 = 4𝑘𝑘 ′ + 4𝑘𝑘 ′ + 1
2 2
𝑛𝑛 = 𝑎𝑎2 + 𝑏𝑏 2 = 4𝑘𝑘 2 + 4𝑘𝑘 + 1 + 4𝑘𝑘 ′ + 4𝑘𝑘 ′ + 1 = 4�𝑘𝑘 2 + 𝑘𝑘 ′ + 𝑘𝑘 + 𝑘𝑘 ′ � + 𝟐𝟐 ⟹

⟹ 𝑛𝑛 = 4𝑘𝑘 ′′ + 𝟐𝟐 ⟹ the remainder of the Euclidean division of n by 4 is 𝟐𝟐.

Students are expected to be familiar with the content of the lectures of Mathematics I before each
tutorial sessions -----By Dr. Kesmia Mounira Page 3