SRI SAPTHAGIRI PU COLLEGE, TUMKUR
MATHEMATICS ASSIGNMENT
TOPIC : RELATION AND FUNCTIONS
WEIGHTAGE : 1M (Relation) (MCQ) + 1M (Function) (MCQ) + 3M + 5M= 10 M
1 MARKS
1. The relation R in the set 𝑨 = {𝟏, 𝟐, 𝟑, 𝟒, 𝟓 … … … 𝟏𝟑, 𝟏𝟒} given by 𝑹 = {(𝟏, 𝟑), (𝟐, 𝟔), (𝟑, 𝟗), (𝟒, 𝟏𝟐)}
is
(A) Reflexive (B) Symmetric (C) Transitive (D) None of these
2. A relation R in the set {𝟏, 𝟐, 𝟑} given by 𝑹 = {(𝟏 , 𝟐), (𝟐, 𝟏)} is
(A) Reflexive but not Symmetric (B) Reflexive but not transitive
(C) Symmetric but not Transitive (D) Neither Symmetric nor Transitive
3. Let R be the relation in the set {𝟏, 𝟐, 𝟑, 𝟒} given by 𝑹 = {(𝟏, 𝟐), (𝟐, 𝟐), (𝟏, 𝟏), (𝟒, 𝟒), (𝟏, 𝟑), (𝟑, 𝟑), (𝟑, 𝟐)} is
(A) R is Reflexive, Symmetric but not Transitive
(B) R is reflexive, transitive but not symmetric
(C) R is symmetric, transitive but not reflexive
(D) R is an equivalence relation
4. If a relation R on the set {𝟏, 𝟐, 𝟑} be defined by 𝑹 = {(𝟏, 𝟐)} then R is
(A) Reflexive (B) Transitive (C) Symmetric (D) Equivalence
5. Let R be the relation in the set {𝟏, 𝟐, 𝟑, 𝟒} given by 𝑹 = {(𝟏, 𝟐), (𝟏, 𝟑)} then
(A) R is Reflexive, Symmetric but not Transitive
(B) R is reflexive, transitive but not symmetric
(C) R is symmetric, transitive but not reflexive
(D) R is an transitive but neither reflexive nor symmetric
6. A relation R in the set {𝟏, 𝟐, 𝟑} given that 𝑹 = {(𝟏, 𝟐), (𝟐, 𝟏), (𝟏, 𝟏)} is
(A) Transitive but not Symmetric (B) Symmetric but not Transitive
(C) Symmetric and Transitive (D) neither symmetric nor transitive
7. Let R be the relation in the set N given by 𝑹 = {(𝒂, 𝒃) ∶ 𝒂 = 𝒃 − 𝟐, 𝒃 > 𝟔}. Choose the correct
answer
(A) (2,4) ∈ 𝑅 (B) (3,8) ∈ 𝑅 (C) (6,8) ∈ 𝑅 (D) (8,7) ∈ 𝑅
8. Let us define a relation R in R as ‘aRb’ if 𝒂 ≤ 𝒃. Then R is
(A) An equivalence relation (B) reflexive, transitive but not symmetric
(C) Symmetric, transitive but not reflexive (D) neither transitive nor reflexive but symmetric
9. If 𝑹𝟏 and 𝑹𝟐 are two equivalence relations on a set A. then which one of the following is not true
(A) 𝑅1 ∪ 𝑅2 is Reflexive (B) 𝑅1 ∪ 𝑅2 is symmetric
(C) 𝑅1 ∩ 𝑅2 is equivalence relation (D) 𝑅1 ∪ 𝑅2 is transitive
10. If a relation R on the set {𝟏, 𝟐, 𝟑} be defined by 𝑹 = {(𝟏, 𝟏)} then R is
(A) Reflexive and Transitive (B) Only symmetric
(C) Symmetric and transitive (D) Reflexive and symmetric
𝟏
11. Let 𝒇: 𝑹 → 𝑹 defined by 𝒇(𝒙) = 𝒙 𝒙 ∈ 𝑹 then f is
(A) One- one (B) Onto (C) Bijective (D) f is not defined
𝟏
12. Let 𝒇: 𝑹 → 𝑹 be defined by 𝒇(𝒙) = 𝒙 ∀ 𝑹 − {𝟎} then 𝒇 is
(A) One-one (B) onto (C) Bijective (D) Not defined
13. Let 𝒇: 𝑹 → 𝑹 be defined by 𝒇(𝒙) = 𝟑𝒙 𝒙 ∈ 𝑹, then
(A) f is one-one but not onto (B) f is one-one and onto
(C) f is many one and onto (D) f is neither one-one nor onto
14. Let 𝒇: 𝑹 → 𝑹 be defined by 𝒇(𝒙) = 𝒙𝟒 , 𝒙 ∈ 𝑹. Then
(A) f is one-one but not onto (B) f is one-one and onto
(C) f is many one and onto (D) f is neither one-one nor onto
15. Let 𝒇: 𝒁 → 𝒁 be defined by 𝒇(𝒙) = 𝒙𝟑 , 𝒙 ∈ 𝑹 then
(A) f is one-one but not onto (B) f is one-one and onto
(C) f is many one and onto (D) f is neither one-one nor onto
16. Let 𝒇: 𝒁 → 𝒁 be defined by 𝒇(𝒙) = 𝟑𝒙 𝒙 ∈ 𝑹, then
(A) f is one-one but not onto (B) f is one-one and onto
(C) f is many one and onto (D) f is neither one-one nor onto
17. Let 𝑨 = {𝟏, 𝟐, 𝟑}. Then the number of equivalence relation containing {𝟏, 𝟐} is
(A) 1 (B) 2 (C) 3 (D) 4
18. The number of equivalence relation in the set {𝟏, 𝟐, 𝟑} containing {𝟏, 𝟐} and {𝟐, 𝟏} is
(A) 5 (B) 2 (C) 4 (D) 3
19. If 𝑹𝟏 and 𝑹𝟐 are equivalence relations in a set A then 𝑹𝟏 ∩ 𝑹𝟐 is
(A) Reflexive (B) Symmetric (C) Transitive (D) Equivalence
20. The number of all one-one functions from the set 𝑨 = {𝟏, 𝟐, 𝟑} to itself is
(A) 5 (B) 6 (C) 3 (D) 4
21. Let 𝒇: {𝟏, 𝟐, 𝟑} → {𝟏, 𝟐, 𝟑} choose the correct answer
(A) f is one-one then must be one-one
(B) f is onto then f must be one-one
(C) f is one-one then f is not onto
(D) Both A and B
22. The function 𝒇: 𝑵 → 𝑵 is given by 𝒇(𝒙) = 𝟐𝒙 + 𝟑, 𝒙𝝐𝑵 is
(A) Surjective (B) Injective (C) Bijective (D) None of these
23. Let 𝒇: 𝑹 → 𝑹 be defined by 𝒇(𝒙) = 𝟑𝒙 − 𝟒. Is invertible then 𝒇−𝟏 (𝒙) is given by
𝑥+4 𝑥
(A) (B) − 4 (C) 3𝑥 + 4 (D) None of these
3 3
3 MARKS
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 Z of all integers defined as R = {(x, y) : x – y is an integer} is an
equivalence relation.
3. Check whether the Relation R in the set A = {1, 2, 3, ..., 13, 14} defined as R = {(x, y) : 3x – y = 0} is
reflexive, symmetric and transitive.
4. Show that the relation R in the set Z of integers given by R = {(a, b) : 2 divides a – b} is an
equivalence relation.
5. Show that the relation R in R defined as R = {(a, b) : a ≤ b}, is reflexive and transitive but not
symmetric.
6. Check whether the relation R in R defined by R = {(a, b) : a ≤ b3} is reflexive, symmetric and transitive.
7. Let T be the set of all triangles in a plane with R a relation in T given by R = {(T1, T2) : T1 is
congruent to T2}.Show that R is an equivalence relation.
8. Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as R = {(a, b) : b = a + 1} is reflexive,
symmetric or transitive.
9. Show that each of the relation R in the set A = {x ∈Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a
multiple of 4} is equivalence relation.
10. Show that the relation R in the set A = {1, 2, 3, 4, 5} given by R = {(a, b) : |a – b| is even}, is an
equivalence relation.
11. Find 𝑔𝑜𝑓 and 𝑓𝑜𝑔 if 𝑓: 𝑅 → 𝑅 and 𝑔: 𝑅 → 𝑅 are given by 𝑓(𝑥) = 𝑐𝑜𝑠𝑥 and 𝑔(𝑥) = 3𝑥 2 . Show that
𝑔𝑜𝑓 ≠ 𝑓𝑜𝑔.
5 MARKS
1. Let f : N → Y be a function defined as 𝒇(𝒙) = 𝟒𝒙 + 𝟑, where, Y = {y ∈ N: y = 4x + 3 for some x ∈
N}. Show that f is invertible. Find the inverse.
Or
Consider f : R → R given by f (x) = 4x + 3. Show that f is invertible. Find the inverse of f.
2. Check whether the function f : R → R defined by 𝒇(𝒙) = 𝟑 – 𝟒𝒙 is one-one and onto.
3. Show that the function f : R → R defined by 𝒇 (𝒙) = 𝟏 + 𝒙𝟐 Is neither one-one nor onto.
4. Prove that the Greatest Integer Function 𝑓: 𝑅 → 𝑅, given by 𝑓(𝑥) = [𝑥], is neither one-one nor onto,
where [x] denotes the greatest integer less than or equal to x.
5. Show that the Modulus Function f :R→R, given by 𝒇(𝒙) = |𝒙|, is neither one-one nor onto, where
|x| is x. if x is positive or 0 and |x | is – x, if x is negative.
1, if x 0
6. Show that the Signum Function f : R → R, given by f ( x) 0, if x 0 is neither one-one nor onto.
1, if x 0
7. Show that the function f : N → N, given by f (1) = f (2) = 1 and f (x) = x – 1,for every x > 2, is onto but
not one-one.
x2
8. Let A = R – {3} and B = R – {1}. Consider the function f : A → B defined by f ( x) . Is f one-
x 3
one and onto? Justify your answer.
****************************************************
Note: Submit by 28/03/26