Sure Shot Questions

Chapter – 01
Relations and Functions
 MCQ (d) Neither symmetric nor transitive
7. The identity element for the binary operation
1. Let T be the set of all triangles in the Euclidean
ab
plane, and let a relation R on T be defined as aRb if defined on Q – {0} as a * b   a, b  Q  {0} is
2
a is congruent to ba, b  T . Then R is
(a) 1 (b) 0
(a) Reflexive but not transitive (c) 2 (d) None of these
(b) Transitive but not symmetric
(c) Equivalence 8. If the set A contains 5 elements and the set B
(d) None of these contains 6 elements, then the number of one – one
and onto mappings from A to B is
2. Consider the non-empty set consisting of children (a) 720 (b) 120
in a family and a relation R defined as aRb if a is (c) 0 (d) None of these
brother of b. Then R is
(a) symmetric hut not transitive 9. Let A = {1, 2, 3, ….., n} and B = {a, b}. Then the
(b) transitive hut not symmetric number of surjections from A into B is
(c) neither symmetric nor transitive
(a) n P2 (b) 2n  2
(d) both symmetric and transitive
(c) 2n  1 (d) None of these
3. The maximum number of equivalence relations on
the set A = {1, 2, 3} are 1
10. Let f : R  R be defined by f (x)  xR .
(a) 1 (b) 2 x
(c) 3 (d) 5 Then f is
(a) one – one (b) onto
4. If a relation R on the set {1, 2, 3} be defined by R = (c) bijective (d) f is not defined
{(1, 2)}, then R is
(a) reflexive (b) transitive 11. Let f : R  R be defined by f (x)  3x  5 and
2

(c) symmetric (d) None of these x

g : R  R by g (x)  . Then g o f (x) is
x 1
2

5. Let us define a relation R in R as aRb if a  b . Then

