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

0% found this document useful (0 votes)
41 views4 pages

S-1-Logics Sets Relations 2024 241008 110242

Hello

Uploaded by

nadirkadi100107
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
0% found this document useful (0 votes)
41 views4 pages

S-1-Logics Sets Relations 2024 241008 110242

Hello

Uploaded by

nadirkadi100107
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/ 4

National polytechnic school

1st year Preparatory Cycle


2024/2025
Algebra I.

o
Series of exercises n 1 - Semester I
Logics, Sets & Relations

Exercise 1 The following two statements are given and assumed to be true :

”If it rains, Ali takes an umbrella.”


”Houda never takes an umbrella if it’s not raining and always takes one when it is”.

We induce the following three logical propositions : P , Q and R :


P : It’s raining.
Q : Ali has an umbrella.
R : Houda has an umbrella.

1. Write the statement using these propositions and the logical connectors : ⇒ and ⇔.
2. What can we deduce from these statements in the various situations below :
a. Ali is walking with an umbrella.
b. Ali is walking without an umbrella.
c. Houda is walking with an umbrella.
d. Houda walks without an umbrella.
e. It’s not raining.
f. It’s raining.
Justify your answers carefully.

Exercise 2 Deny the following assertions :


1. Every right-angled triangle has a right angle ;
2. In all stables, all horses are black ;
3. For any integer x, there exists an integer y such that, for any integer z, the relation z < x implies the relation
z < x+1;
4. ∀ε > 0, ∃α > 0 s.t. (|x − 7/5| < α) ⇒ |5x − 7| < ε).

Exercise 3 Let P be a mathematical statement compound from the three statement P1 , P2 and P3 using the logical connectors
∨, ∧, ¬ ( disjunction, conjunction, negation). 
(v(P1 ) = 1 and v(P2 ) = 0 and v(P3 ) = 1);




Assume that P is false ; v(P ) = 0 if and only if : or



(v(P1 ) = 0 et v(P2 ) = 1 et v(P3 ) = 1).

Consider the two propositions : A = P¯1 ∧ P2 ∧ P3 and B = P1 ∧ P¯2 ∧ P3 .

1. Determine the number of cases for which v(P̄ ) = 1. Draw up the truth table for A and for B.
2. Express P̄ as a function of A and B using one of the logical connectors ∨, ∧, showing that :P̄ =P̄ = (P¯1 ∧ P2 ∧ P3 ) ∨
(P¯2 ∧ P1 ∧ P3 ), known as the canonical disjunctive form.
3. Using Morgan’s laws, deduce P as a function of A and B, then as a function of P1 , P2 and P3 using the logical
connectors ∨, ∧, − and showing that :P = Ā ∧ B̄ = (P¯2 ∨ P1 ∨ P¯3 ) ∧ (P¯1 ∨ P2 ∨ P¯3 ), known as the canonical conjunctive
form.

1 1
National polytechnic school
1st year Preparatory Cycle
2024/2025
Algebra I.

Exercise 4
1. Show by two types of reasoning that if a2 + 9 = 2n then a is odd.
2. Show by recurrence the property : ∀x ∈ R+ , ∀n ∈ N, (1 + x)n ≥ 1 + nx.
3. Show using the contrapositive that if the integer (n2 − 1) is not divisible by 8 then the integer n is even.
4. Show that there are two infinite subsets E1 and E2 of N that are disjoint such that :
∀n ∈ E1 ∪ E2 , (n2 − 1) is a natural number multiple of 8.
5. Show that if m and n are odd integers then m2 + n2 is even but not divisible by 4.
6. Show by two reasoning that : x ∈
/ Q⇒1+x∈
/ Q.
7. Let a1 , a2 , . . . , a9 be real numbers arranged in ascending order such that : a1 + a2 + . . . + a9 = 90. Show that there are
three of these numbers whose sum is greater than or equal to 30.
ln2
8. Show that the real number is irrational.
ln3
Exercise 5 Let E be a non-empty set. P (E) denotes the set of parts of E.
1. Show that the following equivalence is true : ∀A, B ∈ P (E) : (A ∩ B = A ∪ B) ⇔ A = B.
2. Show that the following implications are true :
a) ∀A, B ∈ P (E), (A ∩ B = A ∩ C) ∧ (A ∪ B = A ∪ C) ⇒ B = C.
b) ∀A, B ∈ P (E), (A ∩ B = A ∩ C) ⇒ (A ∩ B̄ = A ∩ C̄).
3. Justify the following equalities :
a) ∀A, B ⊂ E; (A △ B) ∩ C = (A ∩ C) △ (B ∩ C) : distributivity of the ∩ law with respect to the △ law.
b) ∀A, B ⊂ E; A △ B = Ā △ B̄ : Here Ā means A − B and B̄ means B − A.

Exercise 6 Let E be a set, A, B ∈ P (E). Solve on P (E) the following equations :


1. X ∪ A = B ;
2. X ∩ A = B ;
3. X − A = B ;
4. X △ A = B.

Exercise 7 Let (E, ≤) be an ordered set. We define the relation R on P(E) \ {∅} by

XRY if and only if (X = Y or ∀x ∈ X , ∀y ∈ Y : x ≤ y).

