VSA (1 mark)

High
Weightage 1.2 Types of Relations
Topic 9. Write the smallest reflexive relation on set A={a, b,c.
MCQ (2021 C)
10. Arelation Rinaset A is called if (a,, az)eR
1 Assertion (A): Therelation R={(x. y) :(* +y) is aprime implies (az., a)e R, for all a,, a, e A. (2020) R
number and x, ye N] is not a reflexive relation.
Reason (R) : The number '2n' is composite for all 11. Arelation in a set Ais called relation, if each
natural numbers n. element of A is related to itself. (2020) R
(a) Both Assertion (A) and Reason (R) are true
and Reason (R) is the correct explanation of SAI (2 marks)
Assertion (A). 12. Check if the relation R in the set R of real numbers
(b) Both Assertion (A) and Reason (R) are true but
Reason (R) is not the correct explanation of defined as R = {(a, b) : a < b} is (i) symmetric,
Assertion (A). (ii) transitive. (2020)
(c) Assertion (A) is true but Reason (R) is false. 13. Let W denote the set of words in the English
(d) Assertion (A) is false but Reason (R) is true. dictionary. Define the relation Rby
R={%,y) e WxWsuch that xand yhave at least one
letter in common}.
(2024) An Showthat this relation R is reflexive and symmetric,
2. LetA ={3, 5). Then number of reflexive relations on Ais but not transitive. (2020)
(a) 2 (b) 4
(c) 0 (d) 8 (2023) Ap SA I (3 marks)
3 Let R be a relation in the set Ngiven by 14. LetR be a relation defined over N, where N is set of
R={(a, b) :a =b- 2, b> 6}. Then natural numbers, defined as "mRn if and only if m is a
(a) (8,7) e R (b) (6, 8) e R multiple of n,m, ne N." Find whether R
(c) (3, 8) e R (d) (2, 4) e R (2023) is reflexive, symmetric and transitive
4. or not.
(2025) An
A relation Ris defined on N. Which of the following is
the reflex0ve relation?
15. Astudent wants to pair up natural numbers in such a
(a) R={(x, y): x> y, x, yeN way that they satisfytheequation 2x +y= 41, x, ye N.
(b) R={x, y): x +y= 10, x,yeN} Find the domain and range of the relation. Check if
(c) R={x, y): xy is the square number,x, ye N] the relation thus formed is reflexive,
(d) R={x, y): x+4y- 10, x, yeN} symmetric and transitive. Hence, state
(Term I, 2021-22) An whether it is an equivalence relation or (2025) An
5. not.
The number of equivalence relations in the set
{1,2, 3} containingthe elements (1,2) and (2, 1) is CBQ (4 marks)
(a) 0 (b) 1
(c) 2 (d) 3 (Term l, 2021-22) An 16. Case Study : Aclass-room teacher is keen to assess
6. Arelation R is defined on Z as aRb if and only if the learning of her study concept of "relations"
a²-7ab+ 6b² =0. Then, Ris taught to them. She writes the following five
(a) reflexive and symmetric relations each defined on the set A={1, 2, 3}:
(b) symmetric but not reflex0ve
(c) transitive but not reflexive RË {(2, 3), (3, 2)}
(d) reflexive but not symmetric (Term1, 202 1-22) Ap Rz ={(1, 2), (1, 3), (3, 2))
7. Let A = {1, 3, 5). Then the number of equivalence Rg ={(1, 2), (2, 1), (1, 1)}
relations in Acontaining (1, 3) is Ry ={(1, 1),(1, 2), (3, 3), (2, 2)}
(a) 1 (b) 2 Rs {(1, 1), (1, 2),(3,3), (2, 2), (2, 1),(2, 3), (3, 2)}
(c) 3 (d) 4 (2020) The students are asked to answer the following
8. The relation Rin the set (1, 2, 3) given by R={(1, 2), questions about theabove relations:
(2, 1), (1, 1)} is (i) ldentify the relation which is reflexive,
(a) symmetric andtransitive, but not reflexive transitive but not symmetric
(b) reflexive and symmetric, but not transitive
(c) symmetric, but neither reflexive nor transitive (i) ldentify the relation which is reflexive and
(d) an equivalence relation (2020) An symmetric but not transitive.
 (ii) (a) ldentify the relations which are symmetric LA || (5 marks)