R is
3x 2  5 3x 2  5
(a) (b)
(a) An equivalence relation 9 x 4  30 x 2  26 9 x 4  6 x 2  26
(b) Reflexive, transitive but not symmetric 3x 2 3x 2
(c) 4 (d)
(c) Symmetric, transitive but not reflexive x  2 x2  4 9 x 4  30 x 2  2
(d) Neither transitive nor reflexive but symmetric
12. Which of the following functions from Z into Z are
6. Let A = {1, 2, 3} and consider the relation R = {(1, 1), bijective?
(2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then R is (a) f (x)  x (b) f (x)  x  2
3

(a) Reflexive but not symmetric

(c) f (x)  2 x  1 (d) f (x)  x  1
2
(b) Reflexive but not transitive
(c) Symmetric and transitive

YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 1

13. Let f : R  R be the function defined by 19. The number of equivalence relations in the set {1,
f (x)  x 3  5 . Then f 1 (x) is 2, 3} containing the elements (1, 2) and (2, 1) is
1 1
[Term I, 2021 – 22]
(a) (x  5) 3
(b) (x  5) 3

1
(a) 0 (b) 1
(c) (5  x) 3
(d) 5  x (c) 2 (d) 3

14. Let f : A  B and g : B  C be the bijective 20. A relation R is defined on Z as aRb if and only if a2 –
functions. Then (g o f)-1 is
7ab + 6b2 = 0. Then, R is
1
(a) f o g 1 (b) f o g
[Term I, 2021 – 22]
1 1
(c) g o f (d) g o f
(a) Reflexive and symmetric
3
15. Let f : R     R be defined by (b) Symmetric but not reflexive
5 
(c) Transitive but not reflexive
3x  2
f (x)  . Then
5x  3 (d) Reflexive but not symmetric
1
(a) f (x)  f(x)
1
(b) f (x)   f(x) 21. Let A = {1, 3, 5}. Then the number of equivalence
(c) (f o f ) x   x relations in A containing (1, 3) is [2020]
1 (a) 1 (b) 2
(d) f 1 (x)  f (x)
19 (c) 3 (d) 4

16. Let A = {3, 5}. Then number of reflexive relations

22. The relation R in the set {1, 2, 3} given by R = {(1,
on A is [2023]
2), (2, 1), (1, 1)} is [2020]
(a) 2 (b) 4
(a) Symmetric and transitive, but not reflexive
(c) 0 (d) 8
(b) Reflexive and symmetric, but not transitive
(c) Symmetric, but neither reflexive nor transitive
17. Let R be a relation in the set N given by
(d) An equivalence relation
R = {(a, b): a = b – 2, b > 6}. Then [2023]
(a) (8, 7)  R (b) (6,8)  R

(c) (3,8)  R (d) (2, 4)  R

18. A relation R is defined on N. Which of the following

is the reflexive relation?
[Term I, 2021 – 22]
(a) R  {(x, y) : x  y, x, y  N}

(b) R  {(x, y) : x  y  10, x, y  N}

(c) R = {(x, y): xy is the square number, x, y  N }

(d) R  {(x, y) : x  4 y  10, x, y  N}

YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 2

 Assertion-Reasoning (1 mark) d) A is false but R is true.

27. Let R be the relation in the set of integers Z

23. Consider the function f : R→ R defined as f(x) = x3 given by R = {(a, a) : 2 divides (a - a)}
Assertion (A): R is a reflexive relation.
Assertion (A): f(x) is a one - one function.
Reason (R): A relation is said to be reflexive. if x R x, ∀
Reason (R): f(x) is a one - one function if co – domain x∈z
= range.
a) Both A and R are true and R is the correct a) Both A and R are true and R is the correct
explanation of A. explanation of A.
b) Both A and R are true but R is not the correct b) Both A and R are true but R is not the correct
explanation of A.
explanation of A.
c) A is true but R is false.
c) A is true but R is false.
d) A is false but R is true.
d) A is false but R is true.
28. Assertion (A): 𝑓(𝑥) = 1 + 𝑥 2 is a one to one
function from 𝑅 + → 𝑅.
24. Assertion (A): A relation 𝑅 = {(𝑎, 𝑏): |𝑎 − 𝑏𝑙 < Reason (R): Every strictly monotonic function is a one
3} defined to
on the set 𝐴 = {1, 2, 3, 4} is reflexive. one function.
Reason (R): A relation R on the set A is said to be
reflexive if for (a, b) ∈ R and (b, c) ∈ R, we have (a, a) Both A and R are true and R is the correct
c) ∈ R. explanation of A.
b) Both A and R are true but R is not the correct
a) Both A and R are true and R is the correct explanation of A.
explanation of A. c) A is true but R is false.
b) Both A and R are true but R is not the correct d) A is false but R is true.
explanation of A.
c) A is true but R is false.
d) A is false but R is true. 29. Assertion (A): A function f: N → N be defined
𝑛
𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛
25. Assertion (A): The relation R in the set A = {1, 2, 3, 2
by 𝑓(𝑛) = {(𝑛+1)
4, 5, 6} defined as R = {(x, y) : y is divisible by x} is
2
𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
not an equivalence relation. for all n ∈ N; is one - one.
Reason (R): The relation R will be an equivalence Reason (R): A function f: A → B is said to be injective
relation, if it is reflexive, symmetric and transitive. if a ̸= b then f(a) ̸= f(b).

a) Both A and R are true and R is the correct a) Both A and R are true and R is the correct
explanation of A. explanation of A.
b) Both A and R are true but R is not the correct b) Both A and R are true but R is not the correct
explanation of A. explanation of A.
c) A is true but R is false. c) A is true but R is false.
d) A is false but R is true. d) A is false but R is true.

26. Assertion (A): The relation R in the set A = (1, 2, 30. Assertion (A): The Relation R given by R = {(1, 3), (4,
3, 4) defined as R = {(x, y): y is divisible by x) is an 2), (2, 4), (2, 3), (3, 1) on set A = {1, 2, 3, 2} is
equivalence relation. symmetric.
Reason (R): A relation R on the set A is equivalence if Reason (R): For symmetric Relation
it is reflexive, symmetric and transitive. 𝑅 = 𝑅 −1
a) Both A and R are true and R is the correct
a) Both A and R are true and R is the correct explanation of A.
explanation of A. b) Both A and R are true but R is not the correct
b) Both A and R are true but R is not the correct explanation of A.
explanation of A. c) A is true but R is false.
c) A is true but R is false. d) A is false but R is true.
YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 3
31. Assertion (A):Every function is invertible.
Reason (R): Only bijective functions are invertible.

a) Both A and R are true and R is the correct

explanation of A.
b) Both A and R are true but R is not the correct
explanation of A.
c) A is true but R is false.
d) A is false but R is true.

32. Assertion (A): The Greatest Integer Function f:

