Practice Sheet 12th Hacker - CBSE 2025) MATHS

Relations and Functions

1. Assertion (A): If A = 0,1 and N be the set of 6. Show that the relation R in the set 1,2,3 given
natural numbers. Then, the mapping f : N → A by R = (1,1) , ( 2,2) , (3,3) , (1,2) , ( 2,3)
defined by f ( 2n −1) = 0 , f ( 2n) = 1, n  N , is is reflexive but neither symmetric nor transitive.
onto.
Reason (R): If Range = Codomain, then function 7. Prove that the relation R on Z , defined by
is onto. R = {( x, y ) : ( x − y ) is divisible by 5} is an
(1) Both Assertion (A) and Reason (R) are true equivalence relation.
and Reason (R) is the correct explanation of
Assertion (A). 8. Show that the relation R on R (set of real
numbers) defined as R = ( a, b) : a  b ,
(2) Both Assertion (A) and Reason (R) are true
but Reason (R) is not the correct explanation
of Assertion (A). is reflexive, and transitive but not symmetric.
(3) Assertion (A) is true but Reason (R) is false.
(4) Assertion (A) is false but Reason (R) is true. 9. Show that the relation R in the set N  N defined
by ( a, b) R ( c, d ) if
2. Assertion (A): A relation R = {( a, b) : a − b  3}
a2 + d 2 = b2 + c2a, b, c, d  N ,
defined on the set A = 1,2,3,4 is reflexive. is an equivalence relation.
Reason (R): A relation R on the set A is said to
be reflexive if for ( a, b)  R and (b, c )  R , we 10. Prove that the function f : N → N , defined by

have ( a, c )  R . f ( x ) = x2 + x + 1 is one-one but not onto.

(1) Both Assertion (A) and Reason (R) are true
and Reason (R) is the correct explanation of 11. Case based Subjective Questions
Assertion (A). Read the following text and answer the following
(2) Both Assertion (A) and Reason (R) are true questions on the basis of the same:
but Reason (R) is not the correct explanation Rohan is confused in the Mathematics topic
of Assertion (A). 'Relation and equivalence relation'. To clear his
(3) Assertion (A) is true but Reason (R) is false. concepts on the topic, he took help his elder
(4) Assertion (A) is false but Reason (R) is true. brother. He has following notes on this topic.
Relation : A relation R from a set A to a set B
3. If R = ( x, y ); x, y  Z, x2 + y2  4 is a relation
is a subset of the cartesian product A B
obtained by describing a relationship between
on set Z , then domain of R is first element x and the second element ' y ' of
(1) 0,1,2 (2) −2, −1,0,1,2 the ordered pairs in A B . A relation R on a set A
(3) 0, −1, −2 (4) −1,0,1 is called. :
Reflexive : If ( a, a)  Ra A .
4. The maximum number of equivalence relations Symmetric: If ( a1, a2 )  R
on the set A = 1,2,3 are  ( a2 , a1 )  Ra1, a2  A .
Transitive : If ( a1, a2 )  R and ( a2 , a3 )  R
(1) 1 (2) 2
(3) 3 (4) 5
 ( a1, a3 )  Ra1, a2 , a3 A
5. Check whether the function Equivalence Relation : A relation R in a set A is
x an equivalence relation if R is reflexive,
y= , x  R, y  R is one-one and onto.
1+ x symmetric and transitive.
(i) Show that relation defined by 16. Check which of the following function is onto or

R1 = ( x, y )∣ x2 = y 2  x, y  R is an equivalence into.
(i) f : A → B , given by f ( x) = 3x , where
relation.
A = 0,1,2 and B = 0,3,6 .
(ii) Check whether the relation (R) ' x greater than y ' (ii) f : Z → Z , given by f ( x) = 3x + 2 , where
for all x, y N is reflexive, symmetric or
Z = set of integers.
transitive.
17. Let R be the set of all non-zero real number.
12. Show the relation R in the set
that 1
A = 1,2,3,4,5 given by R = {( a, b); a − b is Then, show that f : R → R , given by f ( x ) =
x
divisible by 2 } is an equivalence relation. Write is one-one and onto.
all the equivalence classes of R .
18. Let A = x  Z :0  x  12 . Show that
If A = 1,2,3,4 , define relations on A which
R = {( a, b) : a, b  A, a − b is divisible by 4} is an
13.
have properties of being:
equivalence relation. Find the set of all element
(i) reflexive, transitive but not symmetric
related to 1.
(ii) symmetric but neither reflexive nor transitive
Write the equivalence class [2]
(iii) reflexive, symmetric and transitive.