but neither reflexive nor transitive. 23. A relation R is defined on N x N(where N is the set of
OR natural numbers) as:
(ii) (b) What pairs should be added to (a, b) R (c, d) >a-c=b-d
the relation R, to make it an equivalence Show that Ris an equivalence relation. (2024) An
relation? (2025) An
24. A relation Ris defined on Nx N(where Nis the set of
17. Case Study :(a) Students of a school are taken to a a_b
natural numbers) as (a, b) R(c, d) *= Show that
railway museum to learn about railways heritage and C
its history. Ris an equivalence relation.
(2024)
25. Check whether the relation S in the set of real
numbers Rdefined by S= {(a, b): where a-b+V2
is an irrational number} is reflexive, symmetric or
transitive.
(2024) Ap
26. Shovw that the relation S in set R of real numbers
An exhibit in the museum depicted many rail lines on defined by
S={la, b) :asb, ae R, be R}
the track near the railway station. Let Lbe the set of is neither reflexive, nor symmetric, nor transitive.
all rail lines on the railway track and Rbe the relation (2023 C) Ap
on Ldefined by R={0,,1,):1,is paraliel to l2.
On the basis of the above information, answer the 27. Let Rbe the relation defined in the set A={1,2, 3, 4,
following questions: 5, 6,7} by R= {la,b) : both a and b are either odd or
(i) Find whether the relation Ris symmetric or not. even}. Show that Risan equivalence relation. Hence,
(ii) Find whether therelation Ris transitive or not. find the elements of equivalence class [1].
(ii) If one of the rail lines on the railway track is (2023 C) Ap
represented by the equation y = 3x + 2, then find 28. A relation R is defned on a set of real numbers R as
the set of allrail lines in Rrelated to it. R-{(x, y):xy is an irrational number}.
OR Check whether R is reflexive, symmetric and
(b) Let S be the relation defined by transitive or not. (2023) Ap
S={(0,.1):1,is perpendicular to l} checkwhether 29. If N denotes the set of all natural numbers and R
the relation Sis symmetric and transitive. is the relation on NxN defined by (a, b) R (C, d), if
(2024)
ad(b + c) = bcla + d). Show that R is an equivalence
relation. (2023)
LAI (4 marks) 30. Let A={xE Z:0<x< 12). Show that R={la, b) : a, b E A,
la-bl is divisible by 4}, is an equivalence relation. Find
18. Show that the relation R in the set A = {1, 2, 3, 4, 5, 6}
the set of allelements related to 1. Also write the
given by R = {(a, b) : la - bl is divisible by 2} is an equivalence class (2. (2018)
equivalence relation. (2020) An
19. Check whether the relation R defined on the set 1.3 Types of Functions
A={1,2, 3,4, 5, 6} as MCQ
R = {(a, b) : b = a+ 1} is reflexive, symmetric or
transitive. (2019) 31. Assertion (A): Let fx) =e'and g(x) =log x. Then
20. Show that the relation R on the set Z of all integers, (f+g) x=e+ logx wheredomain of (f +g) is R.
Reason (R): Dom(f+g) =Dom(f)o Dom(g).
given by
R={la, b) :2 divides (a - b)} is an equivalence relation. (a) Both Assertion (A)and Reason (R) are true and
(2019) Reason (R) is the correct explanation of the
Assertion (A).
21. Show that the relation R on R defined as
(b) Both Assertion (A) and Reason (R) are true, but
R= (la,b):asb), is reflexive and transitive but not Reason (R) is not the correct explanation of the
symmetric. (NCERT, Delhi 2019)
Assertion (A).
22. Show that the relation S in the set A=[xeZ:0<xs12) (c) Assertion (A) is true, but Reason (R) is false.
given by S={la, b) : a, be Z, la - b| is divisible by 3} is (d) Assertion (A) is false, but Reason (R)
an equivalence relation. (AI 2019) Ap is true. (2025) An
32. Assertion (A) Let Z be the set of integers. A SAI (2 marks)
functionf:Z’ Z defined as fx) = 3x -5, V xeZ is a
bijective. 40. Prove that the greatest integer function f:R R
Reason (R) : A function is a bijective if it is both given by f(x) = x], is neither one-one nor onto.
surjective and injective. (2023 C) An
(a) Both Assertion (A) and Reason (R) are true and 41. A
function f:A’ Bdefinedas f(x) =2x is both one-one
Reason (R) is the correct explanation of the and onto. IfA ={1,2, 3, 4}, then find the set B.
Assertion (A). (2023) Ev
(b) Both Assertion (A)and Reason (R) are true, but SA I (3 marks)
Reason (R) is not the correct explanation of the 42. Show that the function f:N’N, where Nis aset of
Assertion (A). natural numbers, given by
(c) Assertion (A) is true, but Reason (R) is false. fin)=Jn-1, ifn is
even
(d) Assertion (A) is false, but Reason (R) is a bijection.
n+1, if n is odd
is true. (2025) An
(2025) An (4 marks)
CBO
33. Let f:R, ’[-5, o) be defined as fx) = 9x2 + 6x - 5,
where R, is the set of all non-negative real numbers. 43. Case Study : A school is organizing a debate
Then, fis: competition with participants as speakers S =(S,, S,,
(a) one-one (b) onto Sg, Sa} and these are judged by judges J =U, J Ja.
(c) bijective Each speaker can be assigned one judge. Let R be a
(d) neither one-one nor onto (2024) An relation from set Sto J defined as R={, y): speaker x
is judged by judge y, xe S, ye J}.
34. Afunction f: R’R defined as f(x) =x²-4x+5 is:
(a) injective but not surjective
(b) surjective but not injective
(c) both injective and surjective
(d) neither injective nor surjective (2024)
35. The function f:R’Rdefined byfx) = 4+3 coSx is
(a) bijective
(b) one-one but not onto Based on the above, answer the following:
(c) onto but not one-one (i) How many relations can be there from Sto J?
(i) A student identifies a function from S to J as
(d) neither one-one nor onto (Term I, 2021-22) An f= {(S,, J), (S2, J), (S3, Ja), (S4, J)} Check if it is
36. The number of functions defined from bijective.
{1,2,3, 4, 5}’ {a, b} which are one-one is (iii) (a) How many one-one functions can be there
from set S to setJ?
(a) 5 (b) 3
(c) 2 (d) O(Term I, 2021-22) AP OR
(ii) (b) Another student considers a relation
37. Letf:R’Rbe defined byfx) = 1/x, for all xe R, Then, R, = {(S1, S,), {S,, Sa)} in set S. Write
fis minimum ordered pairs to be
(a) one-one (b) onto included in R, so that R, is reflexive (2025) An
(c) bijective (d) not defined but not symmetric.
(Term I, 2021-22)
44. Case Study : An organization conducted bike race
38. The function f:N’Nis defined by under two different categories - Boys and girls.
n+1 There were 28 participants in all. Among all of
-, ifn is odd them, finally three from category 1 and two from
2 category 2 were selected for the final race. Ravl
fln) =
forms twO sets Band Gwith these participants for his
n
ifn is even
2' college project.
The function f is
Brepresents
Let B = {b,, b, b,} and G = (g,,32}, whereGirls selected
(a) bijective the set of Boys selected and Gthe set of
(b) one-one but not onto for the final race.
(c) onto but not one-one
(d) neither one-one nor onto (Term 1, 2021-22) Ev
VSA (1 mark)
39. Iff = {(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
value of k. (2021 C)
 Based on the above information, answer the 46. Show that the function f:(-o, 0)’(-1, 0) defined by
following questions.
(i) How many relations are possible from B to G? f(x)=
1+lx'
xe(-,0) is one-one and onto. (2020) An
(i) Among all the possible relations from Bto G,
how many functions can be formed from Bto G? LÀII (5 marks)
(ii) Let R:B’ B be defined by R = {(x, v) : x and y 2x
are students of the same sex}. Check if R is an 47. Showthat a function f:R’R defined by f(x) =1+x2
equivalence relation. isneither one-one nor onto. Further, find set Aso that
OR the given function f:R>A becomes an onto function.
(ii) Afunctionf:B’Gbedefined byf={(b,3).(b2,82),
(ba 8i)}. Check if f is bijective, justify your (2024) Ap
answer.
48. Show that a function f: R R defined as f(x)
(2023) CFQ = x2 +x+ 1 is neither one-one nor onto. Also, find all
LA I (4 marks) the values of x for which f(x) = 3.
(2024)
45. Let be a function defined as 49. Let A=R-{5} and B=R-{1). Consider the function f:
X-3
4x
Show that f is a one-one function. Also,
A’B, defined by f(x) = . Show that f is one-one
f(x)=
3x+4 and onto.
check whether fis an onto function or not. (2023) (2024) Ap

1.2 Types of Relations 3. Let N be the set of all natural numbers and R be a
relation on N×N defined by
MCQ
(a, b) R(c, d) ad = bc for all (a, b), (c, d) e N×N.
1. X= {0,2, 4,6, 8}. Show that R is an equivalence relation on N×N.
Pis a relation on Xdefined by P= {(0, 2), (4, 2), (4, 6), Also, find the equivalence class of (2, 6), i.e., [(2, 6)].
(8, 6), (2, 4), (0,4)}.
Assertion (A): The relation P on set X is a transitive (2023-24) (U
relation. 4. Given a non-empty set X, define the relation R on
Reason (R): The relation P has a subset of the form P(X) as:
{(a, b),(b, c), (a, c)}, where a, b, ce X. For A, Be P(X), (A, B) ¬ R iff AcB. Prove that R is
(a) Both (A) and (R) are true and (R) is the correct reflexive, transitive, and not symmetric. (2022-23)
explanation for (A). 5. Define the relation R in the set N x Nas follows:
(b) Both (A) and (R) are true but (R) is not the
correct explanation for (A). For (a, b), (c, d) e N x N, (a, b) R (c, d) iff ad = bc. Prove
(c) (A) is true but (R) is false. that Ris an equivalence relation in NxN. (2022-23)
(d) (A) is false but (R) is true. (2023-24) APQ An
LA | (5 marks) 1.3 Types of Functions
2 The Earth has 24 time zones, defined by dividing the MCO
Earth into 24 equal longitudinal segments. These are 6. Assertion (A): The function
the regions on Earth that have the same standard
time. For example, USA and India fall in different
time zones, but Sri Lanka and India are in the same
f:R-{(2n+1:ncZ),-1lut.) defned by
f(x) = secx is not one-one function in its domain.
time zone. Reason (R) : The line y = 2 meets the graph of the
Arelation R is defined on the set U= (All people on function at more than one point.
the Earth} such that R = {X, y)l the time difference (a) Both (A) and (R) are true and (R) is the correct
between the time zones Xand y reside in is 6 hours). explanation of (A).
(0) Check whether the relation R is reflexive, (b) Both (A) and (R) are true but (R) is not the
symmetric and transitive. correct explanation of (A).
(1) Is relation R an equivalence relation? (c) (A) is true but (R) is false.
(2023-24) APO(U) (d) (A) is false but (R) is true.
Show your work. (2024-25) (An
7 Assertion (A): The relation f: (1, 2, 3, 4} (x, y. Ravi wishes to form all the relations possible
z, p} defined by f = {(1, x), (2, y). (3, z)}) is a bijective from B to G. How many such relations are
function. possible?
Reason (R): The function f:{1, 2, 3)-> (x. y. z. p) such (ii) Write the smallest equivalence relation on G.
that f- {(1, x),(2. y). (3.,z)] is one-one. (ii) (a) Ravi def1nes a relation from B to B as
(a) Both (A)and (R) are true and (R) is the correct R, {(b, b,). (b,, b)}. Write the mininum
explanation of (A). ordered pairs to be added in R, so that it
(b) Both (A) and (R) are true but (R) is not the becomes (A) reflexive but not symmetric,
correct explanation of (A). (B)reflexive and symmetric but not transitive.
(c) (A)is true but (R) is false. OR
(d) (A) is false but (R) is true. (2023-24) (ii) (b) If the track of the final race (for the biker b.)
follows the curve x' = 4y; (where 0Sx<20/2
CBQ (4 marks) & 0sy s 200), then state whether the track
Case Study : An organization conducted bike race represents a one-one and onto function or not
under 2 different categories-boys and girls. In all, (Justify). (2024-25)
there were 250 participants. Among all of them
LA I| (5 marks)
finally three from Category 1 and two from Category
2 were selected for the final race. Ravi forms tWo 9. Afunction f: R- {-1, 1}’ Ris defined by:
sets B and G with these participants for his college X
f(x)=
project. x²-1
Let B b,, b,, b},G= (g1.g} where B represents the (i) Check if fis one-one.
set of boys selected and G the set of girls who were (i) Check if f is onto.
selected for the final race. Show your work. (2023-24) APQ U
Ravi decides to explore these sets for various types of
10. Show that the function f:R{xeR:-1<x<1}
relations and functions.
X
On the basis of the above information, answer the defined by f(x)= 1+xeR IS One-one and onto
following questions. function. (2023-24) U