R→ R, given by f(x) = [x]is one - one.
Reason (R): A function f: A → B is said to be injective
if f(a) = f(b) ⇒ a = b.

a) Both A and R are true and R is the correct

explanation of A.
b) Both A and R are true but R is not the correct
explanation of A.
c) A is true but R is false.
d) A is false but R is true.

 Case Study Question

34. Read the text carefully and answer the questions:
Sherlin and Danju are playing Ludo at home during
33. Read the text carefully and answer the questions: Covid - 19. While rolling the dice, Sherlin’s sister
Students Raji observed and noted the possible outcomes of
of Grade 9, planned to plant saplings along straight the throw every time belongs to set {1, 2, 3, 4, 5,
lines, 6}. Let A be the set of players while B be the
parallel to each other to one side of the playground set of all possible outcomes.
ensuring
that they had enough play area. Let us assume that
they
planted one of the rows of the saplings along the line y
=
x - 4. Let L be the set of all lines which are parallel on
A = {S, D}, B = {1, 2, 3, 4, 5, 6}
the ground and R be a relation on L.
(a) Let R B→ B be defined by R = {(x, y): y is divisible by
x} is

a) Not reflexive but symmetric and transitive

b) Equivalence
c) Reflexive and transitive but not symmetric
d) Reflexive and symmetric and not transitive

(b) Raji wants to know the number of functions from A

to B. How many number of functions are possible?

a) 6! b) 62
c) 212 d) 26

(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)}. Then R is:
a) Transitive b) Reflexive

YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 4

c) None of these d) Symmetric 41. Show that the function 𝑓: 𝑅 → 𝑅 given by 𝑓(𝑥) =
𝑥 3 + 1 for all 𝑥 ∈ 𝑅 is bijective.
(d) Raji wants to know the number of relations possible
from A to B. How many numbers of relations are 42. Check whether the relation R defined on the set
possible? 𝐴 = {1,2,3,4,5,6} 𝑎𝑠 𝑅 = {(𝑎, 𝑏): 𝑏 = 𝑎 + 1} is
reflexive, symmetric or transitive.
a) 212 b) 6!
c) 62 d) 26
43. Let 𝐴 = {𝑥 ∈ 𝑍: 0 ≤ 𝑥 ≤ 12}. Show that that 𝑅 =
(e) Let R : B→ B be defined by R = {(1,1), (1,2), (2,2), {(𝑎, 𝑏): 𝑎, 𝑏 ∈ 𝐴, |𝑎 − 𝑏| is divisible by 4} is an
(3,3), (4,4), (5,5), (6,6)}, then R is: equivalence relation. Find the set of all elements
related to 1. Also write the equivalence class .
a) Symmetric
b) Transitive and symmetric 44. Show that 𝑓: 𝑁 → 𝑁, given by 𝑓(𝑥) =
c) Reflexive and Transitive 𝑥 + 1, 𝑖𝑓 𝑥 𝑖𝑠 𝑜𝑑𝑑
{ is one –one and onto.
d) Equivalence 𝑥 − 1, 𝑖𝑓 𝑥 𝑖𝑠 𝑒𝑣𝑒𝑛

45. State the reason why the relation 𝑅 = {(𝑎, 𝑏) ∶

 Questions 𝑎 ≤ 𝑏 2 } on the set R of real numbers is not
reflexive.

35. Check whether the relation R defined on the set A

46. Show that the relation R in the set N x N defined by
= {1, 2, 3, 4, 5, 6} as
(a, b)R(c, d) if a2 + d2 = b2 + c2∀ a, b, c, d ∈ N, is an
R = {(a, b) : b = a + 1} is reflexive, symmetric or equivalence relation.
transitive. [2019]
47. Show that the relation S defined on set
𝑁 𝑥 𝑁 𝑏𝑦 (𝑎, 𝑏)𝑆(𝑐, 𝑑) 𝑖𝑓 𝑎 + 𝑑 = 𝑏 + 𝑐 is
36. Show that the relation S in the set an equivalence relation.
A  {x  Z : 0  x  12} given by
48. Let N denote the set of all natural numbers and R
S  {(a, b) : a, b  Z | a  b | is divisible by 3} is an be the relation on 𝑁 𝑥 𝑁 defined by
(𝑎, 𝑏)𝑅(𝑐, 𝑑) 𝑖𝑓 𝑎𝑑(𝑏 + 𝑐) = 𝑏𝑐(𝑎 + 𝑑). Show
equivalence relation. [Al 2019]
that R is an equivalence relation.