14. Let A = −1,1 . Then, discuss whether the 19. Let A = R − 3 and B = R − 1 .
x−2
following functions defined on A are one-one, Consider f : A → B defined by f ( x ) = ,
onto or bijective: x −3
x then prove that ƒ(x) is on one-one and onto. Find
(i) f ( x ) = (ii) g ( x ) = x
2 f −1 .
(iii) h ( x ) = x x (iv) k ( x ) = x2
 4
20. Let f : R − −  → R be a function defined as
15. Let A = 1,2,3 and R = ( a, b) : a, b  A and  3
4x
a2 − b2  5 . Write R as set of ordered pairs. f ( x) = Show that f is a one-one
3x + 4
Mention whether R is function. Also, check whether f is an onto
(i) reflexive (ii) symmetric function or not.
(iii) transitive
■■■

[2]
 ANSWER KEY

1. (1) 11. Refer to solution

2. (3) 12. Refer to solution
3. (2) 13. Refer to solution
4. (4) 14. Refer to solution
5. Refer to solution 15. Refer to solution
6. Refer to solution 16. Refer to solution
7. Refer to solution 17. Refer to solution
8. Refer to solution 18. Refer to solution
9. Refer to solution 19. Refer to solution
10. Refer to solution 20. Refer to solution

[3]
 HINTS & SOLUTIONS

1. (1) Here range of f ( x ) is R − −1,1 .

Given A = 0,1 But y can not have any of the values −1,1 for
f ( 2n −1) = 0, f ( 2n) = 1n  N some x .
 every element in A has its preimage in N .  f ( x ) is not an onto function.
So, Assertion (A) is true.
and we know range is subset or equal to
6. R is reflexive, since (1,1) , ( 2,2) and (3,3) lie in
codomain So, Reason (R) is true. and for onto
function, Range = Codomain So, Reason (R) is R.
correct explanation of Assertion (A). Also, R is not symmetric, as (1,2)  R but

2. (3)
( 2,1)  R
Assertion is true because for each element a  A , Similarly, R is not transitive, as (1,2)  R and
a − a = 0  3 , so (1,1)  R, ( 2,2)  R, (3,3)  R , ( 2,3)  R but (1,3)  R
( 4,4)  R therefore R is reflexive.
Reason is false because a relation R on the set A 7. For reflexive
is said to be transitive if for ( a, b)  R and x − x = 0 , for every x Z is divisible by
5  ( x, x)  R
(b, c)  R , we have ( a, c)  R
For symmetric
3. (2) ( x, y )  R  x − y is divisible by 5  y − x is
Explanation: Given, divisible by 5

R = ( x, y ) : x, y  Z , x + y  4
2 2
  ( y, x)  R  R is symmetric
For transitive
Let y = 0 , then x2  4  x = 0, 1, 2
Let ( x, y )  R and ( y, z )  R
Thus, domain of R = −2, −1,0,1,2
( x, y )  R  x − y = 5 …(i)
4. (4) ( y, z )  R  y − z = 5 …(ii)
Explanation: Given that, A = 1,2,3 adding (i) and (ii), x − z = 5(  + ) = 5k
 ( x, z )  R  R is transitive
Now, number of equivalence relations are as
follows:
R1 = (1,1) , ( 2,2) , (3,3)
Hence R is an equivalence relation.

R2 = (1,1) , ( 2,2) , (3,3) , (1,2) , ( 2,1) 8. Clearly a  aa  R  ( a, a )  R  R

