Mount Zion International School
Pudukkottai
RELATION AND FUNCTION PYQ W.S
Class 12 - Mathematics
Section A
1. Let A = {1, 3, 5}. Then the number of equivalence relations in A containing (1, 3) is: [1]
a) 3 b) 2
c) 4 d) 1
2. A function f : R → R defined by f(x) = 2 + x2 is [1]
a) neither one-one nor onto b) one-one
c) not onto d) not one-one
3. Let X = {x2 : x ∈ N} and the relation f : N → X is defined by f(x) = x2, x ∈ N. Then, this function is [1]
a) not bijective b) injective only
c) surjective only d) bijective
4. Let A = {3, 5}. Then number of reflexive relations on A is [1]
a) 4 b) 8
c) 2 d) 0
5. Let set X = {1, 2, 3} and a relation Ris defined in X as: R = {(1, 3), (2, 2), (3, 2)}, then minimum ordered pairs [1]
which should be added in relation R to make it reflexive and symmetric are
a) {(1, 1), (3, 3), (3, 1), (1, 2)} b) {(1, 1), (2, 3), (1, 2)}
c) {(3, 3), (3, 1), (1, 2)} d) {(1, 1), (3, 3), (3, 1), (2, 3)}
Section B
6. Let A = {-1, 0, 1, 2}, B = {-4, -2, 0, 2} and f, g : A → B be the functions defined by f(x) = x2 - x, x ∈ A and [2]
g(x) = 2 ∣
∣x −
1
2
∣ − 1, x ∈ A
∣ . Are f and g equal? Justify your answer.
(Hint: One may note that two functions f : A → B and g : A → B such that f(a) = g(a) ∀ a ∈ A, are called equal
functions).
7. Determine whether the relation R defined on the set R of all real numbers as R = {(a, b) : a, b ∈ R and [2]
–
a − b + √3 ∈ S , where S is the set of all irrational numbers}, is reflexive, symmetric and transitive.
8. Let S be the set of all real numbers. Show that the relation R = {(a, b): a2 + b2 = 1} is symmetric but neither [2]
reflexive nor transitive.
9. Determine whether the below relation is reflexive, symmetric and transitive: [2]
Relation R in the set A = {1, 2, 3, 4, 5, 6} as
R = {(x, y) : y is divisible by x}
[2]
1/5
1
10. Show that the relation R in the set R of real numbers, defined as R = {(a, b): a ≤ b2} is neither reflexive nor
symmetric nor transitive.
n + 1, if n is odd [2]
11. Let f : N → N be defined by f(n) = { Show that f is a bijection.
n − 1, if n is even
12. Let N be the set of natural numbers and R be the relation on N× N defined by (a, b) R (c, d) iff ad = bc for all a, [2]
b, c, d ∈ N. Show that R is an equivalence relation.
13. Prove that every identity relation on a set is reflexive, but the converse is not necessarily true. [2]
14. Prove that the relation R on Z, defined by R {(x, y) : (x - y) is divisible by 5} is an equivalence relation. [2]
Section C
15. Check whether the relation R in the set N of natural numbers given by R = {(a, b): a is divisor of b} is reflexive, [3]
symmetric, or transitive. Also, determine whether R is an equivalence relation.
16. If A = {1, 2, 3, ... , 9} and R is the relation in A × A defined by (a, b) R (c, d), if a + d = b + c for (a, b), (c, d) in [3]
A × A. Prove that R is an equivalence relation. Also, obtain the equivalence class [(2, 5)].
17. If f: R → R is defined as f(x) = 10x + 7. Find the function g : R → R, such that gof = fog = lR· [3]
18. Classify the function f : R → R, defined by f(x) as injection, surjection or bijection. [3]
x
=
2
x +1
19. Let f: R − {−
4
} → R be a function defined as f(x) =
4x
. Show that f is a one-one function. Also, check [3]
3 3x+4
whether f is an onto function or not.
20. Show that the function f in A = R -{ 2
} defined as f (x) =
4x+3
is one-one and onto. Hence, find f-1. [3]
3 6x−4
n+1
, if n is odd [3]
21. If f: N → N is defined by f(n) = { n
2
for all n ∈ N. State whether the function f is bijective.
, if n is even
2
Justify your answer.
22. Prove that the relation R in set A = {1, 2, 3, 4, 5} given by R = {(a, b) : Ia - bl is even} is an equivalence [3]
relation.
5x−3
23. Show that a function f: R → R defined as f(x) = 4
is both one-one and onto. [3]
24. If R is a relation defined on the set of natural numbers N as follows: R={(x,y) : x ∈ N, y ∈ N and 2x+ y = 24}, [3]
then find the domain and range of the relation R. Also, find whether R is an equivalence relation or not.
25. Check which of the following functions is onto or into. [3]
i. f : A → B, given by f(x) = 3x, where A = {0,1, 2} and B = {0, 3, 6}.
ii. f : Z → Z, given by f(x) = 3x + 2, where Z = set of integers.
x + 1, if x is odd [3]
26. Show that f : N → N, given by f(x) = { is both one-one and onto.
x − 1, if x is even
27. Show that the relation R in the set Z of integers given by R = {(a, b) : 2 divides a-b} is an equivalence relation. [3]
28. Show that the relation S in the set R of real numbers defined as S = {(a, b): a, b ∈ Rand a ≤ b3} is neither [3]
reflexive nor symmetric nor transitive.
29. Show that the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12} given by S = {(a, b) : a, b ∈ Z, |a − b| is [3]
divisible by 3} is an equivalence relation.
30. 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 [3]
or transitive.
31. 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) [3]
= bc(a + d). Show that R is an equivalence relation.
32. Let f: X → Y is a function. Define a relation R in X given by R = {(a, b): f(a) = f(b)}. Examine whether R is an [3]
equivalence relation or not.
2/5
1
33. Prove that a function f: [0, ∞) → [-5, ∞) defined as f(x) = 4x2 + 4x - 5 is both one-one and onto. [3]
34. Show that the relation S in set A= {x ∈ Z : 0≤ x ≤ 12} given by S = {(a, b): a, b ∈ A, Ia - bl is divisible by 4} is [3]
an equivalence relation. Find the set of all elements related to 1.
35. If f : R → R is the function defined by f(x) = 4x3 + 7, then show that f is a bijection. [3]
36. Check whether a function f: R → [−
1
2
,
1
2
] defined as f(x) = 1+x
x
2
is one-one and onto or not. [3]
37. A relation R is defined on a set of real numbers R as [3]
R = {(x, y): x⋅ y is an irrational number}.
Check whether R is reflexive, symmetric and transitive or not.
Section D
38. Let A = {1, 2, 3, ....9} and R be the relation in A× A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in [5]
A× A. Prove that R is an equivalence relation and also obtain the equivalence class [(2, 5)].
39. Let f : W → W be defined as f(n) = n - 1, if n is odd and f(n) = n + 1, if n is even. Show that f is invertible. Find [5]
the inverse of f. Here, W is the set of all whole numbers.
40. Show that the function f : R - {3} → R - {1} given by f(x) is a bijection. [5]
x−2
=
x−3
41. Show that the relation R in the set A = {1, 2, 3, 4, 5} given by R = {(a, b) : |a – b| is divisible by 2} is an [5]
equivalence relation. Write all the equivalence classes of R.
42. 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 [5]
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}.
Section E
43. Let R is the equivalence relation in the set A = {0, 1, 2, 3, 4, 5} given by R = {(a, b): 2 divides (a - b)}. Write the [1]
equivalence class [0].
44. Determine whether the relation is reflexive, symmetric and transitive: [1]
Relation R in the set A of human beings in a town at a particular time given by
R = {(x, y) : x is wife of y}
45. If f = {(1, 2), (2, 4), (3, 1), (4, k)} is a one-one function from set A to A, where A = {1, 2, 3, 4}, then find the [1]
value of k.
46. If the relation R on the set A = {x : 0 ≤ x ≤ 12} given by R = {(a, b) : a = b} is an equivalence relation, then [1]
find the set of all elements related to 1.
47. Write the smallest reflexive relation on set A = {a, b, c}. [1]
48. 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. Show that f is one- [1]
one.
49. Check whether the relation R defined on the set {1, 2, 3, 4} as R = {(a, b) : b = a + 1} is transitive. Justify your [1]
answer.
50. State the reason for the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} not to be transitive. [1]
51. A function f: A → B defined as f(x) = 2x is both one-one and onto. If A = {1, 2, 3, 4}, then find the set B. [1]
n+1
, if n is odd [1]
52. Show that the function f :N → N, defined by f(n) = {
n
2
is one one and onto function.
, if n is even
2
Section F
53. Read the text carefully and answer the questions: [4]
Priyanka and Renu are playing Ludo at home during Covid-19. While rolling the dice, Priyanka’s sister Pummy
observed and noted the possible outcomes of the throw every time belongs to set {1, 2, 3, 4, 5, 6}. Let A be the
3/5
1
set of players while B be the set of all possible outcomes.
A = {S, D}, B = {1, 2, 3, 4, 5, 6}
(a) Pummy wants to know the number of functions from A to B. How many number of functions are possible?
(b) Pummy wants to know the number of relations possible from A to B. How many number of relations are
possible?
(c) Let R be a relation on B defined by R = {(1, 2), (2, 2),(1, 3), (3, 4), (3, 1), (4, 3), (5, 5),}. Is R an
equivalence relation?
(d) Show that a relation, R : B → B be defined by R = {(x, y) : y is divisible by x} is a reflexive and transitive
but not symmetric.
54. Read the text carefully and answer the questions: [4]
A relation R on a set A is said to be an equivalence relation on A iff it is
Reflexive i.e., (a, a) ∈ R ∀ a ∈ A.
Symmetric i.e., (a, b) ∈ R ⇒ (b, a) ∈ R ∀ a, b ∈ A.
Transitive i.e., (a, b) ∈ R and (b, c) ∈ R ⇒ {a, c) ∈ R ∀ a,b, c ∈ A.
(a) If the relation R = {(1, 1), (1, 2), (1, 3), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)} defined on the set A - {1, 2, 3},
then define if R is reflexive, symmetric or transitive.
(b) If the relation R = {(1, 2), (2, 1), (1, 3), (3, 1)} defined on the set A = {1, 2, 3}, then check whether R is
reflexive,symmetric or transitive
(c) If the relation R on the set N of all natural numbers defined as R - {(x, y) : y = x + 5 and x < 4}, then
check whether R is reflexive, symmetric or transitive.
(d) If the relation R on the set A = {1, 2, 3, .... 13, 14} defined as R = {(x, y) : 3x - y = 0}, then define R.
Section G
55. Read the text carefully and answer the questions: [4]
x−1
Consider the mapping f : A → B is defined by f(x) = x−2
such that f is a bijection.
(a) What is the domain of the function f(x)?
(b) What is the range of the function f(x)?
(c) If g(x) : R - {2} → R - {1}, How can the function g(x) in terms of x be expressed if it is defined as g(x) =
2f(x) - 1?
(d) Under what condition is a function f(x) considered to be one-one?
56. Assertion (A): All trigonometric functions have their inverses over their respective domains. [1]
Reason (R): The inverse of tan-1 x exists for some x ∈ R .
a) Both A and R are true and R is the correct b) Both A and R are true but R is not the
explanation of A. correct explanation of A.
c) A is true but R is false. d) A is false but R is true.
57. Assertion (A): Function f : R → R given by f(x) = sin x is not a bijection. [1]
Reason (R): A function f : A → B is said to be bijection if it is one-one and onto.
4/5
1
a) Both A and R are true and R is the correct b) Both A and R are true but R is not the
explanation of A. correct explanation of A.
c) A is true but R is false. d) A is false but R is true.
58. Assertion (A): Principal value of tan-1 (− √3) is − .
– π
[1]
3
Reason (R): tan-1: R → (− π
2
,
π
2
) so for any x ∈ R, tan-1(x) represent an angle in (− π
2
,
π
2
) .
a) Both A and R are true and R is the correct b) Both A and R are true but R is not the
explanation of A. correct explanation of A.
c) A is true but R is false. d) A is false but R is true.
59. Assertion (A): Domain of f(x) = sin-1x + cos x is [-1, 1]. [1]
Reason (R): Domain of a function is the set of all possible values for which function will be defined.
a) Both A and R are true and R is the correct b) Both A and R are true but R is not the
explanation of A. correct explanation of A.
c) A is true but R is false. d) A is false but R is true.
60. Assertion (A): The domain of the function sec-1 2x is (−∞, −
1
]∪ [
1
, ∞)
[1]
2 2
Reason (R): sec-1 (-2) = − π
a) Both A and R are true and R is the correct b) Both A and R are true but R is not the
explanation of A. correct explanation of A.
c) A is true but R is false. d) A is false but R is true.
5/5
1