1.

RELATIONS AND FUNCTIONS

WORKSHEET
I. Multiple choice questions:

1. If 𝐴 = {5,6,7} and let R = {5,5), (6,6)), (7,7), (5,6), (6,5), (6,7), (7,6)}. Then R is
a) Reflexive, symmetric but not Transitive b) Symmetric, transitive but not reflexive
c) Reflexive, Transitive but not symmetric d) an equivalence relation
2. Let R be a relation defined on Z as follows: (𝑎, 𝑏) ∈ 𝑅 ⟺ 𝑎2 + 𝑏2 = 25. 𝑇ℎ𝑒𝑛 𝐷𝑜𝑚𝑎𝑖𝑛 𝑜𝑓 𝑅 𝑖𝑠
a) {3,4,5} b) {0,3,4,5} c) {0, ±3, ±4, ±5} d) None of these
3. The maximum number of equivalence relations on the set 𝐴 = {1, 2,3} is
a) 1 b) 2 c) 3 d)5
4. The number of elements in set P is 4. The number of possible symmetric relations that can be defined on P
is
a) 16 b) 32 c) 512 d) 1024
5. Let 𝐴 = {1,2,3, ..., 𝑛} 𝑎𝑛𝑑 𝐵 = {𝑝. 𝑞}. Then the number of onto functions from A to B is
a) 2n b) 2n−2 c) 2n−1 d) None of these
6. Let set X = {1, 2, 3} and a relation R is defined in X as: R = {(1, 3), (2, 2), (3, 2)}, then minimum ordered
pairs which should be added in relation R to make it reflexive and symmetric are
a) {(1, 1), (2, 3), (1, 2)} b) {(3, 3), (3, 1), (1, 2)}
c) {(1, 1), (3, 3), (3, 1), (2, 3)} d) {(1, 1), (3, 3), (3, 1), (1, 2)}
7. A relation R in set A = {1, 2, 3} is defined as
R = {(1, 1), (1, 2), (2, 2), (3, 3)}. Which of the following ordered pair in R shall be removed to make it an
equivalence relation in A?
a) (1, 1) b) (1, 2) c) (2, 2) d) (3, 3)
8. Let the relation R in the set A = {x ∈ Z: 0 ≤ x ≤ 12}, given by R = {(a, b): |a – b| is a multiple of 4}. Then
[1], the equivalence class containing 1, is:
a) {1, 5, 9} b) {0, 1, 2, 5} c) f d) A
9. Let R be the relation in the set N given by R = {(a, b): a = b – 2, b > 6}, then:
a) (2, 4)∈R b) (3, 8)∈R c) (6, 8)∈R d) (8, 7)∈R
10. If the set A contains 5 elements and the set B contains 6 elements, then the number of one -one and onto
mappings from A to B is?
a)720 b)120 c)0 d) None of these
11. Let A= {3,5}. Then number of reflexive relations on A is
a) 2 b)4 c)0 d)8
12. A function f: R→R defined by f(x) = 2+x2 is
a) one-one b) not one-one c) not onto d) neither one-one nor onto
13. If A = {1,2,3}, B = {4,5,6,7} and let f = {(1,4), (2,5), (3,6)} be a function from A to B. Based on the
given information, f is best defined as:
a) Surjective function b) Injective function c) Bijective function d) None of these
14. Let X = {x2: x∈N} and the relation f: N→X is defined by f(x) = x2, x∈N. Then, this function is
a) injective only b) not bijective c) surjective only d) bijective
15. Let f: 𝑅+ → [−5, ∞) be defined as f(x) = 9x2+6x-5, where 𝑅+ is the set of all non-negative real numbers.
Then, f is
a) one-one b) onto c) bijective d) neither one-one nor onto
16. The number of elements in set A is 3. The number of possible relations that can bedefined on A is
a) 8 b) 4 c) 64 d) 512
17. The number of elements in Set A is 3. The number of possible reflexive relationsthat can be defined in A
is
a) 64 b) 8 c) 512 d) 4
18. The number of elements in set P is 4. The number of possible symmetric relationsthat can be defined on
P is
a) 16 b) 32 c) 512 d) 1024
19. Let R be a relation on the set N of natural numbers defined by 𝑎𝑅𝑏 if and only if
𝑎 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑏. Then R is
a) Reflexive, symmetric but not Transitive b) Symmetric, transitive but not reflexive
c) Reflexive, Transitive but not symmetric d) an equivalence relation
20. The function 𝑓: [ 𝜋, 2𝜋] → 𝑅 defined by 𝑓(𝑥) = 𝑐𝑜𝑠𝑥 is
a) one – one but not onto b) onto but not one – one
c) many – one function d) bijective function
II. Assertion reason-based questions:
1. Assertion (A): If n (A) =p and n (B) = q then the number of relations from A to Bis 2pq.
Reason(R): A relation from A to B is a subset of 𝐴 × 𝐵.
2. Assertion (A): If n (A) =m, then the number of reflexive relations on A is m
Reason(R): A relation R on the set A is reflexive if (a, a) ∈ 𝑅, ∀a∈ A.
3. Assertion (A): Domain and Range of a relation 𝑅 = {(𝑥, 𝑦): 𝑥 − 2𝑦 = 0} definedon the set A = {1,2,3,4}
are respectively {1,2,3,4}and {2,4,6,8}
Reason(R): Domain and Range of a relation R are respectively the sets
{𝑎: 𝑎 ∈ 𝐴 𝑎𝑛𝑑 (𝑎, 𝑏) ∈ 𝑅. } 𝑎𝑛𝑑 {𝑏: 𝑏 ∈ 𝐴 𝑎𝑛𝑑 (𝑎, 𝑏) ∈ 𝑅}