R3 = (1,1) , ( 2,2) , (3,3) , (1,3) , (3,1) is reflexive.

R4 = (1,1) , ( 2,2) , (3,3) , ( 2,3) , (3,2)

For transitive:
Let ( a, b)  R and (b, c)  R, a, b, c  R

R5 = (1,2,3)  A  A = A2   a  b and b  c  a  c  ( a, c )  R
 Maximum number of equivalence relations  R is transitive.
on the set A = 1,2,3 = 5 For non-symmetric:
Let a =1, b = 2 , As 1  2  (1,2)  R
but 2 1  ( 2,1)  R
x
5. Let f ( x ) = y = x  R, y  R
1+ x
 R is non-symmetric.
x x
 f ( x) = or is one-one.
1+ x 1− x
[4]
9. Let ( a, b)  N  N then, Transitive : For all x, y  R, x2 = y2 and for all
a2 + b2 = a2 + b2 y, z  R y2 = z 2
 ( a, b) R ( a, b)  x2 = y2 = z 2 , for all x, y, z  R
Hence R is reflexive. Hence, R1 is transitive.
Let ( a, b) , ( c, d )  N  N be such that
Thus, R1 is an equivalence relation.
( a, b) R (c, d )
 a2 + d 2 = b2 + c2 (ii) Given, x greater than y, x, y  N
 x  yx, y  N
 c2 + b2 = d 2 + a2
 ( c, d ) R ( a, b) Reflexive : Now, for ( x, x )  R

Hence, R is symmetric. Therefore, x  x is not true for any x N

Let ( a, b) , ( c, d ) , (e, f )  N  N be such that

Thus, R is not reflexive.
Symmetric : Now, let ( x, y )  R , then x  y
( a, b) R(c, d ), (c, d ) R (e, f ) . If x  y , then y  x for any x, y N
 a +d =b +c
2 2 2 2
…(i) Thus, R is not symmetric.
and c + f = d + e
2 2 2 2
…(ii) Transitive : Now, let ( x, y )  R and ( y, z )  R
Adding eqn. (i) and (ii),  x  y and y  z
 a2 + d 2 + c2 + f 2 = b2 + c2 + d 2 + e2 Therefore, ( x, z )  R for all x, y, z N
 a2 + f 2 = b2 + e2 Thus, R is transitive.
 ( a, b) R ( e, f )
12. Given, R = {( a, b); a − b is divisible by 2 }
Hence, R is transitive
Since, R is reflexive, symmetric and transitive. where, a, b  A = 1,2,3,4,5
Therefore, R is an equivalence relation. Reflexive:
For any a  R, a − a = 0 , which is divisible by 2.
For one-one. Let x1, x2  N .
Therefore, ( a, a)  A, a  A
10.
f ( x1 ) = f ( x2 ) So, R is Reflexive.
 x12 + x1 + 1 = x22 + x2 + 1 Symmetric:
 ( x1 − x2 )( x1 + x2 + 1) = 0 Let ( a, b)  R, a, b  A

 x1 = x2 as x1 + x2 +1  0 If a − b is divisible by 2

 f is one-one. ( x1, x2  N ) Then b − a is also divisible by 2.

For not onto. ( a, b)  R  (b, a)  R

for y = 1 N , there is no x  N for which So, R is symmetric.
f ( x) = 1 Transitive:
Let, ( a, b)  R and (b, c )  R then

11.(i) Given relation R1 = ( x, y )∣ x2 = y2 a − b is divisible by 2 and b − c is divisible by

2
Reflexive : For all x  R, x2 = x2 , so, ( x, x )  R1 , Then a − c is divisible by 2
Hence, R1 is reflexive relation. Therefore, ( a, c )  R
Symmetric : For all x, y  R
So, R is Transitive
If x = y then y = x
2 2 2 2
Hence, R is an equivalence relation.
Hence, R1 is symmetric relation.