Detailed SOLUTIONS
5. (c):Equivalence relations in the set {1, 2, 3} containing
the elements (1, 2) and (2, 1) are
R ={(1, 2), (2, 1), (1, 1), (2, 2), (3, 3)}
1. (c): VxE N- {1} (x, x) R asx +X = 2x is composite R, ={(1,2), (2, 1), (1, 3), (3, 1) (2, 3), (3, 2), (1, 1), (2, 2), (3, 3)}
number i.e., not a prime number. So, R is not a reflexive Number of equivalence relations is 2.
relation. 6(d): Given, aRb, a, beZ
Reason is false as for n = 1, 2n is a prime number. Reflexive: For ae Z, we have
Hence, assertion (A)is true but reason (R) is false. a²-7a-a + 6a? = a?-7a²+ 6a? =0 (a, a) e R
2. (b):R, ={(3, 3), (5, 5)} Relation is reflexive.
R, ={(3,3), (5, 5), (3, 5)} Symmetric: Since, (6, 1) e R
Rg ={(3, 3), (5, 5), (5, 3)} As, 62- 7x6x1+6x 12 = 36 - 42+6=0
Ry= {(3, 3),(5, 5),(3, 5),(5, 3)} But (1, 6)) R. .:. Relation is not symmetric.
3. (b):Given, R =((a, b) : a = b-2, b> 6}
7. (b):Equivalence relations in the set containing the
Since, b > 6, so (2,4) R
Also, (3, 8) Ras 3+8-2and (8,7) Ras 8 7-2 element (1,3) are
Now, for (6, 8), we have R ={(1, 1), (3, 3), (1, 3), (3, 1), (5, 5)}
8>6and6 =8 -2, which is true Ry ={(1, 1).(3, 3),(5, 5),(1, 5),(5, 1),(3,5).(5, 3). (1, 3). (3, 1)}
.". (6,8)eR There are2 possible equivalence relations.
4 8. (c): Given, R {(1, 2), (2, 1), (1, 1)) is a relation on set
(c):Consider, R={%, y):xyisthe squarenumber, x,ye N {1,2, 3}
As, xx =x²,which is the square of natural number x.
Reflexive:Clearly (2, 2), (3, 3) e R
(x, x) e R. So, R is reflexive.
Ris not areflexive relation.
Symmetric: Now,(1, 2) e Rand (2, 1) e R.:. Rissymmetric.
Concept Applied G
Transitive: Now, (2, 1)e Rand (1, 2)e Rbut (2, 2) e R
5 Arelation Rin a set Ais called reflexive, if (a, a) e R, Ris not transitive relation.
for alla E A. Thus, Ris symmetric, but neither reflexive nor transitive.
 Given, A = fa, b, c}