4. Assertion (A): A relation 𝑅 = {(1,1), (1,2), (2,2), (2,3), (3,3)} defined on the set
𝐴 = {1,2,3} is reflexive.
Reason(R): A relation R on the set A is reflexive if (𝑎, 𝑎) ∈ 𝑅, ∀ 𝑎 ∈ 𝐴
5. Assertion (A): A relation 𝑅 = {(1,1), (1,2), (2,2), (2,3), (3,3)} defined on the set 𝐴 = {1,2,3} is symmetric
Reason(R): A relation R on the set A is symmetric if (𝑎, 𝑏) ∈ 𝑅 ⟹ (𝑏, 𝑎) ∈ 𝑅
6. Assertion (A): A relation 𝑅 = {(1,1), (1,3), (1, 5), (3,1), (3,3), (3,5)} defined onthe set 𝐴 = {1,3,5} is
transitive.
Reason(R): A relation R on the set A symmetric if (a, b) ∈ R and (a, c) ∈ R ⟹ (a, c) ∈ R
7. Assertion (A): 𝐴 = {1,2,3}, 𝐵 = {4,5,6,7}, 𝑓 = {(1,4), (2,5), (3,6)} is a functionfrom A to B. Then 𝑓 𝑖𝑠
𝑜𝑛𝑒 − 𝑜𝑛𝑒
Reason(R): A function 𝑓 𝑖𝑠 𝑜𝑛𝑒 – 𝑜𝑛𝑒 if distinct elements of A have distinctimages in B.
8. Assertion (A): If 𝑋 = {0, 1, 2} and the function 𝑓: 𝑋 → 𝑌 defined by
𝑓(𝑥) = 𝑥2−2 is surjection then 𝑌 = { −2, −1, 0,2}
Reason(R): If 𝑓: 𝑋 → 𝑌 is surjective if for all 𝑦 ∈ 𝑌 there exists 𝑥 ∈ 𝑋 such that 𝑦 = 𝑓(𝑥).
9. Assertion (A): A, B are two sets such that 𝑛(𝐴) = 𝑚 𝑎𝑛𝑑 𝑛(𝐵) = 𝑛. The numberof one-one functions
from A to B is npm, if 𝑛 ≥ 𝑚

Reason(R): A function 𝑓 is one –one if distinct elements of A have distinct images in B.

