DAV PUBLIC SCHOOL, BERHAMPUR, ODISHA
Chapter – 1 (Relations and Functions)
1. Check the following relations R and S for reflexivity, symmetry and transitivity:
(i) aRb iff b is divisible by a; a, b ∈N
(ii) l 1 R l 2 iff l 1 is perpendicular to l 2, where l 1 and l 2 are straight lines in a plane
2. Determine whether each of the following relations are reflexive, symmetric and transitive:
(i) Relation R on the set A = {1, 2, 3, ….., 13, 14} defined as R = {(x, y) : 3x – y = 0}
(ii) Relation R on the set Z of all integer defined as R = {(x, y) : x – y is an integer}
3. Show that the relation R on R defined as R = {(a, b) : a ≤b}, is reflexive and transitive but not
symmetric.
4. Show that the relation R on the set R of all real numbers, defined as R = {(a, b): a ≤ b2} is neither
reflexive nor symmetric nor transitive.
5. Check whether the relation R on R defined by R = {(a, b): a ≤ b3} is reflexive, symmetric or transitive.
6. Let n be a positive integer. Prove that the relation R on the set Z of all integer numbers defined by (x, y)
∈R ⇔x – y is divisible by n, is an equivalence relation on Z.
7. Show that the relation R on the set A = {1, 2, 3, 4, 5}, given by R = {(a, b): |a−b| is even}, is an
equivalence relation. Show that all the elements of {1, 3, 5} are related to each other and all the
elements of {2, 4} are related to each other. But, no element of {1, 3, 5} is related to any element of {2,
4}.
8. Show that the relation R on the set A = {x∈ Z: 0 ≤x ≤ 12}, given by R ={(a, b): |a−b| is a multiple of
4} is an equivalence relation. Find the set of all elements related to 1 i.e. equivalence class [1].
9. Prove that the relation R on the set N × N defined by (a, b) R (c, d) ⇔a + d = b + c for all (a, b), (c, d) ∈
N × N is an equivalence relation. Also, find the equivalence classes [(2, 3)] and [(1, 3)].
10. Let A = {1, 2, 3,……,9} and R be the relation on A × A defined by (a, b) R (c, d) if a + d = b + c for all
(a, b), (c, d) ∈ A × A. Prove that R is an equivalence relation and also obtain the equivalence class [(2,
5)].
11. Let N be the set of all natural numbers and let R be a relation on N × N, defined by (a, b) R (c, d) ⇔ ad
= bc for all (a, b), (c, d) ∈N × N. Show that R is an equivalence relation on N × N. Also, find the
equivalence class [(2, 6)].
12. Let N be the set of all natural numbers and let R be a relation on N × N, defined by (a, b) R (c, d) ⇔
ad(b + c) = bc(a + d) for all (a, b), (c, d) ∈N × N. Show that R is an equivalence relation on N × N.
13. Prove that the relation ‘congruence modulo m’ on the set Z of all integers is an equivalence relation.
14. Show that the relation R defined by R ={(a, b): a – b is divisible by 3; a, b ∈Z} is an equivalence
relation.
15. Show that the relation R on the set Z of integers, given by R = {(a, b): 2 divides a - b}, is an equivalence
relation.
16. Prove that the relation R on Z defined by (a, b) ∈R ⇔ a – b is divisible by 5 is an equivalence relation
on Z.
17. Let n be a fixed positive integer. Define a relation R on Z as follows: (a, b) ∈R ⇔ a – b is divisible by n.
Show that R is an equivalence relation on Z.
18. Let R be a relation on the set A of ordered pairs of non – zero integers defined by (x, y) R ( u, v) iff xv =
yu. Show that R is an equivalence.
19. Check whether the relation R on the set N of natural numbers given by R = {(a, b)}: a is a divisor of b}
is reflexive, symmetric or transitive. Also, determine whether R is an equivalence relation.
20. Let A = {a, b, c} and the relation R be defined on A as follows: R = {(a, a), (b, c)}, (a, b). Then, the
minimum number of ordered pairs to be added in R to make it reflexive and transitive.