9
A
relation Ron the set Ais said to be reflexive if (a, a)e R.
Reflexive:For (x, x)e R
41
VaE A We have,2x + x 41> x N
3
R=(a, a).(b, b). (c. c)] isthe required smallest reflexive So, Ris not reflexive.
relation on A. Symmetry: If (x. y) e R,then (y, x) e R
10. Arelation Rin a set Ais called symmetric, if (a, aa)e R We have, 2x+y- 41+ 2y +x - 41
implies (a,, a,)e R, for all a,, a,¬ A. (y, x) R
11 Arelation in a set A is called reflexive relation, if each So, Ris not symmetric.
element of Ais related to itself. Transitive: If (x. y) e Rand (y, z) e R,then (x, z) e R
12. We have, R={la, b) :a< b}, where a, be R We have, 2x +y =41 and 2y +z= 41
) Symmetric : Let (x, y) e R, i.e., xRy ’x<y 2x +y + 2y +z =41 +41’ 2x+3y +z= 82
2x + z=82- 3y 41 .. (x, z) R
But y < , So (x, y)eR (y. x) e R Thus, R is not transitive.
Thus, R is not symmetric. Hence, the relation Ris not an equivalence relation.
(ii) Transitive: Let (x, y), (y. z)e R
X<y and y<z X<Z 16. (i) The relations R1, R, and R are not reflexive as
(x,z)e R. Thus, R is transitive. (1, 1), (2, 2),(3,3) e R, Ry and R3
The relation R, is not symmetric as (1, 2) ¬ Ra, but
13. We have, R={lx, y) e Wx W:xand yhave at least one (2, 1)e R4
letter in common} Clearly, the relation R4 is transitive
Reflexive : Clearly (x, x) e R, because same words will :. The relation R, 0s reflexive and transitive but not
contains all common letters. symmetric.
’ Ris reflexive. (i) The relation Rs is reflexive and symmetric.
Symmetric:Let (x, y) e Ri.e., xand yhave at least one letter The relation R, is not transitive as (3, 2) and (2, 1) e Rs but
in common. (3, 1) Rs
yand x willalso have at least one letter incommon. The relation Rs is both reflexive and symmetric but
’ (y, x)e R not transitive.
’ Rissymmetric. (iiü) (a) The relation R, is symmetric but neither reflexive
nor transitive as
Transitive:Let, x=LAND, y=NOT and z =HOT
Clearly x, y) E R as x and y have a common letter and (2, 3), (3, 2)e Ry, therefore symmetric
(y, z) ¬ Ras y andz have 2 common letters. (1, 1), (2, 2), (3,3) R, therefore not reflexive
but (x, z) Ras xandz have no letter in common. (2, 3) and (3, 2) e R1,but (2, 2) R,, therefore not
transitive.
Hence, Ris not transitive.
The relation R, is not symmetric as (1, 2) e R, but
Concept Applied () (2, 1)e R,
The relation Rg is symmetric, but neither reflexive nor
3Arelation Rin a set Ais not transitive if for (a, b) e R transitive as
and (b, c)e Rbut (a, c) R. (1,2) and (2, 1) e R3, therefore symmetric
(2, 2) and (3, 3) Ra,therefore not reflexive
14. Relation Ris defined by (2, 1) and (1, 2) e Ra but (2, 2) Ra therefore not
{mRn:m is a multiple of n, m, ne N} transitive.
For reflexive, The relation R4 and Rs are reflexive as (1, 1), (2, 2) and (3, 3)
mRm :m is a multiple of m meN eRy and Rs.
For symmetric, Hence, the relation R, and Ra are symmetric but neither
mRn:m is a multiple of n m,ne N reflexive nor transitive.
But n is not a multiple of m OR
Ris not symmetric. (ii) (b) The relation R, is not reflexive. To make R, as
For transitive, reflexive, (1, 1)(2, 2) and (3, 3) must be added to relation
mRn:mis a multiple of n, m, ne N R, to make it reflexive.
nRp:n is a multiple of p, Vn, pe N The relation R, is also not symmetric. To make itsymmetric,
mRp:mis a multiple of p, Vn, pEN (2, 1), (3, 1), (2,3) must be added.
RelationRis reflexive and transitive but not Hence, to make the relation Rz equivalence,6 pairs must
symmetric. be added to R2, i.e., (1, 1), (2, 2), (3, 3). (2, 1), (3, 1). (2, 3).
15. The relation is R-((%. y) | x. ye N, 2x +y= 41] 17. (a) Given, R=(W,, 12):1,is parallel to l2)
We have, y = 41 -2x (i) Let (U,, l,)e R
Since, ye N ,is parallel to , ’,is parallel to l,
y21 41- 2x>1’ xs 20 ’ U,l) e R ’ Ris symmetric.
Here, x can take values 1, 2, .., 20 (i) Let (|, ,)e Rand (2.1)e R
and ycan take values 1,3, 5, ...39 ’ Iisparallel tol, and l, is parallel tol
Domain of R={1, 2,.,.20) I, is parallel to
Range of R={1,3,5, .., 39} ,)e R Ris transitive.
(iii) Given, line y = 3x + 2 ..() b-a=2m
Slope of line 3 2dividesb-a
The set of rail lines parallel to given line is y =3x +c, ’ (b, a)e R
where cE R.
Ris symmetric.
OR
Transitive: Let (a, b)e Rand (b, c)e R
(b) Given, S={,.1,):l, is perpendicular to I,} 2divides (a - b)and 2divides (b-)
Let (/,.I) eS a-b=2m and b-c=2n for some m, ne Z
1, is perpendicular to l, + his perpendicular to l, a-b+b -c= 2m +2n
’ (l,)eS ’ Sis symmetric. a-c=2(m+n)
Let U,,l)e Sand (I2.I)e S 2 divides a - c
I, is perpendicular to l, and l, is perpendicular to lg (a, c) e R
I,is parallel to l Ris transitive.
’ (U,,) S ’Sis not transitive. Hence, R is an equivalence relation.
18. We have, A={1, 2, 3, 4, 5, 6} and R={(a, b) : la - b| is 21. We have, R={(a,b):asb, a, beR}
divisible by 2} Reflexive: Since asa .:. aRa aeR
Reflexive: For any ae A
Hence, Ris reflex0ve.
la-al =0, which is divisible by 2. asb + bsa
Symmetric: (a,b)eR such that aRb
Thus,(a, a) e R. So, Ris reflexive.
Symmetric: For anya, be A So, (b,a) e R.
Let (a, b)e R Hence,Ris not symmetric.
|b- al is divisible by 2 Transitive:Let a, b, c e Rsuch that aRb and bRc
’ la- b| is divisible by 2
(b, a) e R.:: (a, b)e R ’ (b, a)e R .:. Rissymmetric. Now, aRb ’ asb ..(i) and bRc bsc ...(ü)
Transitive: For any a, b, c E A From (i) and (ii), we have asbsc’asc .:. aRc
Let (a, b) e Rand (b, c) e R
Hence, relation R is transitive.
’ la- b] is divisible by 2 and |b- c is divisible by 2.
a-b=+2 k, and b -c= +2k, Vk,, k, EN 22. Wehave, A=(xeZ:0<xs12}
’ a-b+ b-c= +2(k, +k) a-c=+2 k3 kg EN A={0,1, 2, 3, ...12}
la-c is divisible by 2 ’ (a, c) e R.:. R is transitive. Also, S={(a, b):a, beZ,]a-blis divisible by 3}
Hence, Ris an equivalence relation.
Reflexive: For any ae A,
Expert Tips la- al = 0,which is divisible by 3
Tocheck equivalence relation, first confirm reflexivity.
Thus, (a, a)e S .:. S is reflexive.
then symmetry and finally transitivity of relation.
Symmetric: Let (a, b)e S
19. We have, A = {1, 2, 3, 4, 5, 6} and a relation on A
’ la-b|is divisibleby 3.
defined as R ={(a, b) :b=a+ 1}
Reflexive: Let (a, a) e R + |b-alis divisible by 3 ’ (b, a)eS i.e. (a, b) e S ’ (b, a) eS
a=a+1 ’ a-a=1’ O= 1, which is not possible. Sis symmetric.
. (a, a) R ’Ris not reflexive.
Symmetric: Let (a, b) e R b=a+1 ...)
Transitive:Let (a, b) eSand (b, c) e S
’ la-b| is divisible by 3 and |b-c is divisible by 3.
Now, if (b, a) e R
a=b+1’b=b+ 1+1 (using () ’ (a- b) = +3k, and (b-c)= +3k,: Vk,, kz e N
’ b=b+2 ’ b-b=2 ’0=2,which is not possible ’ (a-b) + (b - c)= +3(k, + k,)
(b, a) R ’Ris not symmetric. ’ (a-c) = +3(k, +k); V kq, k, e N
Transitive: Let (a, b) e Rand (b, c) e R ’ la-cl is divisible by 3 (a,c) e S..Sis Transitive.
b=a+1and c= b+1 ’ c=a+1+1
C=a+2#a+1(a, c) R’R is not transitive. Hence, S is an equivalence relation.

20. We have, R={(a, b) :2 divides (a- b)} Concept Applied G)

