Prepared by: M. S.

KumarSwamy, TGT(Maths) Page - 1 -

CHAPTER – 1: RELATIONS AND FUNCTIONS
MARKS WEIGHTAGE – 05 marks

NCERT Important Questions & Answers

1. 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.
Ans:
We have R = {(a,b) :a b2 } , where a, b R
2
1 1
For reflexivity, we observe that is not true.
2 2
1 1
So, R is not reflexive as , R
2 2
2
For symmetry, we observe that but 3 > ( 2
( R but (3, R.
So, R is not symmetric.
2 2
For transitivity, we observe that2 and but 2 > (1)2
(2, R and ( R but (2, 1) R. So, R is not transitive.
Hence, R is neither reflexive, nor symmetric and nor transitive.

2. Prove that the relation R in R defined by R = {(a, b): a b3} is neither reflexive nor symmetric
nor transitive.
Ans:
Given that R = {(a, b): a b3}
3
1 1 1 1 1
It is observed that , R as
2 2 2 2 8
So, R is not reflexive.
Now, (1, 2) (as 1< 23=8)
But (2, 1) R (as 23 > 1)
So, R is not symmetric.
3 3
3 3 6 3 3 6
We have 3, , , R as 3 and
2 2 5 2 2 5
3
6 6
But 3, R as 3
5 5
Therefore, R is not transitive.
Hence, R is neither reflexive nor symmetric nor transitive.

3. 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 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}.
Ans:
Given that A = {1, 2, 3, 4, 5} and R = {(a, b) : |a – b| is even}
It is clear that for any element a A, we have (which is even).
R is reflexive.
Let (a, b) R.
|a – b| is even

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 2 -

 (a – b) is even
– (a – b) is even
(b – a) is even
|b – a| is even
(b, a) R
R is symmetric.
Now, let (a, b) R and (b, c) R.
|a – b| is even and |b – c| is even
(a – b) is even and (b – c) is even
(a – c) = (a – b) + (b – c) is even (Since, sum of two even integers is even)
|a – c| is even
(a, c) R
R is transitive.
Hence, R is an equivalence relation.
Now, all elements of the set {1, 2, 3} are related to each other as all the elements of this subset are
odd. Thus, the modulus of the difference between any two elements will be even.
Similarly, all elements of the set {2, 4} are related to each other as all the elements of this subset are
even.
Also, no element of the subset {1, 3, 5} can be related to any element of {2, 4} as all elements of {1,
3, 5} are odd and all elements of {2, 4} are even. Thus, the modulus of the difference between the
two elements (from each of these two subsets) will not be even.
4. Show that each of the relation R in the set A {x Z : 0 x 12} , given by R = {(a, b): |a – b| is
a multiple of 4} is an equivalence relation. Find the set of all elements related to 1.
Ans:
A {x Z : 0 x 12} {0,1, 2,3, 4,5,6,7,8,9,10,11,12} and
R = {(a, b): |a – b| is a multiple of 4}
For any element a A, we have (a, a) R |a – a| = 0 is a multiple of 4.
R is reflexive.
Now, let (a, b) R |a – b| is a multiple of 4.
|–(a – b)| is a multiple of 4
|b – a| is a multiple of 4.
(b, a) R
R is symmetric.
Now, let (a, b), (b, c) R.
|a – b| is a multiple of 4 and |b – c| is a multiple of 4.
(a – b) is a multiple of 4 and (b – c) is a multiple of 4.
(a – b + b – c) is a multiple of 4
(a – c) is a multiple of 4
|a – c| is a multiple of 4
(a, c) R
R is transitive.
Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 3 -
 Hence, R is an equivalence relation.
The set of elements related to 1 is {1, 5, 9} since
|1 – 1| = 0 is a multiple of 4
|5 – 1| = 4 is a multiple of 4
|9 – 1| = 8 is a multiple of 4

x 2
5. Let A = R B=R f:A B defined by f(x) = is f
x 3
one-one and onto ? Justify your answer.
Ans:
x 2
Here, A = R B=R f:A B is defined as f(x) =
x 3
Let x, y A such that f(x) = f(y)
x 2 y 2
( x 2)( y 3) ( y 2)( x 3)
x 3 y 3
xy 3x 2 y 6 xy 3 y 2 x 6
3x 2 y 3 y 2x
3x 2 x 3 y 2 y x y

Therefore, f is one- one. Let y B=R y

The function f is onto if there exists x A such that f(x) = y.
Now, f(x) = y
x 2
y x 2 xy 3 y
x 3
x (1 y ) 3y 2
2 3y
x A [ y 1]
1 y
2 3y
Thus, for any y B, there exists A such that
1 y
2 3y
2
2 3y 1 y 2 3y 2 2 y y
f y
1 y 2 3y 2 3y 3 3y 1
3
1 y
Therefore, f is onto. Hence, function f is one-one and onto.

x
6. Show that f :[ R, given by f ( x) ,x 2 , is one-one.
x 2
Ans:
x
Given that f :[ R, given by f ( x) ,x 2,
x 2
Let f(x) = f(y)
x y
xy 2 x xy 2 y
x 2 y 2
2x 2 y x y
Therefore, f is a one-one function.

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 4 -

 x
7. Show that the function f :R x R: x <1} defined by f( x) = , x R is one-one and
1 | x|
onto function.
Ans:
x
It is given that f :R x R: x <1} defined by f( x) = ,x R
1 | x|
x y
Suppose, f(x) = f(y), where x, y R
1 |x| 1 | y|
It can be observed that if x is positive and y is negative, then we have
x y
2 xy x y
1 x 1 y
Since, x is positive and y is negative, then x > y x y>0

But, 2xy is negative. Then, 2xy x y.

Thus, the case of x being positive and y being negative can be ruled out.
Under a similar argument, x being negative and y being positive can also be ruled out. Therefore, x
and y have to be either positive or negative.
x y
When x and y are both positive, we have f ( x) f ( y ) x xy y xy x y
1 x 1 y
x y
When x and y are both negative, we have f ( x) f ( y ) x xy y xy x y
1 x 1 y
Therefore, f is one-one. Now, let y R such that y < 1.
y
If y is negative, then there exists x R such that
1 y
y y
y 1 y 1 y y
f ( x) f y
1 y y y 1 y y
1 1
1 y 1 y
y
If y is positive, then there exists x R such that
1 y
y y
1 y
y 1 y y
f ( x) f y
1 y y y 1 y y
1 1
1 y 1 y
Therefore, f is onto. Hence, f is one-one and onto.

8. Show that the function f :R R given by f (x) = x3 is injective.

Ans:
Here, f :R R is given as f(x) = x3.
Suppose, f(x) = f(y),where x,y R x3 = y3 …(i)
Now, we need to show that x = y
Suppose, x y, their cubes will also not be equal.
x3 y3
However, this will be a contradiction to Eq. i).
Therefore, x = y. Hence, f is injective.

9. Show that the relation R in the set Z of integers given by R = {(a, b) : 2 divides a – b} is an
equivalence relation.
Ans:
Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 5 -
 R is reflexive, as 2 divides (a – a) for all a Z.
Further, if (a, b) R, then 2 divides a – b.
Therefore, 2 divides b – a.
Hence, (b, a) R, which shows that R is symmetric.
Similarly, if (a, b) R and (b, c) R, then a – b and b – c are divisible by 2.
Now, a – c = (a – b) + (b – c) is even.
So, (a – c) is divisible by 2. This shows that R is transitive.
Thus, R is an equivalence relation in Z.

CHAPTER – 1: RELATIONS AND FUNCTIONS

MARKS WEIGHTAGE – 05 marks

Previous Years Board Exam (Important Questions & Answers)

1. Let T be the set of all triangles in a plane with R as relation in T given by R = {(T1, T2) :T1
T2}. Show that R is an equivalence relation.
Ans:
(i) Reflexive
R is reflexive if T1 R T1
Since T1 T1
R is reflexive.
(ii) Symmetric
R is symmetric if T1 R T2 T2 R T1
Since T1 T2 T2 T1
R is symmetric.
(iii) Transitive
R is transitive if T1 R T2 and T2 R T3 T 1 R T3
Since T1 T2 and T2 T3 T1 T3
R is transitive
From (i), (ii) and (iii), we get R is an equivalence relation.

n 1
, if n is odd
2. Let f : N N be defined by f (n) 2 for all n N . Find whether the
n
, if n is even
2
function f is bijective.
Ans:
n 1
, if n is odd
Given that f : N N be defined by f (n) 2 for all n N.
n
, if n is even
2
Let x, y N and let they are odd then
x 1 y 1
f ( x) f ( y ) x y
2 2
If x, y N are both even then also

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 6 -

 x y
f ( x) f ( y) x y
2 2
If x, y N are such that x is even and y is odd then
x 1 y
f ( x) and f ( y )
2 2
Thus, x y for f(x) = f(y)
Let x = 6 and y = 5
6 5 1
We get f (6) 3, f (5) 3
2 2
f(x) = f(y) but x y ...(i)
So, f (x) is not one-one.
Hence, f (x) is not bijective.

| x 1|
3. What is the range of the function f ( x ) ?
( x 1)
Ans:
| x 1|
We have given f ( x )
( x 1)
( x 1), if x 1 0 or x 1
| x 1|
( x 1), if x 1 0 or x 1
( x 1)
(i) For x > 1, f ( x) 1
( x 1)

( x 1)
(ii) For x < 1, f ( x ) 1
( x 1)
| x 1|
Range of f ( x ) is {–1 , 1}.
( x 1)

4. Let Z be the set of all integers and R be the relation on Z defined as R = {(a, b) ; a, b Z, and
(a – b) is divisible by 5.} Prove that R is an equivalence relation.
Ans:
We have provided R = {(a, b) : a, b Z, and(a – b) is divisible by 5}
(i) As (a – a) = 0 is divisible by 5.
(a, a) R a R
Hence, R is reflexive.

(ii) Let (a, b) R

(a – b) is divisible by 5.
– (b – a) is divisible by 5.
(b – a) is divisible by 5.
(b, a) R
Hence, R is symmetric.

(iii) Let (a, b) R and (b, c) Z

Then, (a – b) is divisible by 5 and (b – c) is divisible by 5.
(a – b) + (b – c) is divisible by 5.
(a – c) is divisible by 5.
(a, c) R
R is transitive.
Hence, R is an equivalence relation.

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 7 -

5. Let 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. State
whether f is one-one or not.
Ans:
f is one-one because
f(1) = 4 ; f(2) = 5 ; f(3) = 6
No two elements of A have same f image.

x 2
6. Let A = R – {3} and B = R – {1}. Consider the function f : A B defined by f ( x ) .
x 3
Show that f is one-one and onto and hence find f –1.
Ans:
Let x1, x2 A.
x1 2 x2 2
Now, f(x1) = f(x2)
x1 3 x2 3
( x1 2)( x2 3) ( x1 3)( x2 2)
x1 x2 3 x1 2 x2 6 x1 x2 2 x1 3 x2 6
3 x1 2 x2 2 x1 3 x2
x1 x2 x1 x2
Hence f is one-one function.
For Onto
x 2
Let y xy 3 y x 2
x 3
xy x 3 y 2 x( y 1) 3 y 2
3y 2
x ----- (i )
y 1
From above it is obvious that y except 1, i.e., y B R {1} x A
Hence f is onto function.
Thus f is one-one onto function.
3y 2
It f –1 is inverse function of f then f 1 ( y ) [from (i)]
y 1

x 1, if x is odd
7. Show that f : N N, given by f ( x) is both one-one and onto.
x 1, if x is even
Ans:
For one-one
Case I : When x1, x2 are odd natural number.
f(x1) = f(x2) x1+1 = x2 +1 x1 , x2 N
x1 = x2
i.e., f is one-one.

Case II : When x1, x2 are even natural number

f(x1) = f(x2) x1 – 1 = x2 – 1
x1 = x2
i.e., f is one-one.
Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 8 -
 Case III : When x1 is odd and x2 is even natural number
f(x1) = f(x2) x1+1 = x2 – 1
x2 – x1 = 2 which is never possible as the difference of odd and even number is always odd
number.
Hence in this case f (x1) f(x2)
i.e., f is one-one.

Case IV: When x1 is even and x2 is odd natural number

Similar as case III, We can prove f is one-one
For onto:
f(x) = x +1 if x is odd
= x – 1 if x is even
For every even number ‘y’ of codomain odd number y - 1 in domain and for every odd number
y of codomain even number y +1 in Domain.
i.e. f is onto function.
Hence f is one-one onto function.

8. Prove that the relation R in the set A = {5, 6, 7, 8, 9} given by R = {(a, b) : |a – b| , is divisible by
2}, is an equivalence relation. Find all elements related to the element 6.
Ans:
Here R is a relation defined as R = {(a, b) : |a – b| is divisible by 2}
Reflexivity
Here (a, a) R as |a – a| = 0 = 0 divisible by 2 i.e., R is reflexive.
Symmetry
Let (a, b) R
(a, b) R |a – b| is divisible by 2
a – b = ± 2m b – a = 2m
|b – a| is divisible by 2 (b, a) R
Hence R is symmetric
Transitivity Let (a, b), (b, c) R
Now, (a, b), (b, c) R |a – b|, |b – c| are divisible by 2
a – b = ±2m and b – c = ±2n
a – b + b – c = ± 2(m + n)
(a – c) = ± 2k [ k = m + n]
(a – c) = 2k
(a – c) is divisible by 2 (a, c) R.
Hence R is transitive.
Therefore, R is an equivalence relation.
The elements related to 6 are 6, 8.

OBJECTIVE TYPE QUESTIONS (1 MARK)

1. Let R be a relation on the set L of lines defined by l1R l2 if l1 is perpendicular to l2, then relation R is
(a) reflexive and symmetric (b) symmetric and transitive
(c) equivalence relation (d) symmetric

2. Given triangles with sides T1 : 3, 4, 5; T2 : 5, 12, 13; T3 : 6, 8, 10; T4 : 4, 7, 9 and a relation R in set
1 2 1 2}. Which triangles belong to the same
equivalence class?
(a) T1 and T2 (b) T2 and T3 (c) T1 and T3 (d) T1 and T4.

3. Given set A = {1, 2, 3} and a relation R = {(1, 2), (2, 1)}, the relation R will be
Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 9 -
 (a) reflexive if (1, 1) is added (b) symmetric if (2, 3) is added
(c) transitive if (1, 1) is added (d) symmetric if (3, 2) is added

4. Given set A = {a, b, c}. An identity relation in set A is

(a) R = {(a, b), (a, c)} (b) R = {(a, a), (b, b), (c, c)}
(c) R = {(a, a), (b, b), (c, c), (a, c)} (d) R = {(c, a), (b, a), (a, a)}

5. A relation S in the set of real numbers is defined as xSy x – y + 3 is an irrational number, then
relation S is
(a) reflexive (b) reflexive and symmetric (c) transitive (d) symmetric and transitive

6. Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is
(a) Reflexive and symmetric (b) Transitive and symmetric
(c) Equivalence (d) Reflexive, transitive but not symmetric

7. Let L denote the set of all straight lines in a plane. Let a relation R be defined by l R m if and only if
l is perpendicular to m for all l, m L. Then R is
(a) reflexive (b) symmetric (c) transitive (d) none of these

8. Let N be the set of natural numbers and the function f : N n N.

Then f is
(a) surjective (b) injective (c) bijective (d) none of these

9. Set A has 3 elements and the set B has 4 elements. Then the number of injective mappings that can
be defined from A to B is
(a) 144 (b) 12 (c) 24 (d) 64
2
10. Let f : R + 1. Then, pre-images of 17 and – 3, respectively, are
– 4} (b) {3, – (c) {4, – (d) {4, – 4, {2, – 2}

11. For real numbers x and y, define xRy if and only if x – y + 2 is an irrational number. Then the
relation R is
(a) reflexive (b) symmetric (c) transitive (d) none of these

12. Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if
a is congruent to b a, b T. Then R is
(a) reflexive but not transitive (b) transitive but not symmetric
(c) equivalence (d) none of these

13. Consider the non-empty set consisting of children in a family and a relation R defined as aRb if a is
brother of b. Then R is
(a) symmetric but not transitive (b) transitive but not symmetric
(c) neither symmetric nor transitive (d) both symmetric and transitive

14. The maximum number of equivalence relations on the set A = {1, 2, 3} are
(a) 1 (b) 2 (c) 3 (d) 5

15. If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is

(a) reflexive (b) transitive (c) symmetric (d) none of these

16. Let us define a relation R in R as aRb if a

(a) an equivalence relation (b) reflexive, transitive but not symmetric
(c) symmetric, transitive but not reflexive (d) neither transitive nor reflexive but symmetric.
Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 10 -
17. Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}. Then R is
(a) reflexive but not symmetric (b) reflexive but not transitive
(c) symmetric and transitive (d) neither symmetric, nor transitive

18. If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and
onto mappings from A to B is
(a) 720 (b) 120 (c) 0 (d) none of these

19. Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is
(a) nP2 (b) 2n – 2 (c) 2n – 1 (d) None of these

1
20. Let f : R . Then f is
x
(a) one-one (b) onto (c) bijective (d) f is not defined

21. Which of the following functions from Z into Z are bijections?

(a) f (x) = x3 (b) f (x) = x + 2 (c) f (x) = 2x + 1 (d) f (x) = x2 + 1
2
22. Let f : [2, – 4x + 5, then the range of f is
(a) R (b) [1, (c) [4, (d) [5,

2x 1
23. Let f : N and g : Q
2
3
g(x) = x + 2. Then (g o f) is
2
7
(a) 1 (b) 1 (c) (d) none of these
2

2x : x 3
2
24. Let f : R f ( x) x :1 x 3 . Then f (– 1) + f (2) + f (4) is
3x : x 1
(a) 9 (b) 14 (c) 5 (d) none of these

25. Let the function ‘f ’ : N N. Then ‘f ’ is

(a) not onto (b) bijective function (c) many-one, into function (d) none of these

26. A relation defined in a non-empty set A, having n elements, has

(a) n relations (b) 2 relations (c) n2 relations (d) 2n2 relations

27. If f (x) = x3 and g(x) = cos 3x , then fog is

(a) x3. cos 3x (b) cos 3x3 (c) cos3 3x (d) 3cos x3.

28. A relation R in human beings defined as R = {(a, b) : a, b human beings ; a loves b} is

(a) reflexive (b) symmetric and transitive (c) equivalence (d) neither of these

29. Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R = ________

30. The domain of the function f : R x 2 3 x 2 is ________.

31. The domain of the function f : R 4 x 2 is ________.

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 11 -
32. Consider the set A containing n elements. Then, the total number of injective functions from A onto
itself is ________.

33. Let Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3.
Then R partitions the set Z into ________ pairwise disjoint subsets.

34. Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a __________relation.

35. Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.

36. Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : |a2 – b2| < 8. Then R is
given by _______.

37. Let R be a relation defined as R = {(x, x), (y, y), (z, z), (x, z)} in set A = {x, y, z} then R is
______________ (reflexive/symmetric) relation.

38. Let A = {1, 2, 3, 4} and B = {a, b, c}. Then number of one-one functions from A to B are ________.

39. If n(a) = p, then number of bijective functions from set A to A are _______.

x 1
40. If f (x) = , x( R then range of ‘f ’ is _____.
| x 1|

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 12 -