𝑥2
37. If 𝑦 = 𝑓(𝑥) = , is the function one-one and 49. Prove that the relation R in the set
1+𝑥 2
onto provided 𝑓: 𝑅 → 𝑅?
𝐴 = {1, 2, 3, 4, 5} given by
𝑅 = {(𝑎, 𝑏) ∶ |𝑎 − 𝑏| is even} is an equivalence
38. Give an example of relation R on 𝐴 = {1, 2, 3} relation.
which is reflexive but neither symmetric nor
transitive.
50. Let 𝐴 = 𝑅 − {3}, 𝐵 = 𝑅 − {1}. Let 𝑓: 𝐴 → 𝐵
39. Is the function 𝐹: 𝑍 → 𝑍 such that 𝑓(𝑥) = 𝑥 2 + 𝑥 defined by
injective, surjective or bijective? 𝑥−2
𝑓(𝑥) = 𝑥−3 ∀𝑥 ∈ 𝐴. Then show that 𝑓 is bijective.
40. If 𝑓: 𝑅 → 𝑅 be the function defined by 𝑓(𝑥) =
2
4𝑥 3 + 7, show that 𝑓(𝑥) is bijection. 51. Show that the function f in 𝐴 = 𝑅 − {3}defined as
4𝑥+3
𝑓(𝑥) = 6𝑥−4 is one-one and onto.

52. Let 𝑓: 𝑅 → R be defined by (i) 𝑓(𝑥) = 𝑥 + |𝑥| (ii)

𝑓(𝑥) = 𝑥 +1. Determine whether or not 𝑓 is onto.

YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 5

 58. Let N be the set of all natural numbers and R be a
53. Write the domain of the relation R defined on the relation in N defined by 𝑅 =
set Z of integers as follows: (𝑎, 𝑏) ∈ 𝑅 ⇔ 𝑎2 + {(𝑎, 𝑏): 𝑎 𝑖𝑠 𝑎 𝑓𝑎𝑐𝑡𝑜𝑟 𝑜𝑓 𝑏}, then show that R is
𝑏 2 = 25 reflexive and transitive but not symmetric.

54. Let 𝑓 ∶ 𝑅 → R be defined by 𝑓(𝑥) = 𝑥 2 + 1. Find 59. Classify the following functions as injective,
the pre-image of 17 and (-3). surjective or bijective. (i) 𝑓: 𝑅 → 𝑅 Rdefined by
𝑓(𝑥) = 𝑠𝑖𝑛𝑥 (ii) 𝑓: 𝑅 → 𝑅 defined by
1 𝑓(𝑥) = 𝑠𝑖𝑛 𝑥 + 𝑐𝑜𝑠 2 𝑥
2
55. Show that 𝑓: 𝑅 + → 𝑅 + defined by 𝑓(𝑥) = 2𝑥 is
bijective, where 𝑅 + is the set of all non zero
60. If A = {1, 2, 3, 4], define relations on A which have
positive real number.
properties of being: (i) reflexive, transitive but not
symmetric. (ii) symmetric but neither reflexive nor
𝜋 𝜋
56. Let 𝐴 = {𝑥: 𝑥 ∈ 𝑅, − 2 ≤ 𝑥 ≤ 2 } and 𝐵 = {𝑦: 𝑦 ∈ transitive. (iii) reflexive, symmetric and transitive.
𝑅, −1 ≤ 𝑦 ≤ 1}. Show that the function 𝑓: 𝐴 → 𝐵
such that 𝑓(𝑥) = 𝑠𝑖𝑛𝑥 is bijective. 61. Show that the function 𝑓: 𝑅 → 𝑅 such that 𝑓(𝑥) =
1,𝑖𝑓 𝑥 𝑖𝑠 𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙
{ −1,𝑖𝑓 𝑥 𝑖𝑠 𝑖𝑟𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 is many one and not onto. Find
57. Show that the function 𝑓: 𝑅 → 𝑅 defined by 𝑥 3 + 1
(i) 𝑓 (2) (ii) 𝑓(√2) (iii) 𝑓 (iv) 𝑓 (2 + √3)
𝑥 is a bijection.

For Solutions
Download Arvind Academy App
Click Link: http://bit.ly/2kTWbkj

YouTube Channel Arvind Academy link http://bit.ly/2lYvJGF Page 6