Reflexive:For anyae Z,a-q =0and 2 divides 0. Arelation Rina set Ais called
’ (a,a) e Rfor every a e Z :. Ris a reflexive. () reflexive, if (a, a) e R, for all ae A
alla, be A
(ii) symmetric, if (a, b)e R> (b, a)e R, for a,c)e
Symmetric: Let (a, b) e R (b, c) eR R.
(iii) transitive, if (a, b) eR and
2 divides (a - b)
a- b=2m, for some me Z
for alla, b, ce A
 23.
=2/2-2 is an irrational number.
s)Pke Let be an arbit any elmtnt blonging to NxN but (2. V2)eS as 2-/2+N2=2,which is rational number.
So, Ca, b) 6 N N. Sis not symmetric.
As a -a b - 0 Transitive:
(a,b) R (a,b)or al (a, b) e N*N Let x=-2, y=342,z =2
(-V2,3/2)es as -/2-3V2+V2=-342 is an irrational
Symmetiei number.
Let (a. b), (e,d)¬NN Suth that (a,b) R (e, d).
a-c« b-d Inivtn Relaken]
(3/2,2)eS as 3/2-2+2 -4/2-2 isan irrational number.
MulHplyng by-1) on bet sids. But (-V2,2)eR as -V2-2+W2=2 is a rational number.
Hence. C.d)e (a,b) Sis not transitive.
For Ca.b)RCe.d) +heris (e,d) &ra, for (a, b), te, d)eNsn
. Ris symnet i 26. Given, S={(a, b) :as b, ae R, be R}
For reflexive: For (a, a) e S, asa which is not always true.
Transitivihy: 1 1
lat Co,s), Ce.a). Ce.f)é NxN such that Co, 8) RCe, a)
and Ce.d) R (e, )
Let a= then a =8
om the tuo eisa. So, S is not reflexive.
a - c
d -f For symmetric: For (a, b) e S’asb
Let a = 1 and b = 2
a -ct c-e = b-d td
So
He nce,
a -e b
(a, b) RCe,f)
Then,1s 2° ie, a sb° but 2s 13 is not true ’ (b, a) zS
So, S is not symmetric.
For transitive : For (a, b, c) e S
Hence. Ris tans i tive Consider (a, b)e S’ asb³ ..0)
As R is lexive, Su mmutic and trans itive . henca R & e (b, c) e S’bs® ..)
eauivalna selattesn.
(Topper's Answer, 2024] From (i) and (i)
a s c ’ (a, c) S :. Sis not transitive.
a b
where a, b, c, de N
Hence, Sis neither reflexive, nor symmetric nor transitive.
24. Given,(a, b) R(C, d) *=
C d 27. Given, A= {1, 2, 3,4, 5, 6, 7} and
Reflexive:Let (a, b) R(a, b) *:a b
b
+1=1 R={la, b): both a and bare either odd or even)
R={(1, 1), (1, 3), (1, 5), (1, 7), (3, 3), (3, 5). (3, 7), (5, 5),
Thus, (a, b) R(a, b) for all (a, b) e NxN (5,7).(7, 7),(7,5), (7, 3), (5, 3), (7, 1), (5, 1), (3, 1), (2, 2),(2,4),
So, R is reflexive. (2,6), (4,4), (4,6), (6, 6), (6,4), (6, 2), (4, 2)}
Symmetric:Let (a, b), (c, d) e NxNsuch that (a, b) R (c, d) For reflexivity: (a, a) e R
ad =bc’ ch=da Here, (1, 1), (2, 2), (3, 3), (4,4), (5,5), (6, 6), (7, 7) e R
numbers)
(By commutativity of multiplication of natural Ris reflexive.
’ (c, d) R (a, b) For symmetric: If (a, b) e R, then (b, a) e R
NxN
Thus, (a, b) R(c, d) (c,d) R(a, b) for (a, b), (c, d) e Here, (1, 3), (3, 1), (1, 5), (5, 1), (1, 7), (7, 1), (2, 4), (4, 2), (2, 6),
(5, 7), (7. 5)e R
So, Ris symmetric.
N×N such that (0, 2), (3, 5), (5, 3), (3, 7), (7, 3), (4, 6) (6, 4),
Transitive : Let (a, b), (c. d), (e. ) e R is symmetric.
(a, b) R(C, d) and (c, d) R(e, f)
...() For transitivity:If (a, b) e Rand (b,c) e R, then (a, c)e R.
Now, (a, b) R(c, d) ad = bc
...(ii) If (a, b) are odd and (b, c) are odd, then (a, c) are also
and (c, d) R(e, f) ’ cf= de odd numbers.
Multiplying (i) and (ii), we get ad-cf= bc- de Ris transitive.
’ af= be ’ (a, b) R(e, f) Hence, R is an equivalence relation.
Thus, (a, b) R(c, d) and (c, d) R(e, f) ’ (a, b)R(e, ) It is observed that all the element of subset {1, 3, 5, 7} are
So, R is transitive. odd. Thus, they are related to each other because every
element is odd.
Ris an equivalence relation.
irrational number} Similarly, the elementof subset [2,4, 6} are even. Thus, they
25. We have, S={(a,b) :a-b+/2 is an are related to each other because every element is
even.
Reflexive:
is always irrational. So, elements of equivalenceclass [1] ={1, 3, 5, 7}
(a, a) e S ’ a-a+2=2 numbers as
28. Relation R is defined on the set of real
.. Sis reflexive.
R={(x, y):x*y is an irrational number}.
Symmetric: number
Reflexive: Let x= V3 which is an irrational
Let (V2,2)eS as v2-2+N2
 30. We have, A={xe Z:0Sx< 12}
Nowxx=x? =(V3)'=3, which is not an irrational number. A- {0, 1,2,3,..,12}
(x, x) eR and S- (la, b) :la - b| is divisible by 4)
’ Ris not reflexive. Reflexive:For any ae A, la - al =0, which is divisible
Symmetric:Let (x. y)e R, where xe Rand ye Ri.e. x yis an by 4. Thus,(a, a) e R:.Risreflexive.
irrational number. Symmetric: Let (a, b) e R
As, we know that multiplication of two real numbers i la - b| is divisible by 4
commutative. lb - al is divisible by 4 ’ (b, a) e R
i.e.. x y=y"x i.e., (a, b) e R ’ (b, a) e R.::Ris synmetric.
y"xis also an irrational number. Transitive: Let (a, b) e Rand (b, c) e R
Ja - b| is divisible by 4 and (b - c is divisible by 4
(y. x)eR
Ris symmetric. a -b=t 4k, and b-c=+4k,;ky, k, ¬N
Transitive:Let x=2.y=N3 and z=3 ’ (a-b) +(b- c) =+4 (k, +k,) ; k, kzeN
’ a-c= t4(k, +k); k, k, eN
Now. x y= 2xv3=2/3, which is an irrational number. la - c is divisible by 4 ’ (a, c) e R
(x, y) e R
Ris transitive.
and y z = V3x3=3/3, which is an irrational number. Hence, R is an equivalence relation.
(y, z) e R The set of elements related to 1 is{1,5,9}.
But x-z =2 x3=6, which is not an irrational number. Equivalence class for [2] is {2, 6, 10}.
(x,z) e R
Ris not transitive. Concept Applied G
Concept Applied( ) In arelation R is defined on a set A, the set of all
elements related to any element a E A is denoted by
A relation R in a set A is not refiexive if for (a, a) e R
[a i.e., [a] =(xeA:x, a) e R}
ae A. Here, [a] is called an equivalence class of ae A.
A relation R in a set A is not transitive if for (a, b) e R
and (b, c)e Rbut (a, c) e R. 31. (d):Since,domain of e is (- oo, oo) and
29. Reflexive: Let (a, b) be an arbitrary element of Nx N.
Domain of log x is (0, oo)
Domain of (f+g) xis the intersection of domain of f(x)
ab(b + a) = bala + b) and g(x), which is (0, o)
(by commutativity of addition and multiplication on N] So, Assertion (A) is false.
(a, b) R (a, b) Assertion (A) is false, but Reason (R) is true.
So, R is reflexive on Nx N. 32. (d): Here,f:Z’Z as f(x) =3x -5
Symmetric: Let (a, b), (c, d) e NxN such that Let a, b E Z
(a,b) R(c. d). Taking f(a) =f(b)
ad(b +c) =bcla +d)’cbld+a) =da(c +b) 3a -5 =3b- 5 3a =3b’a=b
[by commutativity of addition and multiplication on N] f(x) is an injective.
Thus, (a, b) R (c, d) (c, d) R (a, b) for all (a, b), (c, d) e NxN. For ye Z,y = 3x - 5
So, Ris symmetric on Nx N. ’ 3x = y+ 5
Transitive:Let (a, b), (c, d), (e, f)e Nx N such that
e Z For yeZ
X+5

