CHAPTER

Relations and
1 Functions
 Previous Years' CBSE Board Questions

1.2 Types of Relations 12. Let R={(a, a) :a is aprime number less than 5} be a
relation. Find the range of R. (Foreign 2014)
MCQ 13. Let R be the equivalence relation in the set
1 Let A={3, 5). Then number of reflexive relations on A A
={0,1, 2,3,4,5) given by R={(a, b) :2 divides (a - b)}.
is Write the equivalence class [0j. (Delhi 2014 C)
(a) 2 (b) SAI
(c) 0 (d) (2023) (2 marks)
2. Let Rbe a relation in the set Ngiven by 14. Check if the relation Rin the set R of real numbers
R={(a, b) :a=b- 2, b> 6). Then defined as R = {(a, b) : a< b} is () symmetric,
(a) (8,7) e R (b) (6,8) e R (ii) transitive. (2020)
(c) (3,8) e R (d) (2, 4) e R (2023) | 15. Let W denote the set of words in the English
3. A relation R is defined on N. Which of the following is dictionary. Define therelation Rby
the reflex0ve relation? R={x, y)e Wx Wsuch that xand yhaveat least one
(a) R={(x, y): x >y, x, ye N] letter in common).
(b) R={(x, y):x+y= 10, x, ye N} Show that this relation Ris reflexive and symmetric,
but not transitive. (2020)
(c) R={x, y): xy is the square number, x, ye N}
(d) R={(x, y): x+4y=10, x, ye N} LAI (4 marks)
(Terml, 2021-22) An 16. Show that the relation Rin the set A=(1, 2, 3, 4, 5,6}
4. The number of equivalence relations in the set given by R= {(a, b) : la - b< is divisible by 2} is an
{1,2, 3} containing the elements (1, 2) and (2, 1) is equivalence relation. (2020)
(a) 0 i (6)1 17. Check whether the relation R defined on the set
(c) 2 (d) 3 (Term I, 2021-22)
A={1,2, 3,4, 5, 6} as
5. Arelation R is defined on Z as aRb if and only if R = {(a, b) : b =a + 1} is reflexive, symmetric or
a2-7ab+ 6b2 = 0. Then, Ris transitive. (2019)
(a) reflexive and symmetric 18. Show that the relation R on the set Z of all integers,
(b) symmetric but not reflexive given by
(c) transitive but not reflexive R={(a, b) : 2 divides (a - b)} is an equivalence relation.
(d) reflexive but not symmetric (2019)
(Term 1, 2021-22)(Ap 19. Show that the relation R on R defined as
6. Let A= {1, 3, 5). Then the number of equivalence R= {(a,b):asb}, is reflexive and transitive but not
symmetric. (NCERT, Delhi 2019)
relations in Acontaining (1, 3) is
(a) 1 (b) 2 20. Show that the relation S in the set A-xeZ:0<x<12}
(c) 3 (d) 4 (2020) given by S={la, b) : a, be Z, la-bl is divisible by 3} is
7. The relation Rin the set {1, 2, 3} given by R = {(1, 2), an equivalence relation. (AI2019) (Ap
(2, 1), (1, 1)} is 21. Let A =(1, 2, 3, ., 9} and R be the relation in
(a) symmetric and transitive, but not reflexive A x A defined by (a, b) R (C, d) if a + d = b+ c
(b) reflexive and symmetric, but not transitive for (a, b), (c, d) in Ax A. Prove that Ris an equivalence
(c) symmetric, but neither reflexive nor transitive relation. Also obtain theequivalence class [(2, 5)].
(d) an equivalence relation (2020) (Delhi 2014)
VSA (1 mark) 22. LetR be a relation defined on the set of natural
numbers N as follow:
8. Write the smallest reflexive relation on set A={a, b, c}. R={x,y)xe N,ye Nand 2x+y=24}
(2021 C) Find the domain and range of the relation R.
Also, find if Ris an equivalence relation or not.
9. Arelation Rin a set Ais called ,if (a,, a,)e R (Delhi 2014 C) An)
implies (a,, a,) e R, for alla,, a, EA. (2020) (R LA II (5/6 marks)
10. Arelation in a set Ais called relation, if each
element of A is related to itself. (2020) (R 23. If N denotes the set of all natural numbers and R
is the relation on N xN defined by (a, b) R(c, d), if
11. If R={(x, y) :x +2y =8} is a relation on N, write the ad(b + c) = bcla + d). Show that R is an equivalence
range ofR. (AI 2014) relation. (2023, Delhi 2015)
Relations and Functions 5
24. LetA={xe Z:0sx<12}. Show that R={(a, b) : a, be A,
LAI (4 marks)
la-b\ is divisible by 4}, is an equivalence relation. Find
the set of all elements related to 1. Also write the 31. Case Study : An organization conducted bike race
equivalence class [2]. (2018) under two different categories - Boys and girls.
25. Show that the relation Rin the setA ={1,2,3,4,5) given There were 28 participants in all. Among all of them,
by R={(a, b) : Ja - b| is divisible by 2} is an equivalence finally three from category 1 and two from category
relation. Write all the equivalence classes of R. 2 were selected for the final race. Ravi forms two
(AI 2015 C) sets B and G with these participants for his college
project.
1.3 Types of Functions Let B={b,b, ba} and G= g1, 82},where Brepresents
the set of Boys selected and G the set of Girls
MCO selected for the final race.