10. Assertion (A): The identity relation on a set A is an equivalence relation.
Reason (R): The Universal relation on a set A is an equivalence relation.
11. Assertion (A): Set A has 4 elements and set B has 5 elements. Then the number ofbijective mappings
from A to B is 54
Reason(R): A mapping from A to B cannot be bijective if n(A) is not equal to n(B).
12. Assertion (A): 𝑛(𝐴) = 5, 𝑛(𝐵) = 5 and 𝑓 ∶ 𝐴 → 𝐵 is one-one then f is bijection
Reason(R): If 𝑛(𝐴) = 𝑛(𝐵) then, every one-to-one function from A to B is onto.
13. Assertion (A): A function 𝑓: 𝐴 → 𝐵, cannot be an onto function if 𝑛 (𝐴) < 𝑛 (𝐵).
Reason(R): A function 𝑓 is onto if every element of co-domain has at least one pre-image in the domain.
14. Assertion (A): The relation f: {1,2,3,4} → {x, y, z, p} defined by f = {(1, x), (2, y), (3, z)} is a bijective
function.
Reason (R): The function f: {1,2,3} → {x, y, z, p} defined by f = {(1, x), (2, y), (3, z)} is a bijective
function.
III. Very short answer type questions:
1. Consider f: 𝑅+ → [−9, ∞) given by f(x) = 5x2 + 6x – 9. Show that 𝑓 is one-one.
2. Let R be the relation defined in the set 𝐴 = {1, 2, 3, 4,5} by
𝑅 = {(𝑥, 𝑦): 𝑥, 𝑦 𝜖 𝐴, 𝑥 𝑎𝑛𝑑 𝑦 𝑎𝑟𝑒 𝑒𝑖𝑡ℎ𝑒𝑟 𝑏𝑜𝑡ℎ 𝑜𝑑𝑑 𝑜𝑟 𝑏𝑜𝑡ℎ 𝑒𝑣𝑒𝑛}. Find R in Roster form.
3. Check whether the following relation 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏} defined on set of realnumbers are reflexive
and symmetric or not.
4. Prove that the greatest integer function 𝑓: 𝑅 → 𝑅, given by 𝑓(𝑥) = [𝑥], is neitherone-one nor onto.
 𝑥−2
5. Let A = R − {1}. If 𝑓: 𝐴 → 𝐴 is a mapping defined by f(x) =𝑥−1, show that 𝑓 is onto.

6. A function 𝑓: 𝐴 → 𝐵 defined as 𝑓(𝑥) = 2𝑥, is both one-one and onto. If 𝐴 = {1,2,3,4}, then find the set B.
7. Let L be the set of all lines in a plane and R be the relation in L defined as 𝑅 = {(𝐿1, 𝐿2): 𝐿1 is
perpendicular to 𝐿2}. Is the relation R transitive? Justify youranswer.
8. Is the relation R = {(a, b): a≤ 𝑏2} defined on set of real numbers transitive? Justifyyour answer.
9. Determine whether the relation R defined on the set of all real numbers as R = {(a, b): a, b and
a – b + √3 ∈ S, where S is the set of all irrational numbers}, issymmetric.