3
(a, b) R(c, d) and (c, d) R(e, f). Then,
(a,b) R (c, d) ’ ad(b +c) =bcla +d) f(x) is not a surjective.
Hence, fw) is not bijective.
b+c a +d 1 1 1 1 Assertion is false
..()
bc ad ca d Clearly, Reason is true.
and (c, d) R(e, f) ’ cfd + e) = de(c + f) Concept Applied G
d+e ctf 11 11 .i) S If for a function co-domain * range, then the
de c ecf function is not onto.
Adding (i) and (ii), we get
33. (c): Letf(x) =f(x2)
9x? +óx,-5 =9x +Óx,- 5
1 1 1 1 b+e a+f ’ 9x-x)+ó(x, - x2)=0
be a f be af ’ (x-x, )|9(x, +x2) +ó] =0
’ af(b+e) =bela +f) ’ (a, b) R(e, f) >0
XË -X) =0 as 9(x, +x,) + 6non-negative real numbers)
So, Ris transitive on Nx N. (." A1,X2 are
Hence, Ris an equivalence relation. X1= X
Thus, fis one-one. A A
Let ye [-5, oo) be such that fx) = v 1
Now. fx) =9x?+ 6x-5=9x + 6x +1- 6= (3x + 1)2 - 6 2 2
’yt6= (3x +1)2
3
3x+ 1= Vy+6 X= -1+vy+6
3 A

Ey f(x) is onto. Asfis one-one, so no two element of Ahas same image in A.

So, the given function is bijective. f(4) =3 ’ k=3

Expert Tips Concept Applied ()

Not all polynomial functions are onto by default. For a function to be one-one, no two elements
Always check for the co-domain while determining a should have the same image in A.
function is onto.
40. Given, flx) = [x] where[Jdenotes the greatest integer
34. (d): Given, f(x)=x- 4x+5 function.
Here f(0) =f(4) =5 Put x = 1.1 in f(x), we get
Hence, fx) is not one-one. f(1.1) =(1.1] =1
To check whether the function is onto or not, we have to Putx = 1.2 in fx), we get
find range of function.
Let y =x?- 4x + 5 -4x +5-y=0 f(1.2) = [1.2] = 1
Thus, 1.1, 1.2 e R ie., domain and 1.1 # 1.2 but
D= (4)2 - 4(1) (5 - y) >0xeR
16- 20 + 4y>0 4y - 4>0 f(1.1) =f({1.2) = 1
’ 4(y- 1) >0’ y >1 ’ fx) is not one-one.
Hence, range = (1, o) 1
Now,let eR i.e., co-domain, but [x]=2 is not possible.
Here,Co0-domain# Range
So,fx) is not onto. So, f(x) is not onto.
35. (d): We have, f(x) =4+3 cosx, xe R 41. We have, f:A-B, A={1, 2,3, 4)} suchthat
flx) = 2x is one-one and onto.
At x-1=4+ 3cos-4 -4+3co--4 Range f= co-domain of f and every element of Ahas
unique image in B.
TU
Since,
15-1Ju 2
Now,
f(1) =2 x1=2
Therefore, fisnot one-one. f(2) = 2 x 2=4
As -1< cos x< 1, XER’1<4+3 cos x<7,xeR f(3) = 2 x 3 =6
’ fx)e [1, 7], where [1, 7] issubset of R. .. fis not onto. f(4) = 2 x 4=8
Concept Applied (Ø B={2,4, 6, 8}
S Range of cos x is (-1, 1). n-1, ifniseven
42. Given, f(n)=
n+1, if nis odd
36. (d): :f:X’ Y is one-one, if different element of
X have different image in Y under f. But here, no such For injection: Ifn is odd, fn) =n+1
situation is possible. For a, be N such that f(a) = f(b)
37. (d): Given fx) =, for all xe R a+1=b +1 ’ a=b
fn) is one-one.
Atx =0 eR, f%) is not defined. nis even, fln) = n-1
[n+1 ifn is odd
For a, be N such that f(a) = f(b)
2 a-1=b- 1’ a =b
38. (c): Given, f(x) = n
ifn is even fn) is one-one
2 Hence, fln) is injective for Vne N.
Now, f(1) =
1+1
=1, f(2)==1 For surjection:
2 2 If n is odd, f(n) = n+ 1
’ f(1) = f(2) but 12 .:. fis not one-one. For everyne N,y=n-1 in Nsuch that
But fis onto (.range of f is N.) fly) =n- 1+1=n
39. We have, A =(1, 2,3, 4),function f:A ’A is one-one Ifn is even, f(n) = n -1
and f(1) =2,f(2) =4, f(3) = 1, f(4) = k
For every ne N, y n+ 1 in N such that Clearly. function is not one-one as S, and S, are mapping
fly)=n+ 1 -1 =n on J,.
f(n) is surjective for Vne N Therefore. f is not one-one.
Thus, the function f:NNis abijection. Hence,it is not bijective,
43. We have, (ii) (a) Number of one one functions frorn StoJ-0asn<m
OR
S-(S,. S,.S,. S,]. J =0,.J,. Jl andRbe arelations defined as (ii) (b) Relation R, (S,. S,). (5,. S)} is defined on set S.
R=(x.v]:speaker xis judged byjudge y, xe S, ye J} For R, to be reflexive, (S,, S;). (S,, Sz). (S,, Ss). (S, S) rmust
(0 Total possible relations from Sto J =24-3 =212 be added.
Hence, number of minimum ordered pairs to be included
() Given,f- (S,. J). (,. J). (S,. J2). (S,. J) ) =4