26. The function f:R’ R

defined by f(x) =4+3 cosx is
(a) bijective (b) one-one but not onto
(c) onto but not one-one
(d) neither one-one nor onto (Term I, 2021-22) An
27. The number of functions defined from
{1, 2, 3,4, 5}’{a, b} which are one-one is
(a) 5 (b) 3 Based on the above information, answer the
(c) 2 (d) 0 (Term I,2021-22) following questions.
28. Letf:R’R be defined by fk) = 1/%, for allxe R, Then, (i) How many relations are possible from Bto G?
fis (ii) Among all the possible relations from B to G,
(a) one-one (b) onto how many functions can be formed from Bto G?
(c) bijective (d) not defined
(Term I, 2021-22)
(ii) Let R:B’ Bbe defined by R= {(x,y) :x and
yare students of the same sex}. Check if R is an
29. Thefunction f:N’Nisdefined by equivalence relation.
n+1 OR
2
,ifnis odd
fln) =
n
function f: B’ Gbe defined by f= {(b, 8), (b2, 82),
A
ifn is even (b3, 8)}. Check if f is bijective, justify your answer.
2'
The function fis
(2023) Ap
(a) bijective 32. Let >R be a function defined as
(b) one-one but not onto
(c) onto but not one-one 4x
f(x)= Showthat f is a one-one function. Also,
(d) neither one-one nor onto 3x+4
(Term I, 2021-22)Ev check whether f is an onto function or not. (2023)
VSA (1 mark)
33. Show that the function f:(-oo, 0) ’ (-1, 0)defined by
30. Iff= {(1, 2), (2, 4), (3, 1), (4, k)} is a one-one function X
fx)= XE (-oo, 0) is one-one and onto. (2020)
from set A to A, where A = {1, 2, 3, 4), then find the 1+lx|'
value of k. (2021C)
 Previous Years' CBSE Board Questions
R,= {(1,2), (2,1), (1, 3), (3, 1) (2, 3), (3, 2), (1, 1), (2, 2), (3, 3))
Number of equivalence relations is 2.
1. (b):Total number of reflexive relations on aset having ConceptApplied G)
n number of elements = 2n² -n A relation R in a setA is called an equivalence
Here, n=2 relation, if R is reflexive, symmetric and transitive.
Required number of reflexive relations =222-2
= 24-2=22 = 4 5. (d):Given, aRb, a, be Z
Reflexive: For a E Z, we have
2. (b):Given,R={(a, b) :a =b-2, b> 6} a²- 7aa+ 6a² =a-7a+ 6a =0’a, a) e R
Since, b>6, so (2, 4) R
Also, (3, 8) Ras 38-2 . Relation is reflexive.
and (8,7) Ras 8+7-2 Symmetric: Since, (6, 1) e R
Now, for (6,8), we have As, 62-7x6x1+6x 12 =36- 42 +6=0
8>6and 6=8-2, which is true But (1, 6) e R. .. Relation is not symmetric.
(6, 8)e R 6. (b):Equivalence relations in the set containing the
3. (c): Consider, R=(%,y):xyis the square number, element (1, 3) are
As. XX = x2, which is the square of natural
x,ye N) R, ={(1, 1), (3, 3),(1, 3), (3, 1), (5, 5)}
number x. R,= {(1, 1),(3, 3),(5, 5),(1, 5),(5, 1),(3,5),(5,3),(1,3), (3, 1)}
K,x)e R. So, Ris reflexive. There are 2 possible equivalence relations.
Concept Applied 7. (c):Given R = {(1, 2), (2, 1), (1, 1)} is a relation on set
{1,2,3]
Arelation Rin a set Ais called reflexive, if (a, a) e R, Reflexive:Clearly (2,2),(3,3) = R
for all a E A. .Ris not a reflexive relation.
4. (c):Equivalence relations in the set [1,2, 3} Symmetric: Now,(1,2)e Rand (2, 1) eR.:. Rissymmetric.
the elements (1, 2) and (2, 1) are containing Transitive : Now, (2, 1)e Rand (1, 2) e Rbut (2, 2) e R
Ris not transitive relation.
R, ={(1,2), (2, 1), (1, 1), (2, 2), (3, 3)) Rissymmetric, but neither reflexive nor transitive.
 Relations and Functions