[5]
13. Given that A = 1,2,3,4 , (ii) Given, g ( x ) = x
(i) Let Let g ( x1 ) = g ( x2 )  x1 = x2  x1 =  x2
R1 = (1,1) , (1,2) , ( 2,3) , ( 2,2), (1,3), (3,3) So, g ( x ) is not one-one.
R1 is reflexive, since, (1,1)( 2,2)(3,3) lie in Now, x =  y  A for all y  R
R1 So, g ( x ) is not on to, also g ( x ) is not
Now, (1,2)  R1, ( 2,3)  R1  (1,3)  R1 bijective.
Hence, R1 is also transitive but (1,2)  R1 (iii) Given, h ( x ) = x x
 ( 2,1)  R1  x1 x1 = x2 x2  x1 = x2
So, it is not symmetric. So, h ( x ) is one-one
(ii) Let R2 = (1,2) , ( 2,1) . Here, 1,2,31,2,3
Now, let y = x x  y = x2  A, x  A
but (1,1) , ( 2,2) , (3,3) are not in R2 .
So, h ( x ) is onto and bijective.
Therefore, R2 is not reflexive.
(iv) Given, k ( x ) = x2
Now, (1,2)  R2 , ( 2,1)  R2
Let k ( x1 ) = k ( x2 )
So, it is symmetric.
Now (1,2)  R2 , ( 2,1)  R2 , but (1,1)  R2 ,  x12 = x22  x1 =  x2
therefore, R2 is not transitive. Thus, k ( x ) is not one-one.
(iii) Let R3 = {(1,2) , ( 2,1) , (1,1) , ( 2,2), (3,3) , Now, let y = x2  x = y  A, y  A ,
(1,3) , (3,1), ( 2,3), (3,2)} As for y = −1, x = −1  A
Here, (1,1) , ( 2,2) , (3,3)  R3 Hence, k ( x ) is neither one-one nor onto.
So R3 is Reflexive
and (1,3)  R3 then (3,1)  R3 15. Given that
So R3 is Symmetric Let A = 1,2,3 and R = ( a, b) : a, b  A and
and (1,2)  R3 , ( 2,3)  R3 a 2 − b2  5
then (1,3)  R3
Put a = 1,b = 112 − 12  5, (1,1) is an ordered pair.
So R3 is transitive
Clearly, R3 is reflexive, symmetric and Put a = 1, b = 2 12 − 22  5, (1,2) is an ordered
transitive.
pair.

14. Given that A = −1,1 Put a = 1, b = 312 − 32  5, (1,3) is not an ordered

x pair.
(i) Given, f ( x ) =
2 Put a = 2,b = 1 22 − 12  5, ( 2,1) is an ordered
Let f ( x1 ) = f ( x2 )
pair.
x1 x2
=  x1 = x2 Put a = 2, b = 2 22 − 22  5, ( 2,2) is an ordered
2 2
So, f ( x ) is one-one. pair.
x Put a = 2,b = 3 22 − 32  5, ( 2,3) is an ordered
Now, let y =  x = 2 y  A, y  A
2 pair.
As for y = 1 A, x = 2 A
Put a = 3, b = 1 32 − 12  5, (3,1) is not an ordered
So, f ( x ) is not onto.
pair.
Also, f ( x ) is not bijective as it is not onto.

[6]
 Put a = 3, b = 2 32 − 22  5, (3,2) is an ordered 17. Given, f ( x ) =
1
x
pair. For one-one
Put a = 3, b = 3 3 − 3  5, (3,3) is an ordered
2 2
Let x1, x2  R , such that f ( x1 ) = f ( x2 )
1 1  1
put x1 and x2 in f ( x ) = 
pair.
 = 
R = (1,1) , (1,2) , ( 2,1) , ( 2,2) , ( 2,3) , (3,2) , (3,3) x1 x2  x
 x1 = x2
(i) For ( a, a )  R
So, f is one-one
a2 − a2 = 0  5 . Thus, it is reflexive. For onto Let y  R be any arbitrary element.
(ii) Let ( a,b)  R Then,
1
( a, b)  R, a2 − b2 5 y = f ( x)  y=
x
1
b2 − a 2  5  x= [expressing x in terms of y ]
y
(b, a) R It is clear that for every y  R (codomain), x  R
Hence, it is symmetric
(domain) Thus, for each y  R (codomain), there
(iii) Put a =1,b = 2, c = 3
1
12 − 22  5 exist x =  R (domain), such that
y
22 − 32  5 1 1
f ( x) = f   = =y
 y 1