44

Am

As

lmet
[Topper's Answer, 2023]
OR 4x(3y + 4) = 4y(3x + 4) ’ 12xy + 16x = 12xy + 16y
(ii) (First part) 16x =16y ’ X=y .. fis one-one.
We have, R = {(x, y):x andy are students of the same sex} Onto: Let y be an arbitrary element of R. Then f(x) = y
Reflexive:Clearly R is reflexive, as (x, x) e R 4x
2vY ’ 4x= 3xy + 4y ’4x-3xy = 4y ’X=. 4y
Symmetry: Let (x, y)e R 4-3y
xand y are of same sex
(y,x) e R
As yeR-1a 4-3y -eR
Rissymmetric
4y 4y 4
Transitive: Let (x, y) e Rand (y,z) e R Also,
4-3y 3
as if
3 ’ 12y =12y-16,which
4-3y
xand y are of sarne sex and yand z are of same sex
Xand z are of same sex is not possible.
,z) e R
Thus, X= 4y -eR such that
Ris transitive. 4-3y
Hence, Ris an equivalence relation.
4x 16y 16y
45. The function f:R is given by f(x)=
3x +4 12y +16-12y 16

One-one:Let x.yeR 3
such that f(x) =(y)
4x 4y So,every element in R
|3
has pre-image in R
3x+4 3y+4 fis not onto.
 X= 1,x -2