10. Is the relation R defined on the set of all real numbers as 𝑅 = {(𝑎, 𝑏): 𝑎 > 𝑏}, reflexive, symmetric and
transitive? Justify your answer.
11. Show that the relation R defined on the set A of all triangles in a plane as 𝑅 = {(𝑇1, 𝑇2): 𝑇1 𝑖𝑠 𝑠𝑖𝑚𝑖𝑙𝑎𝑟 𝑡𝑜
𝑇2} is an equivalence relation.
12. Show that the relation R in the set of ℝ real numbers, defined as 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏3} is not transitive.
13. State the reason for the relation R in the set {1,2,3} given by R = {(1,2), (2, 1)} is not to be transitive.
14. If R is a relation ‘is divisor of’ from the set A = {1,2,3} to B = {4,10,15}, then write down the set of
ordered pairs corresponding to R.
15. If a relation R is defined on the set A = {1,2,3,4,5} by R = {(a, b): |a2-b2|<8}. Then find the relation R.
III. Short answer type questions:
1. Show that the relation R in the set {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3), (1, 2),(2, 3)} is reflexive
but neither symmetric nor transitive.
2. Show that the relation R in the set {1, 2, 3, 4} given by
R = {(1, 2), (2, 2), (1, 1), (4,4), (1, 3), (3, 3), (3, 2)} is reflexive and transitive but not symmetric.
3. Check whether the relation R defined in the set A= {1, 2, 3, 4, 5, 6} as
𝑅 = {(𝑎, 𝑏): 𝑏 = 𝑎 + 1, 𝑎, 𝑏 ∈ 𝐴} is reflexive, symmetric or transitive.
4. Determine whether the relation R in the set 𝐴 = {1, 2, 3, … ,13, 14} defined as
𝑅 = {(𝑥, 𝑦): 3𝑥 – 𝑦 = 0, 𝑥, 𝑦 ∈ 𝐴} is reflexive or symmetric or transitive.
5. Determine whether the relation R in the set N of natural numbers defined as
𝑅 = {(𝑥, 𝑦): 𝑦 = 𝑥 + 5 𝑎𝑛𝑑 𝑥 < 4} is reflexive, symmetric or transitive.
6. Prove that the Greatest Integer Function 𝑓 ∶ 𝑅 → 𝑅, given by 𝑓(𝑥) = [𝑥], is neitherone-one nor onto,
where [x], denotes the greatest integer less than or equal to 𝑥.
7. Prove that the function f: 𝑁 ⟶ 𝑁 defined by 𝑓(𝑥) = 𝑥2 + 𝑥 + 1 is one-onebut not onto.
𝑥 − 1 𝑖𝑓 𝑥 𝑖𝑠 𝑜𝑑𝑑
8. 𝐿𝑒𝑡 𝑓: 𝑊 → 𝑊 𝑏𝑒 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑎𝑠 𝑓(𝑥) = { . Show that 𝑓 is both one-one and onto.
𝑥 + 1 𝑖𝑓 𝑥 𝑖𝑠 𝑒𝑣𝑒𝑛
9. Consider 𝑓: 𝑅+ ⟶ [4, ∞) 𝑔𝑖𝑣𝑒𝑛 𝑏𝑦 𝑓(𝑥) = 𝑥2 + 4. Show that f is both one-one and onto.
−1 𝑖𝑓 𝑥 < 0
10. Show that the function 𝑓: 𝑅 ⟶ 𝑅 𝑖𝑠 𝑔𝑖𝑣𝑒𝑛 𝑏𝑦𝑓(𝑥) = { 0 𝑖𝑓 𝑥 = 0 (this function is called signum
1 𝑖𝑓 𝑥 > 0
function) is neither one-one nor onto.
 n + 1, if n is odd
11. Let f: N → N be defined by f(n) = { , show that f is bijective.
n − 1, if n is even
IV. Long answer type questions:
1. Let R be the relation in the set Z of integers given by 𝑅 = {(𝑎, 𝑏): 2 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑎 – 𝑏}. Show that the
relation R equivalence? Write theequivalence class [0].
2. Show that the relation R defined by (𝑎, 𝑏) 𝑅 (𝑐, 𝑑) ⇔ 𝑎 + 𝑑 = 𝑏 + 𝑐 on the set N× N is an equivalence
relation. Also, find the equivalence classes [(2,3)] and1,3)].
3. Show that the relation R in the set of ℝ real numbers, defined as 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏3} is neither reflexive
nor symmetric nor transitive.
4. Let A = {1, 2, 3, ……., 9} and (𝑎, 𝑏) 𝑅 (𝑐, 𝑑) 𝑖𝑓 𝑎𝑑 = 𝑏𝑐 𝑓𝑜𝑟 (𝑎, 𝑏), (𝑐, 𝑑) 𝑖𝑛 A×A. Prove that R is an
equivalence relation.
5. Consider a function 𝑓: [0,𝜋/2] ⟶ 𝑅 𝑔𝑖𝑣𝑒𝑛 𝑏𝑦 𝑓(𝑥) = 𝑠𝑖𝑛𝑥 𝑎𝑛𝑑 𝑔: [0, 𝜋/2] ⟶ 𝑅 given by 𝑔(𝑥) = 𝑐𝑜𝑠𝑥.
Show that 𝑓 𝑎𝑛𝑑 𝑔 are one-one but 𝑓 + 𝑔 is not one-one.
6. A function 𝑓: [−4,4] → [0,4] is given by 𝑓(𝑥) = √16 − 𝑥2. Show that 𝑓 is an onto function but not a one-
one function. Further, find all possible values of ‘𝑎’ for which 𝑓(𝑎) = √7.
7. A relation R is defined on a set of real numbers ℝ as 𝑅 = {(𝑥, 𝑦): 𝑥𝑦 𝑖𝑠 𝑎𝑛 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟}
Check whether R is reflexive, symmetric and transitive or not.
8. If f: X → Y is a function. Define a relation R on X given by R = {(a, b): f(a) = f(b)}. Show that R is an
equivalence relation on X.
9. Let A = {x ∈ Z: 0 ≤ x ≤ 12}. Show that R = {(a, b): a, b ∈ A, |a – b| is divisible by 4} is an equivalence
relation. Find the set of all elements related to 1. Also, write the equivalence class [2].
10. If N denotes the set of all natural numbers and R be the relation on N × N defined by (a, b) R (c, d),
if ad (b + c) = bc (a + d). Show that R is an equivalence relation.
11. Given a non-empty set X, consider P(X) which is the set of all subsets of X. Define the relation R in
P(X) as follows: For subsets A, B in P(X), A R B if and only if A⊂B. Is R an equivalence relation on P(X)?
Justify your answer.
12. Let L be the set of all lines in XY plane and R be the relation in L define as R = {(L1, L2): L1 || L2}
Show then R is on equivalence relation. Find the set of all lines related to the line y=2x+4.
13. A relation R is defined on N×N (where N is the set of all natural numbers) as
(a, b) R (c, d)⟺ a-c=b-d. Show that R is an equivalence relation.
2𝑥
14. Show that a function f: R → R defined by f(x) = 1+𝑥 2 is neither one-one nor onto. Further, find a set A so
that the given function f: R → A becomes an onto function.
15. Let A = {1,2,3, … , 9} and R be the relation in A defined by (a, b) R (c, d) iff𝑎 + d = b + c for all
a, b, c, d ∈ A. Prove that R is an equivalence relation. Also obtain the equivalence class [(2,5)].
4 4 4𝑥+3
16. Consider f: R− {− 3} → R− {3} given by f(𝑥) = 3𝑥+4 .Show that f is bijective.
𝑥
17. Show that the function f: R → {x ∈ R: – 1 < x < 1} defined by f(x) = 1+|𝑥| , x ∈ R is one-one and onto
function.
18. Let A= {𝑥 ∈ 𝑍: 0 ≤ 𝑥 ≤ 12}.Show that R = {(𝑎, b): 𝑎, b ∈ A, |𝑎 − b|is divisible by 4}is an
equivalencerelation. Find the set of all elements related to 1. Also write the equivalence class [2].
19. Let R be a relation on the set A = N × N ,where N is the set of natural numbers, defined by
(𝑥, 𝑦) R (u, v) if and only if 𝑥v = 𝑦u. Show that R is an equivalence relation.
20. Show that the relation R in the set N × N, defined by (𝑎, b) R (c, d) iff 𝑎2 + d2 = b2 +
c 2 ∀ 𝑎, b, c, d ∈ N, is an equivalence relation.
𝑥
21. A function f: R−{−1,1} →R is defined by f(x) = 𝑥 2 −1. Verify whether f is one-one and onto.

22. Consider f: 𝑅+ → [−5, ∞) given by f(x) = 9x2 + 6x – 5, where 𝑅+ is the set of all non-negative real
numbers. Prove that f is one-one and onto.