Scribd
Upload
48 views2 pages

Algebra Tutorial 1

.

Uploaded by

bezaiayoub05
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
48 views2 pages

Algebra Tutorial 1

.

Uploaded by

bezaiayoub05
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

Department of Common Core (Computer Science) ING 1st Sem 1 2023-2044

Algebra tutorial series 1

Exercise 1 Which of the following sentences are propositions ? What are the truth values of those that
are propositions ?
1. Paris is in France or Madrid is in China.
2. Open the door.
3. The moon is a satelite of the earth.
4. x + 5 = 7.
5. x + 5 > 9 for every real number x.

Exercise 2 Determine whether each of the following implications is true or false.


1. If 0.5 is an integer, then 1 + 0.5 = 3.
2. If 5 > 2 then cats can fly.
3. If 3 × 5 = 15 then 1 + 2 = 3.
4. For any real x ∈ R, if x ≤ 0 then (x − 1) < 0.

Exercise 3 Are the statements P ⇒ (Q ∨ R) and (P ⇒ Q) ∨ (P ⇒ R). logically equivalent ?


Simplify the following statements.
1. (P ⇒ Q).

2. (P ∨ Q) ⇒ Q ∧ R .
 
3. (P ⇒ Q) ∨ R ∧ R

Exercise 4 Consider the statement “for all integers a and b, if a + b is even, then a and b are even”
1. Write the contrapositive of the statement.
2. Write the converse of the statement.
3. Write the negation of the statement.
4. Is the original statement true or false ? Prove your answer.
5. Is the contrapositive of the original statement true or false ? Prove your answer.
6. Is the converse of the original statement true or false ? Prove your answer.
7. Is the negation of the original statement true or false ? Prove your answer.

Exercise 5 Verify whether the following compound propositions are tautologies or contradictions or Contin-
gency
1. (P ∧ Q) ∧ (P ∨ Q)

2. (P ∨ Q) ∧ P ⇒ Q
3. (P ⇒ Q) ⇔ (P ⇒ Q)
4. ((P ⇒ Q) ∧ (Q ⇒ R)) ⇒ (P ⇒ R).

Exercise 6 Complete, when possible, with ∀ or ∃ to obtain the strongest true statements.
1. · · · x ∈ R, (x + 1)2 = x2 + 2x + 1.
2. · · · x ∈ R, x2 + 3x + 2 = 0.
3. · · · x ∈ R/ 2x + 1 = 0
4. · · · x ∈ N/ x≤π
5. · · · x ∈ R : x2 + 2x + 3 = 0
6. · · · x ∈ ∅ : 2 = 3.
Exercise 7 Determine among the following propositions which ones are true and write, after justification,
the negation of those which are false
1. ∀x ∈ R+ , x3 ≥ x.
2. ∀x ∈ R, ∃y ∈ R : x + y > 0.
3. ∃x ∈ R : ∀y ∈ R, x + y > 0.
4. ∀x ∈ R, ∀y ∈ R, x + y > 0.
5. ∃x ∈ R : ∀y ∈ R, y 2 > x.
6. ∀x ∈ R : ∀y ∈ R : x + y > xy.
7. ∃(x, y, z) ∈ R3 /|x − y| = 3, |y − z| = 4 and |x − z| = 8.
N.B.We recall the triangular inequality : |a + b| ≤ |a| + |b|.
Exercise 8 Let f : R −→ R a function. Give the negation of :
1. ∀M > 0, ∃A > 0 : ∀x ≥ A, f (x) > M.
2. ∀x ∈ R, f (x) > 0 ⇒ x ≤ 0.
3. ∀ > 0, ∃η > 0 : ∀(x, y) ∈ I 2 , (|x − y| ≤ η ⇒ |f (x) − f (y)| ≤ ).
Exercise 9 Soit f : R −→ R a function. Express using quantifiers, the following propositions :
1. f is constant, f is not constant.
2. f is increasing.
3. f is bounded.
Exercise 10 1. Prove by direct reasoning that if : a, b ∈ Q, then a + b ∈ Q.
2. Prove by contraposition that for all real x and y, (x 6= y) ⇒ (x + 1) (y − 1) 6= (x − 1) (y + 1) .
3. Prove by contraposition that, if n2 is even, then n is even.
√
4. Prove by contradiction that 2 is an irrational number.
5. Prove by induction that, for all n ∈ N∗ , 2n−1 ≤ n! ≤ nn .
Additional exercises
Exercise 1 I. Let P, Q and R three propositions, give the negation of
1. P ∧ (Q ∨ R)
2. (P ∧ Q) ⇒ R.
II.Write the negations of the following propositions
1. P : 0 < x ≤ 1,
2. Q : (x2 = 1) ⇒ (x = 1)
Exercise 2 Use the truth table method to verify whether the following logical consequences and equivalences
are correct :
 
1. (P ⇒ (Q ∨ R)) ∧ R P ⇒ Q.
2. (P ⇒ Q) ∧ Q P
3. P ∧ Q ⇔ P ∨ Q
4. (P ∨ Q) ∧ (P ⇒ Q) ⇔ Q
5. (P ∧ Q) ∨ R ⇔ (P ⇒ Q) ⇒ R
6. ((P ⇒ Q) ⇒ Q) ⇒ Q ⇔ P ⇒ Q
N.B. F2 is the logical consequence of F1 , if F2 is true every time F1 is true and we write F1 F2
Exercise 3 1. Let n > 0. Prove by contradiction that if n is the square of an integer, then 2n is not
the square of an integer.
2. Prove by induction that, for n any positive integer, 6n − 1 is divisible by 5.
3. Prove by contradiction that if you arrange (n + 1) pairs of socks in n distinct drawers, then there
is at least one drawer containing at least 2 pairs of socks.

You might also like