46. Given. f(x) e(-o,0) So, possible values of xare 1 and- 2.
1-x (: xe (-, 0), Jx| =-x) 49. For fto be one-one: let x, X, e A, then fu) fu,)
For one-one: Let fx,)=fx). X, X, E (-oo,0) XË-3_X-3
xË-5 X-5 XXy-3xy-5x,+15=xX,-5x,-3%, +15
’ x(1- x,) =x(1 - x)
1-x 1- X 2x, =2x1 ’ X,=X, ’ f(x) is one-one.
X- X;X2 =X2-XX X1= X, For onto :
Thus. fx;) =fx), X*X .:. fis one-one X-3 5y -3
Let y= ’yx- 5y =X-3’ yx-x= 5y-3 x=
X
X-5 y-1
For onto: Let fx) =yy= 1-x
’ y(1-x) =X ’ y- xy =X Range =R-(1] =BRange =Co-domaín
’ XtXy =y ’ x(1+y) = y ’ x= fx) is onto.
1+y
Here, ye (-1,0)
So.x is defined for all values of y in codomain. :. fis onto.
Concept Applied (G 1. (d): (A) is false but (R) is true. (1)
Afunction f:A Bis called 2. (i) Let xe U
but (x, x)e Ras the difference in time
(i) one-one or injective function, if distinct betweenx &xis 0 hours.
elements of Ahave unique images in B. Ris not reflexive. (14)
i.e., for a, be A,fa) = f(b) ’ a=b Let (x, y) e R,x, ye U’ the difference in time between x
(i) onto or surjective function, if for every element
be B, there exists some a E Asuch that fla) =b.
and y is 6 hours, the difference in time between y and x is
also óhours i.e.,(x, y)e R (y,x)eR. (1%)
2x Ris symmetric.
47. We have. f(x)= Difference in time between x and y is 6 hours, and the
1+x2
difference in time between yand z is als0 6 hours, then the
For one-one:Letfx) =fx) 2x4 2x2 difference in time between x and z could be either Ohours
1+x 1+x or 12 hours. That is, (x, y)e R& (y, z)e Rbut (x, z) R. (14)
XËt XX, =X, +XfX,= X1-X) +XXzlxy- X)=0 Ris not transitive.
k-X,)(1 -xX,) =0’ x, =X, or xX, =1, if x1#X2 (ii) : R is not reflexive & transitive Ris not an
’ fx) is not one-one function. equivalence relation. (1/2)
3
yx2- 2x+y=0 (a, b)Let (a, b) be an arbitrary element of N x N. Then
2x
For onto: Let y=: 2 y+x'y-2x=0 e Nx Nand a., be N
We have, ab = ba; (As a, be N and multiplication is
2+y4-4y2 1ty1-y commutative on N)
2y ’ (a, b) R(a, b), according to the def1nition of the relation
Ron NxN
Now, forfx) =2 =y, there exists no real value of xe R.
fx) is not onto. Thus (a, b) R(a, b), (a, b) e NxN
So, Ris reflexive relation on NxN (1)
We can see that, for xe R, 1-y? 20 Let (a, b), (c, d) be arbitrary elements of N x N such that
’1-y'20 ’ y2s1’ -1sys1 (a, b) R(c, d).
So, fx) is onto if ye (-1, 1] Then, (a, b) R(c, d) ad= bc = bc = ad; (changing LHS and
Required set A=[-1, 1]. RHS)
48. We have, fx) = x² +x + 1 cb=da,: (Asa,b,c,de Nandmultiplication is commutative
For one-one: Let f(x) =fx) on N)
’ c, d) R(a, b); according to the definition of the relation
Ron NxN
’ (K1-x) [x, +x,+ 1]=0 X- X, =0or X t x,,=-1
= Thus (a, b) R(c, d) (c, d) R(a, b)
X * Xz,then x, +X, =-1. f(x) is not one-one So, Ris symmetric relation on NxN (1)
For onto:Let y =x +x+ 1’ x?+x +(1-y) =0 Let (a, b), (c, d), (e, )be arbitrary elements of NxN such
that
-1+(1-4(1-y) -1tJ4y-3
(a, b) R(c, d) and (c, d) R(e. f).
2 2
For negative values of y, there is no real value exists for x. Then (a,b)R(c.d)’ ad=bc|
i. fx) is not onto. (c,dR(e.f)f=de
(ad)(cf)=(bc)\de) » afbe
Now,fx) =3 x2 +x+1=3x+x-2 =0 (a, b) R(e, f: (according to the definition of the relation
.-1+V1+8 -1+3 +3 Ron Nx N)
2 2 2 2 Thus (a, b) R(c, d) and (c, d) R(e, f) > (a, b)R(e, f)
So, R is transitive relation ofNxN. (1) The given function f: {1, 2, 3} ’ {x, y, z, p} is one one
As the relation R is reflexive, symmetric and transitive so, as for each element of {1,2, 3}, there is different imagein
it is equivalence relationon Nx N. (x, y, z, p} under f.
[(2, 6)] ={(x. y)e NxN:(x.y) R(2, 6)) (1) Reason is true.
(1)
={(x, y) e NxN:3x = y} {(x, 3×) : xe NJ ((1, 3), (2, 6). 8 (i) Number of relations is equal to the number of
(3,9)...] (1) subsets of theset BG- 2nB<G)
4 We have, a relation R on Xsuch that, (A, B)e Riff AcB
- 2rntB)n(G) =23:2 =2% (1
for A,Be P(X). (1/2) (ii) Smallest equivalence relation on Gis {(g1,g), (g, 3%).
Reflexive:Clearly every set is a subset of itself.
(A, A) e R (31.32). (3:s)} (1
Ris reflexive. (1) (ii) (a) reflexive but not symmetric
Symmetric: Let (A,B) ¬ R ={(b,. b,). (b, b,). (b,, b,). (b,, b,). (b, b.), (b,, b)}.
ACB
So, the minimum number of elements to be added are
B is a super set ofA. (1/2) (b, b,),. (b., b,). (b, b¡), (b,, b,) (1
BaA (B, A)e R
Ris not symmetric. (1) {Note : It can be any one of the pair from, (b, b.).
Transitive: Let (A, B) e Rand (B,C)e R. for all A. B.Ce P(X (b,, b3), (b3, b,) in place of (b2, b,) also}
AcBand BcC AcBcC (1/2) (B) reflexive and symmetric but not transitive
AcC’ (A,C) eR ={(b, b2). (b, b,). (b, b,). (b, b,). (b, ba). (b,, b,). (b,, ba).
Ris transitive. (1) So the minimum number of elements to be added are
Hence, Ris reflexive and transitive but not symmetric. (b, b,). (b, b,), (b,, b,). (b, b), (b, b,) (1)
(1/2) {Note: We can also take (b4, b), (b3, b,) in place of (b, ba),
5 Reflexive: Let (a. b)e NxN. Then ab =ba (bs. b,)}
(By commutativity of multiplication of natural number) OR
(a. b) R (a. b)
Thus,(a, b) R(a, b)for all(a, b)e NxN (ii) (b)Given, x=4y. Let y =f(x)= 4
So, R is reflexive. (1)
Symmetric: Let (a, b), (c.d) e NxN such that (a, b) R(c, d) Let x,, x e [0, 20/2] such that
ad =bc’ ch= da
fx)=fx,) í_x
(By commutativity of multiplication of natural numbers) 4 4
’ (c, d) R (a, b)
Thus,(a, b) R(c, d) = (c, d) R(a, b) for (a, b), (c, d) e NxN XË =Xy as X1, Xy [0, 20V2] (1)
So,Ris symmetric. (1)
fis one-one function
Transitive : Let (a, b), (c, d), (e. f) e N xN such that Now, Osys 200, hence the value of y is non-negative and
(a,b) R(c, d) and (c, d) R(e, f)
Now, (a, b) R (c, d) ’ ad = bc ...) f(2/y)=y
and (c, d) R (e, f) cf= de ...(i) For any arbitrary ye [0, 200), the pre-image of y
Multiplying (i) and (i), we get ad-cf = bc-de (1) exists in [0, 20/2]. Hence, fis onto function. (1)
af - be ’ (a, b) R (e, f) 9. () Assume f(x) = f(y) and evaluates the same as:
Thus, (a, b) R(c,d) and (c, d) R(e. ) ’ (a, b) R(e, f) (1)
(1%)
So, R is transitive. x²-1 y'-1
R is an equivalence relation. (1)
x(y'- 1) =y(x? - 1) ’ xy?-x-yx? +y=0
6. (a): YA y=SeC X (y- x)(xy+ 1) =0 (1/2)
X=yor xy =-1.
--- y=2 1 2 2 (1)
-º y=1
For x = and y = -2, f(x) =
3
and f(y) = -3
ºX 1
-2T 2T
y=-1
fis not one-one as
2 S2 »]t-3)
X
(ii) Let fx) = y’ x=yx² - y yx?-x -y=0
y2. 1 =y
y=2 cutsthe graphat two points 1t1+4y' (14)
fx) = sec x is not one-one ’X=
Both (A) and (R) are true and (R) is the correct explanation 2y
of (A). (1) Since 1+ 4y² >0, real root exists and also they are not t1
7. (d):The element 4has no image under relation fis X
1t1+4y2-eR--1, +1}
not a function. So, Assertion is false. 2y
 Cor any ye R (Codomain), there exists x ¬ R --1, 1 Case :When x<0, we have f(x)= X
(domain) such that fx) =y. Hence fis onto (1/2) 1-X
X Injectivity: Let x, ye R i.e., X, y < 0, such that fx) =fly).
-if x 20
1+X
10. We have, f(x) = X then=-x-y
1-x 1-y
=y-xy ’ x=y
,if x <0 (1/2)
|1-x So, fis injective function.
X
Now, we consider the following cases Surjectivity :x <0,we have f(x)=<0
1-x
X X 1
Case 1:VWhen x> 0, we have f(x)=: (1/2) also, f(x)=-1+: ->-1;-1< fx) <0
1+x 1-x 1-x

Injectivity :let x, ye R*u{0} such that f(x) =f(y), then Let y e (-1, 0), be an arbitrary real number and there

X ’ X t Xy= y+Xy ’X=y (1/2) 1+y-=y.

1+x 1+y exists x=
1+y
c0 such that. fi)=f 1+y
-<0
1
So.fis injectivefunction. 1+y

and
X xists x=<0
So, for y e(-1, O), there exists x= such that
Surjectivity : when x > 0, we have f(x)=^>0
1+x 1+y
fx) =y.
1 (1/2)
flx)=1-<1,as X>0 (1/2) Hence, fis onto function on (-oo, 0) to (-1,0).
1+x
Case 3: Injectivity:Letx > 08&y<0such that fx) =fly)
Let y e[0, 1), thus for each y el0, 1), there exists ’
1+x 1-y
1-y
)=IY=y.
X=0 such that fx)=- (1%) ’ X- Xy =y+xy’x-y= 2xy, here LHS >O but RHS<0.
1-y which is inadmissible.
1+.
1-y Hence, fx) fly)when x *y.
Hencef isone-one and onto function. (1)
So.fis onto function on [0, o) to [0, 1).