8. We have, A ={a, b, c (ii) Symmetric: For any a, be A

relation Ron the set A is said to be reflexive if (a, a) e R, Let (a, b) eR
aeA ’ la-b| is divisible by 2= |b- al is divisible by 2
R={(a,a), (b, b), (c, c)} is the required smallest reflexive (b, a) e R.:. (a, b)e R ’ (b, a) e R .:. Ris symmetric.
relation on A. (ii) Transitive:For any a, b,ce A
Arelation Rin a set Ais called symmetric, if (a,, a,)eR Let (a, b)e Rand (b, c)e R
implies (a,, a,)e R, for all a,, a, e A. la-b| is divisible by 2and Jb- cis divisible by 2.
a-b= #2 k, and b -c= +2k, V k, k,E N
10. Arelation in a set Ais called reflexive relation, if each a-b+b-c= +2(k, +k) ’ a-c=+2 k, kg EN
element of A is related to itself.
’ la-c is divisible by 2 ’ (,c) e R.:. Ris transitive.
11. Here, R={(x, y) :x+ 2y =8x, ye N]. Hence, R is an equivalence relation.
For x= 1, 3, 5,.
X+2y= 8 has no solution in N. 17. We have, A {1, 2, 3, 4, 5, 6} and a relation R on A
For x= 2, we have 2 + 2y =8y=3 defined as R ={(a, b) : b=a+1}
Reflexive:Let (a, a) e R
For x= 4, we have 4+2y =8y=2 a-a=1’0=1, which is not possible.
’ a=a+1 ’
For x= 6, we have6+2y=8’y=1 (a, a) R ’Ris not reflexive.
For x=8, 10, .. Symmetric: Let (a, b) e R ’b=a+1 ..()
X+ 2y= 8 has no solution in N.
Range ofR={y:(x, y)e R}={ 1, 2, 3} Now,if (b, a) e R
..
a=b+1’b=b+1+1 (using (i)
12. Given relation is b=b+2 ’ b- b=2 ’0=2, which is not possible
R={(a, a):aisa prime number less than 5}. ’ (b, a) RR is not symmetric.
. R={(2, 8),(3, 27)}. So, the range of Ris{8, 27). Transitive:Let (a, b) e Rand (b, c) e R
13. Here, R= {(a, b): 2 divides (a -b)} ’ ba+1and c=b+1’ c=a+1+1
Equivalence class of [0] ={ae A: (a, 0) e RJ. c=a+2+a+1’(a,c) R’Ris not transitive.
(a-0) is divisible by 2and ae A ’ q=0,2,4
18. We have, R ={(a, b) :2 divides (a - b)}
Thus [O] ={0, 2,4). Reflexive:For any ae Z,a - q=0 and 2 divides 0.
14. We have, R={la, b) : a < b}, where a, be R ’ (a, a) e Rfor every ae Z.:. R is a reflexive.
() Symmetric: Let (x, y) e R, i.e., x Ry X<y Symmetric: Let (a, b) e R
Buty <x, so (x, y)eR (y,x)R 2 divides (a-b)
Thus, Ris not symmetric. a-b=2m, for some meZ
(i) Transitive: Let (x,y), (y, z) eR b-a=2m
X<yand y<Z ’ X<z 2 divides b- a
’
’ x,z)e R. Thus, R is transitive. (b,a) e
Ris symmetric.
15. We have, R={(x, y)e Wx W:xand y haveat least one Transitive: Let (a, b) e Rand (b, c) e R
letter in common 2divides(a - b) and 2divides (b-c)
Reflexive : Clearly (x, x) e R, because same words will a-b=2m and b -c= 2n for some m, ne Z
contains all common letters.
a -b+b-c= 2m + 2n
Ris reflexive. a-c=2(m +n)
Symmetric:Let (x, y)e Ri.e. xand yhave at least one letter 2 divides a - c
incommon. (a, c) e R
y and x will also have at least one letter in common. Ris transitive.
(y,x) eR Hence, R is an equivalence relation.
’ Rissymmetric.
Transitive: Let, x= LAND, y = NOT and z= HOT 19. We have, R={(a,b): asb, a,beR}
Clearly (x. y)e Rasxand y have acommon letter and (y, z) (0 Reflexive : Since asa : aRaaeR
E Ras yandz have 2 common letters. Hence, Ris reflexive.
bsa
but (x, z) Ras xand z have no letter incommon. (ii) Symmetric: (a,b)eR suchthat aRb ’ asb
Hence, Ris not transitive. So, (b, a) e R.
Hence, Ris not symmetric.
ConceptApplied )
(iü) Transitive: Let a, b,c e Rsuch that aRb and bRc
Arelation Rin a setA is not transitive if for (a, b)e R Now, aRb ’ asb .. 0) and bRc ’ bsc ...(1)
and (b, c)e Rbut (a, c) R
From (i) and (ii), we have asbsc’asc .:.aRc
16. We have, A={1, 2, 3, 4, 5, 6} and R={(a, b) : la - b| is Hence, relation Ris transitive.
divisible by 2} 20. Wehave, A={xeZ:0sx<12}
0) Reflexive: For any a¬ A A={0, 1,2, 3,..,12}
la-al =0, which is divisible by 2.
Thus, (a, a) e R. So,Ris reflexive. Also, S={(a, b):a, beZ,<a-blis divisible by 3}
(i) Reflexive: For any a e A, Range of R= (2,4,6, 8, 10, 12,.., 22}
la-al =0, which is divisible by 3 Ris not reflexive as if (2, 2)e R2x2+2=6+ 24
Thus, (a, a)eS :. Sis reflexive. In fact Ris neither symmetric nor transitive.
(i) Symmetric: Let (a, b) e S ’ Ris not anequivalence relation.
» la-b|is divisible by 3. 23. (i) Reflexive: Let (a, b) be an arbitrary element of N
xN. Then, (a, b)eNxN
’ |b-alis divisible by3 ’ (b, a)eS i.e. (a, b)eS ’ (b,a) eS ’ ablb+ a) =bala +b)
Sissymmetric. [by commutativity of addition and multiplication on N]
(iii) Transitive: ’ (a, b) R(a, b)
Let (a, b) e Sand (b, c) e S So, Ris reflexive on NxN.
’ la-b| is divisible by 3and |b -c is divisible by 3. (i) Symmetric: Let (a, b), (c, d) e NxNsuch that
(a-b) = +3k, and (b -)= +3k,; Vk, ky e N (a, b) R(c, d).
’ (a-b) +(b-) =*3(k, +k) ’ ad(b+c) =bc(a +d) ’ cbld +a) =dalc + b)
[by commutativity of addition and multiplication on NÊ
’ (a-c) = +3(k, +k); k4, k, e N Thus, (a, b) R(c, d) ’ (c, d) R(a, b)for all (a, b), (c, d) e NxN.
’ la-c is divisible by 3 (a, c) e S.:Sis Transitive. So, Ris symmetric on NxN.
Hence, S is an equivalence relation. (iii) Transitive: Let (a, b), (c, d, (e, f)e Nx N such that
(a, b) R(c, d) and (c, d)R (e, f). Then,
Concept Applied (G) (a, b) R(c, d) ’ ad(b +c) =bc(a +d)
A relation Rin aset Ais called b+c a+d
(i) reflexive, if (a, a)e R, for all ae A 1,1 1, 1
bc ad ..i)
(ii)`symmetric, if (a, b) e R (b, a) e R, for all a, be A
(iii) transitive, if (a, b) e R and (b, c) e R ’(a,c)eR, and (c, d) R(e, f)’ cfld +e) =de(c +f)
for all a, b, ce A d+e c+f 11 1
de cf
..ii)
21. Given A={1, 2, 3,4,..9} f
To show:R is an equivalence relation. Adding (i) and (ii), we get
(i) Reflexive: Let (a, b) be an arbitrary element of Ax A.
Then, we have (a, b) e A xA’a,beA
a+b=b+a (by commutativity of addition on AcN) 1 1 11 b+e a+f
’ (a, b) R(a, b) e a f be af
Thus, (a, b) R(a, b) for all (a, b) e AxA. So, Ris reflexive. ’ af(b +te) =bela +f) ’ (a, b) R(e, f)
(ii) Symmetric:Let (a, b), (c, d) e AxAsuch that (a, b) R(c, d) So, Ris transitive on NxN.
a+d=b+c’b+c=a+d Hence, Ris an equivalence relation.
c+b=dta (by commutativity of addition on AcN) 24. We have, A=
’ (c d) R(a, b). {xe Z:0sx< 12}
Thus, (a, b) R(c, d) ’ (c, d) R(a, b) for all (a, b), (c, :. A={0, 1, 2, 3, .., 12}
d) e AxA. and S={(a, b): la - b| is divisible by 4}
So, Ris symmetric.
(ii) Transitive : Let (a, b), (c, d), (e, f) e A xA such that () Reflexive : For any ae A, la - al =0, which is divisible
(a, b) R(c, d) and (c, d) R(e, f) by 4. Thus, (a, a) e R :. Ris reflexive.
Now, (a, b) R(c, d) a+d=b +c (ii) Symmetric: Let (a, b) e R
la- b< is divisible by4
and (c, d) R(e, f)’c+ f=d+e ..(i) (b- al is divisible by 4’ (b, a)e R
Adding (i) and (ii), we get (a +d) +(c +f) =(b +c) +(d +e) i.e., (a, b) e R (b, a) e R .:. Ris symmetric.
’ a+f=b+e (a, b) R (e, f) (ii) Transitive: Let (a, b)e Rand (b, c) eR
Thus, (a, b) R(c, d) and (c, d) R(e, f) ’(a, b) R(e, f). ’ la - bl is divisible by 4 and lb - d is divisible by 4
So, R is transitive. ..Ris an a-b=t4k, and b- c=t 4k,; k4, k,E N
equivalence relation.
Equivalence class of [(2,5)]={(x, y) e NxN:(x, y) R(2, 5)} ’ (a-b) +(b -c) =t4(k+ k);k, k,e N
-{x, y)e NxN:x+5=y+2) a-c=+4 (k4 +k2); k, k, EN
-{(x, y) e
={(1,4), (2,NxN:y=x+3}={(x,x+3):xe A} ’ la-c is divisible by 4’(a,c)e R . Ris transitive.
5), (3, 6), (4,7), (5, 8), (6,9). Hence, Ris an equivalence relation.
AnswerTips The set of elementsrelated to 1 is {1,5,9}.
First, prove the given relation is an equivalence oEquivalence class for [2] is (2, 6, 10}.
relation and then find the equivalence class by using Concept Applied G
the given relation. In a relation R in a set A, the set of all elements
22. Here, R={(x, y)|xe N,ye Nand 2x+y= 24} related to any element ae Ais denoted by [a
R={(1, 22), (2, 20), (3, 18),.. (11, 2)} i.e., [a] ={xE A:(x, a) e R}
Domain of R={1, 2, 3, 4,.., 11) Here, [a] is called an equivalence class of ae A.
Relations and Functions

25. We have, A={1,2, 3, 4, 5} ConceptApplied (G)

and R={(a, b) : la - b] is divisible by 2} one-one, no two elements
For a function to be
() Reflexive : For any a e A, should have the same image in A.
la-al =0, which is divisible by 2
Thus, (a, a)e R ..R is reflexive.
31. () Here n(B) = 3 and n(G) =2 23*2 = 26
(ii) Symmetric: Let (a, b) e R Number of relation from B toG=
’ la-bl isdivisible by 2 from Bto G=23 =8
(ii) Number of functions formed students ofthe same
’ b-al is divisible by 2 (b, a)e R
i.e., (a, b) eR ’ (b,a) e R .Ris symmetric. (ii) We have, R= (x.y)=x and yare
(ii) Transitive: Let (a, b) e Rand (b, c) eR sex}
’ la-bl is divisible by 2and |b - cis divisible by2 Ris reflex0ve as (x, x)eR.
Ris symmetric as (x, y)e R(y, x)e R.
a-b=+2 k, and b- c=+2k,; k, k, eN z) R
e
(a-b) + (b-c)=+2(k, +kY);k,k, eN Since, (x, y)e Rand (y, z) e R»x,
relations.
(a-c)=+2 (k, +k2);k, kz ¬N Hence, R is an equivalence
la-cis divisibleby2 ’ (, c)e R .. Ris transitive. OR
(b,3). (bs,3)}
Hence, Ris an equivalence relation. We have f:B-’ Gbe defined by f={(b,3). therefore,
image,
Further Rhas onlytwo equivalence classes, namely [1]=[3] Since, elements b, and b, have the same one functions.
it is many
- [5]=(1, 3, 5) and[2]= [4]={2,4}. the functions is not one-one but
pre-image in B, so the
26. (d):We have,flx) =4+3 cosx, YxE R Since, every element in G has its
functions is onto.
one-one and onto both.
For bijection, function should be
injective.
Hence, the function is surjective but not
4x
Since, isgiven by f(x)=
Therefore, f is not one-one.
32. The function
3x+4
4
As -1<coS X< 1, xER ’ 1s4+3 cos x<7, xER One-one: Let x,yeR--:such that fx)= f(y)
’ fk)e [1,7], where (1, 7] is subset of R. .. fis not onto. 4x 4y
Concept Applied (G) 3x+4 3y +4
Range of cos xis|-1,1Di yisGveiS.o2 4x(3y +4) =4y(3x + 4) ’ 12xy+ 16x = 12xy+ 16y
16x= 16y ’ X=y
27. (d): f:X Y is one-one, if different element of .. fisone-one.
no such
X have different image in Y under f. But here, Onto:Let ybe an arbitrary element of R. Then f(x) =y
situation is possible. 4x 4x-3xy=4y’x 4y
1 RyAY > 4X=3xy +4y 4-3y
28. (d): Given f(x) =, for all xe R
Atx= 0eR, fx) is not defined.
[n+1 if n is odd
As yeR-.
l3J' 4-3y AyeR
4y
29. (c):Given, fx) = n
Also,
4-3y 3 sif
ifn is even
2' 4y 4
-12y=12y-16, which is not possible.
4-3y 3
Now, f(1) =1+1
2
=1,f(2)==1
2
Thus, x= such that
’ f1) = f(2) but 1+2 .:. fis not one-one.
But fis onto ( range of f is N.) 4y
4
30. We have, A = (1, 2, 3, 4}function f:A’ Ais one-one 4-3y 16y 16y =y
and f(1) =2, f(2) =4, f(3) = 1, fl4) =k 12y+16-12y 16
A f A (4-3y 4

So, everyelement in R-has pre-image in

fis not onto.
X
33. Given, f(x) = 1+bie(-,0)
As fis one-one, so no two element of Ahas same image in A. X (: xe (-oo, 0), [x| = -x)
f(4) =3 ’ k=3 1-x
For one-one: Let fx,) =f(x), X1, X,E (-oo, 0)
’x(1-X,) =X(1 - X)
1-x4 1-X

Thus, flx,)= fx), ’ x =X2

.. fis one-one
For onto : Let f(x) = y
X

1-x
y1 - x) =x ’y-xy= x
X+ Xy=y’x(1+y) =y ’ X=
1+y
Here, ye(-1,0) codomain. .. fis onto.
So, x is defined for all values of v in

Concept Applied (Ø)

function f:A’ Bis called
A
(0) one-one or injective function, if distinct
elements of A have distinct images in B.
i.e., for a, be A,fla) =f(b) ’ a=b
(ii) onto or surjective function, if for every element
be B, there exists'some a e A such that f(a) =b.