Verify that R is an ordering relation.

Exercise 8 Let ⪯ be the binary relation defined in N∗ by :

p ⪯ q if and only if ∃n ∈ N∗ s.t pn = q.

1. Prove that ⪯ is an ordering relation.


2. Is this order total or partial ?
3. Is {2, 3} an upper bound part within (N∗ , ⪯).

Exercise 9 On R2 , we consider the relation defined by :

(a, b)£(c, d) if and only if a2 + b2 = c2 + d2 .

1. Prove that £ is an equivalence relation.


2. Describe the equivalence class (a, b) of the pair (a, b).

2 2
National polytechnic school
1st year Preparatory Cycle
2024/2025
Algebra I.

Exercise 10 Let f : R2 → R2 , be a function defined by f (x, y) = (2x + y, x + y) .


1. Is f injective ? surjective ? bijective ?
2. Let A = {(2, 1)} and B = {x, y ∈ R2 |y = 0} two subsets of R2 .
Determine f (R2 ), f −1 (R2 ), f −1 (A) and f (B).

4x
Exercise 11 Let h the application from R to R defined by : h(x) = .
x2 + 1
1. Verify that for all non zero real a we have : h(a) = h( a1 ). Is the application h injective ? Justify.
2. Let f the function defined on the interval I = [1; +∞[ by f (x) = h(x).
a) Show that f is injective.
b) Verify that : ∀x ∈ I; f (x) ≤ 2.
c) Show that f is a bijection of I on ]0, 2] and find f −1 (x).

Exercise 12 For each (a, b, c, d) ∈ Z4 such that ad − bc = 1, we consider the application f : Z × Z −→ Z × Z defined by

f (n, m) = (an + bm, cn + dm).

Let F the set of all these applications.


1. Justify that f is a bijection.
2. Justify that F is stable by composition of applications.

n+4


 , if n ∈ 4Z



 4


 3n − 1
, if n ∈ 4Z + 1


 2


Exercise 13 Consider the application : f : Z → Z defined by f (n) = 3n + 2

 , if n ∈ 4Z + 2
4





−n − 1


, if n ∈ 4Z + 3



 2

1. Determine Im(f ) (The image of f ). Conclusion.


2. Is f Injective ?
3. Justify that {6Z ∩ 4Z; 6Z ∩ (4Z + 2)} is a partition of 6Z.
4. Justify that {12Z; 12Z + 6)} is a partition of 6Z.
5. Determine f (6Z) and f −1 (6Z).

Supplementary exercises

Exercise 14 On R, we define the relation ℜ by : x ℜ y if and only if x2 − y 2 = x − y.


1. Prove that ℜ is an equivalence relation.
2. Compute the equivalence class of an element x of R. How many elements are there in this class ?

3 3
National polytechnic school
1st year Preparatory Cycle
2024/2025
Algebra I.

Exercise 15 Let ℜ be the relation defined on R by α ℜ β if and only α − β ∈ Z.


Prove that ℜ is an equivalence relation and that R/ℜ is in bijection with the interval [0,1[.

Exercise 16 On R2 , we consider the relation defined by :

(a, b)£(c, d) if and only if a2 + b2 = c2 + d2 .

1. Prove that £ is an equivalence relation.


2. Describe the equivalence class (a, b) of the pair (a, b).
3. Let R2/£ be the quotient set for this relation. Prove that the application

R2/£ → [0, +∞[


(a, b) 7→ a2 + b2

is well-defined and that it is a bijection.

Exercise 17 Let the function f : R2 → R defined ∀(x, y) ∈ R2 by

x+y
f (x, y) =
1 − xy

1. Show that the restriction of f in ] − 1, 1[×] − 1, 1[ is an application.


2. Is f injective ? Justify.
π
3. Justify that f (tan x, tan y) = tan(x + y), for all x and y not equal to 2 + kπ, ∀k ∈ Z, such that : tan x, tan y are in
] − 1, 1[.
4. Determine f (R2 −] − 1, 1[2 ) as well as f (] − 1, 1[2 ).
5. Conclude.

Exercise 18 Are the following applications well defined ? if yes, are they injective ? surjective ? bijective ?
1. f : {0, 1, 2} → {1, 8, −1, 24} such that f (0) = −1, f (1) = 24, f (2) = 1.
2. f : Z → Z such that f (n) = −n.
3. f : N → N such that f (n) = n + 1.
4. f : N → N such that f (n) = n − 1.
5. f : N → {−1, +1} which for each n of N associates 1 if n is even, and −1 if n is odd.
For each of applications 1), 2), 3), 4) and 5) of the previous exercise, calculate :

f ({2}), f ({0, 2}), f −1 ({1}), f −1 ({−1, 1})

Exercise 19 (1) Show that f : R →] − 1; 1[ defined by :


x
f (x) = 1+|x| is bijective and determine its inverse.
(2) Let g the application from R to ] − 1; 1[ defined by :

f (x) = sin(πx)

a) Is this application injective ? surjective ? bijective ?


b) Show that the restriction of f in ] −1 1 −1 1
2 ; 2 [ is a bijection from ] 2 ; 2 [ to ] − 1; 1[ .

4 4

You might also like