But 12 − 32  5  y
 
Thus, it is not transitive [i.e., every element of codomain has pre-image in
domain]
16. (i) We have a function f : A → B , given by So, f is onto.
f ( x) = 3x , where A = 0,1,2 and
18. Reflexive: a − a = 0 , which is divisible by 4, a
B = 0,3,6
A
Let y  B be any arbitrary element.
( a, a)  R, a  A R is reflexive
y
Then, y = f ( x )  y = 3x  x = Symmetric: let ( a, b)  R
3
Now,  a − b is divisible by 4
0
at y = 0, x = = 0  A  b − a is divisible by 4 ( a − b = b − a )
3
 (b, a)  RR is symmetric
3
At y = 3, x = = 1 A Transitive: let ( a, b) , (b, c)  R
3
6
At y = 6, x = = 2  A  a − b & b − c are divisible by 4
3  a − b = 4m, b − c = 4n, m, n Z
Adding we get, a − c = 4( m  n)
Thus, for each element y of B , there is a
pre-image in A.
 ( a − c) is divisible by 4 .
(ii) We have a function f : Z → Z , given by
f ( x) = 3x + 2 . Let y  Z , (codomain of f )  a − c is divisible by 4( a, c)  R
 R is transitive
be any arbitrary element.
Hence R is an equivalence relations in A Set of
3
f ( x)  0 since x  − elements related to 1 is 1,5,9 , Equivalence class
2
 f ( x) is not onto 2 = 2,6,10
[7]
19. A = R − 3 f ( x) =
x−2
y=
x−2
x=
y−2
B = R − 1 x −3 x −3 y −3

f : A→B  x ( y − 3) = y − 2  xy − 3x = y − 2
x−2  xy − y = 3x − 2
f ( x) =
x −3  y ( x −1) = 3x − 2
x1 − 2 x2 − 2 3x − 2 3x − 2
f ( x1 ) = f ( x2 )  = y=  f −1 ( x ) =
x1 − 3 x2 − 3 x −1 x −1
 ( x2 − 3)( x1 − 2) = ( x2 − 2)( x1 − 3)
 x1x2 − 3x1 − 2x2 + 6 = x1x2 − 3x2 − 2x1 + 6  4
20. Given, f : R − −  → R defined by
−3x1 − 2x2 = −3x2 − 2x1  3
4x
−x1 = −x2  x1 = x2 f ( x) =
3x + 4
So, f ( x ) is one - one.
 4
Let x1, x2  R − − 
 f ( x) =
( x − 2)  y = ( x − 2)  3
( x − 3) ( x − 3) such that f ( x1 ) = f ( x2 )
 y ( x − 3) = x − 2  yx − 3y = x − 2 4 x1 4 x2
 =
 yx − x = 3y − 2  x ( y −1) = 3y − 2 3x1 + 4 3x2 + 4
3y − 2  ( 4x1 )(3x2 + 4) = (3x1 + 4)( 4x2 )
x=
( y −1) 12x1x2 +16x1 = 12x1x2 +16x2
3y − 2 16x1 = 16x2  x1 = x2
−2
x−2 y −1  f is one-one.
 f ( x) = =
x − 3 3y − 2 − 3 Let y  R .
y −1
The function f is onto if there exist
3y − 2 − 2 y + 2 3y − 2 y
= = =y  4
3 y − 2 − 3 y + 3 −2 + 3 x  R − −  such that f ( x ) = y
 3
f ( x) = y
Now, f ( x ) = y
f ( x ) is onto.
4x
So f ( x ) is bijective and invertible.
 =y
3x + 4

PW Web/App - https://smart.link/7wwosivoicgd4

Library- https://smart.link/sdfez8ejd80if

[8]