1.

Relations, Functions and Binary Operations

Competitive Corner
Classwork MCQs

1. Let R be the relation in the set N given by R = {(a, b): a = b  2, b > 6}. Then the answer is
(A) (2, 4)  R (B) (3, 8)  R (C) (6, 8)  R (D) (8, 7)  R
Ans (C)
2. Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation on the set A = {1, 2, 3, 4}. The relation R is
(A) not symmetric (B) transitive (C) a function (D) reflexive
Ans (A)
(2, 3)  R but (3, 2)  R
 R is not symmetric.
3. Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and
symmetric, but not transitive is
(A) 1 (B) 2 (C) 3 (D) 4
Ans (A)
We get only one relation R = (1, 1), (2, 2), (3, 3), (1, 2), (1, 3), (2, 1), (3, 1)
4. Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is
(A) 1 (B) 2 (C) 3 (D) 4
Ans (B)
R1 = (1, 1), (2, 2), (3, 3), (1, 2), (2, 1)
R2 = (1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (1, 3), (3, 1), (2, 3), (3, 2) are the equivalence relations.
5. Given the relation R = {(1, 2), (2, 3)} on the set A = {1, 2, 3}. The minimum number of ordered pairs
which when added to R to make it an equivalence relation is
(A) 4 (B) 6 (C) 7 (D) 8
Ans (C)
Here we have to add (1, 1) (2, 2) (3, 3) (2, 1) (3, 2) (3, 1) (1, 3)
i.e., 7 ordered pairs.
6. If R1 and R2 are two equivalence relations on a non-empty set A, then R1  R2 is not
(A) reflexive (B) symmetric (C) transitive (D) an equivalence relation
Ans (C)
Let A = {1, 2, 3}
Consider the example R1 = {(1, 2) (2, 2) (3, 3) (1, 2) (2, 1)}
R2 = {(1, 1) (2, 2) (3, 3) (2, 3) (3, 2)}
Here R1 and R2 are reflexive. But
R1  R2 = {(1, 1) (2, 2) (3, 3) (1, 2) (2, 1) (2, 3) (3, 2)}
(1, 2)  R1  R2, (2, 3)  R1  R2 but (1, 3)  R1  R2
 It is not transitive.
7. If R1 and R2 are two equivalence relations on a non-empty set A, then
(A) R1  R2 is an equivalence relation on A (B) R1  R2 is an equivalence relation on A
(C) R1 – R2 is an equivalence relation on A (D) R1  R2 is not an equivalence relation on A
Ans (B)
Both R1 and R2 are equivalence relations on A then (x, x)  R and (x, x)  R2

1
2PBCBDM-Relations, Functions & Binary Operations(S)

Then (x, x)  R1  R2.

 R is reflexive.
If (x, y)  R1  R2
Then (x, y)  R1 and (x, y)  R2
Then (y, x)  R1 and (y, x)  R2
 (y, x)  R1  R2
 symmetric
(x, y)  (R1  R2), (y, z)  R1  R2
Then (x, y)  R1, R2 and (y, z)  R1, R2
Then (x, z)  R1, R2
 (x, z)  R1  R2
 transitive.
2x
8. Let A = {x : x  R; x is not a positive integer}. Define f : A  R as f (x)  , then f is [CET 2021]
x 1
(A) injective but not surjective (B) surjective but not injective
(C) bijective (D) neither injective nor surjective
Ans (A)
Let A = {x : x  R; x is not a positive integer}
2x
Define f : A  R as f (x) 
x 1
One-one
 x1, x2  A
f(x1) = f(x2)
2x1 2x 2

x1  1 x 2  1
x1x2  x1 = x1x2  x2
x1 = x1
f is one-one
Onto
2x
y
x 1
xy  y = 2x
xy  2x = y
x(y  2) = y
y
x A
y2
f is not onto
9. If a relation R on the set {1, 2, 3} is defined by R = {(1, 2)}, then R is
(A) reflexive (B) transitive (C) symmetric (D) an equivalence relation
Ans (B)
10. Let us define a relation R in R as aRb, if a  b. Then R is
(A) an equivalence relation (B) reflexive, transitive but not symmetric
(C) symmetric, transitive but not reflexive (D) neither transitive nor reflexive but symmetric

2
 2PBCBDM-Relations, Functions & Binary Operations(S)

Ans (B)
Given aRb, a  b
(i) Now a  a is true for all real number.  
  R is Reflexive.
(ii) Let (a, b)  R, a  b
Now a  b but does not imply b  a.
  (b, a)  R
 R is not symmetric.
(iii) Let (a, b)  R and (b, c)  R
  a  b and b  c  a  c
  It is transitive.
11. Which one of the following relations on R is an equivalence relation?
(A) aR1b  |a| = |b| (B) aR2b  a  b (C) aR3b  a divides b (D) aR4b  a < b
Ans (A)
(i) Reflexive : For every a  R, |a| = |a|  aR1a
(ii) Symmetric : For a, b  R
Let aR1b  |a| = |b|  |b| = |a|  bR1a
(iii) Transitive: For a, b, c  R
Let aR1b and bR1c and
 | a |  | b | and | b |  | c |
 |a| = |c|  aR1c
   R1 is an equivalence relation on R.
12. The number of equivalence relations defined in the set S = {a, b, c} is
(A) 5 (B) 3! (C) 22 (D) 33
Ans (A)
The smallest equivalence relation is the identity relation R1 = {(a, a), (b, b), (c, c)}
Then, two ordered pairs of two distinct elements can be added to give three more equivalence relations
R2 = {(a, a), (b, b), (c, c), (a, b), (b, a)}
Similarly R3 and R4.
Finally, the largest equivalence relation that is the universal relation
R5 = {(a, a), (b, b), (c, c), (a, b), (b, a), (a, c), (c, a), (b, c), (c,b)}.
13. Let R be an equivalence relation in the set Z of integers given by R = {(a, b)} : 2 divides a  b}. Then
equivalence class[0] is
(A) {0, 2, 4, 6 . . .} (B) {0, 1, 2 . . .} (C) {1, 2, 3, 4 . . .} (D) both (B) and (C)
Ans (A)
[O] = {0, 2, 4, 6 . . .}
14. Let P = {(x, y) |x2 + y2 = 1, x, y  R}. Then, P is
(A) reflexive (B) symmetric (C) transitive (D) anti-symmetric
Ans (B)
The relation is not reflexive and transitive but it is symmetric, because
x2 + y2 = 1  y2 + x2 = 1

3
2PBCBDM-Relations, Functions & Binary Operations(S)

15. Let R be an equivalence relation on a finite set A having n elements. Then the number of ordered pairs in
R is
(A) less than n (B) greater than or equal to n
(C) less than or equal to n (D) greater than n
Ans (B)
As R is an equivalence relation on set A, hence, R has atleast n ordered pairs.
16. For real numbers x and y, we write xRy  x – y + 2 is an irrational number. Then the relation R is
(A) reflexive (B) symmetric
(C) transitive (D) an equivalence relation
Ans (A)
(i) For any x  R, we have x  x  2  2 an irrational number
 xRx for all x. So, R is reflexive.
(ii) R is not symmetric for example  2,1  R but 1, 2   R ( 1  2  2  1 is rational)

(iii) R is not symmetric for example  2,1  R and 1, 2 2   R

( 2  1  2 and 1  2 2  2 are irrational)
But  
2, 2 2  R as 2  2 2  2  0 is rational

17. Let S = {1, 2, 3, 4, 5} and let A = S × S. Define the relation R on A as follows. (a, b) R (c, d) iff ad = cb.
Then R is
(A) Reflexive only (B) Symmetric only
(C) Transitive only (D) Equivalence relation
Ans (D)
Given that S = {1, 2, 3, 4, 5} and A = S × S
A relation R on A is defined as follows:
(a, b) R (c, d) iff ad = cb
(i) Reflexive : ab =ba
  ba = ab  (a, b) R (a, b)  a, b  S.
(ii) Symmetric : (a, b) R (c, d)
 adcd cb = ad
  (c, d) R (a, b)  a, b, c, d  S.
(iii) transitive : (a, b) R (c, d) and (c, d) R (e, f)
 ab = cb and cf = ed adcf = cbed
 cd (af) = cd (be) af = eb
  (a, b) R (e, f)  a, b, c, d, e, f  S.
18. 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) reflexive but not symmetric
Ans (C)
(i) we know that every triangle is congruent to itself.
  T1  T  (T1 , T1)  R
 R is reflexive

4
 2PBCBDM-Relations, Functions & Binary Operations(S)

(ii) Let (T1, T2)  R  T1 is congruent to T2

 T2 is congruent to T1
 (T2, T1)  R  R is symmetric
(iii) Let (T1, T2)  R and (T2, T3)  R
 T1 is congruent to T2 and T2 is congruent to T3
 T1 is congruent to T3
 (T1, T3)  R  R is transitive
Hence R is an equivalence relation.
19. 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 nor transitive (B) transitive but not symmetric
(C) neither symmetric nor transitive (D) both symmetric and transitive
Ans (B)
Given aRb  R  a is brother of b
 b may or may not be brother of a
 (b, a)  R
 R is not symmetric
Let (a, b)  R and (b, c)  R
 a is brother of b and b is brother of c
 a is brother of c
 (a, c)  Q  R is transitive.
20. 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
Ans (D)
(i) We know that every natural number is divisible by itself
 R is reflexive
(ii) 3 divides 6 but 6 does not divides 3
 (3, 6)  R (6, 3)  R
 R is not symmetric
(iii) Let (a, b)  R and (b, c)  R
 a divides b and b divides c
 a will divide c
 (a, c)  R  R is transitive
21. If A = {1, 2, 3} and B = {x, y}, then the number of functions that can be defined from A into B is
(A) 3 (B) 6 (C) 8 (D) 12
Ans (C)
Let A and B be two non empty sets and n(A) = m, n(B) = n.
Then number of functions defined from A  B is nm.
 number of functions = 23 = 8

5
2PBCBDM-Relations, Functions & Binary Operations(S)

22. Set A has 3 elements and set B has 4 elements. The number of injections that can be defined from
A to B is
(A) 144 (B) 12 (C) 24 (D) 48
Ans (C)
O(A) = m, O(B) = n; O(A) = 3, O(B) = 4
The number of injections from A  B is npm = 4p3 = 24
23. Set A has 4 elements and the set B has 5 elements. Then the number of injective mappings that can be
defined from A to B is [CET 2016]
(A) 72 (B) 120 (C) 144 (D) 60
Ans (B)
The total number of injective mappings from the set containing 4 elements into the set containing
5 elements is 5P4 = 5! = 120.
24. Let E = {1, 2, 3, 4} and F = {1, 2}, then the number of onto functions from E to F is
(A) 14 (B) 16 (C) 12 (D) 8
Ans (A)
If A and B are two non empty sets and n(A) = m, n(B) = n, n(B)  n(A)
Then total number of onto functions form A  B is nm – nC1 (n – 1)m + nC2 (n – 2)m + …
Here n(A) = m = 4, n(B) = n = 2
 The number of onto functions = 24 – 2C1  1 = 24 – 2 = 14
25. A is a set having 6 distinct elements. The number of distinct functions from A to A which are not
bijections is [CET 2018]
6 6
(A) 6!  6 (B) 6  6 (C) 6  6! (D) 6!
Ans (C)
Number of functions  n n  66 , number of bijections = n! = 6!
Number of functions which are not bijections = 66 – 6!
26. The number of bijective functions from the set A to itself, if A contains 108 elements is
(A) 108 (B) (108)! (C) (108)2 (D) 2108
Ans (B)
27. Let f : R  R be defined as f (x) = 3x. Then
(A) f is one-one and onto (B) f is many-one onto
(C) f is one-one but not onto (D) f is neither one-one nor onto
Ans (A)
28. The function f (x)  3 sin 2x  cos 2x  4 is one-one in the interval [CET 2021]
               
(A)  ,  (B)  ,  (C)  ,  (D)  , 
 6 3 6 3   2 2  6 3 
Ans (A)
f (x)  3 sin 2x  cos 2x  4
 3 1 
f (x)  2  sin x2x  cos 2x   4
 2 2 


 2 sin 2x cos

6

    
 cos 2x sin  4  2 sin  2x     4
6   6 

6
 2PBCBDM-Relations, Functions & Binary Operations(S)

   
sin x is one-one in  , 
 2 2
  
 2x  
2 6 2
   
  2x  
6 2 2 6
 2
 2x 
3 6
 
x
6 3
   
x , 
 6 3
 x 8
29. If f : R  R is a one-one function such that f ( x )  f   , then the values of x are
 x 1 
(A) 4, –2 (B) 4, 2 (C) –4, 2 (D) –4, –2
Ans (A)
Since f is one-one f(x1) = f(x2)  x1 = x2
 x 8 x 8
 f (x)  f  x 
 x 1  x 1
 x – x = x + 8  x2 – 2x – 8 = 0
2

 (x – 4) (x + 2) = 0
 x = 4 or –2
30. Let A = [–1, 1] and f : A  A be defined as f(x) = x|x| for all x  A, then f is
(A) one-one but not onto (B) onto but not one-one
(C) both one-one and onto (D) neither one-one nor onto
Ans (C)
  x 2 , 1  x  0
f (x)   2
x , 0  x 1
 domain = A and Range = A. Hence it is one-one and onto.
1 x
31. If e f ( x )  , then f(a) + f(b) is
1 x
a b  ab   ab   ab 
(A) f   (B) f   (C) f   (D) f  
 ab   1  ab   1  ab   1  ab 
Ans (B)
1 x 1 x 
ef ( x )   f ( x )  log e  
1 x 1 x 
1 a  1 b  (1  a )(1  b)
f (a )  f (b)  log e    log e    log
1 a  1 b  (1  a )(1  b)
 ab 
 1
 log 
1  ab  a  b   1  ab   f  a  b 
  log    
1  ab  a  b  1  a  b   1  ab 
 1  ab 

7
2PBCBDM-Relations, Functions & Binary Operations(S)

32. The domain of the function f (x)  1  1  1  x 2 is

(A) (–1, 1) (B) (–1, ) (C) (0, 1) (D) [–1, 1]
Ans (D)
1  x2  0 1  1  x 2  0, 1  1  1  x 2  0
 x2  1  x  [–1, 1]
33. If there are 5040 bijections from A to A, then the number of elements in A  A is
(A) 7 (B) 16 (C) 25 (D) 49
Ans (C)
The number of bijections = n! = 5040
n=7
 The number of elements in A  A is 72 = 49
1
34. Let f : R  R be defined by f (x)   x  R , then f is [CET 2015]
x
(A) f is not defined (B) bijective (C) onto (D) one-one
Ans (A)
1
f (x)  . It is not defined when x = 0
x
35. f : R  R and g: [0, )  R is defined by f(x) = x2 and g(x)  x . Which one of the following is not
true? [CET 2019]
(A) (f  g)(4)  4 (B) (g  f )( 2)  2 (C) (g  f )(4)  4 (D) (f  g)(2)  2
Ans (A)
(f  g)(4)  f[g(4)] is not defined.
36. If the function g(x) is defined by g(x) = a + bx and g r  g  g  g ... (repeated r times), then gr(x) =
a (b r  1)
(A) a + brx (B) ar + brx (C) a(br – 1) + brx (D)  br x
b 1
Ans (D)
g(x) = a + bx, g  g( x )  g (a  bx )  a  b(a  bx )
= a + ab + b2x
g  g  g( x )  g (a  ab  b 2 x )  a  b(a  ab  b 2 x )
= a + ab + ab2 + b3x  gr(x) = a + ab + ab2 + … + abr–1 + brx
(b r  1)
= a(1 + b + b2 + … br–1) + brx  a  br x
b 1
x
37. If f : R  R is defined by f (x)  2 , then f(f(2)) is [CET 2015]
x 1
29 10 1
(A) 29 (B) (C) (D)
10 29 29
Ans (C)
x
Given f (x)  2
x 1
2 2
2 10
 f[f (2)]  f    5  5 
 5  4  1 29 29
25 25

8
 2PBCBDM-Relations, Functions & Binary Operations(S)

38. If f : R  R is defined by f(x) = x3 + 1, then f 1 (9) is equal to

(A) 2 (B) –2 (C) 0 (D) 1
Ans (A)
f(x) = 9  f–1(9) = x
 x3 + 1 = 9  x3 = 8  x = 2  f–1(9) = 2
39. Let f : R  R be defined by f (x) = 2x + 6 which is a bijective mapping. Then f 1 (x) is given by
x
(A) 2x + 6 (B) 6x + 2 (C)  3 (D) x – 3 [CET 2016]
2
Ans (C)
Let f 1 (x)  y  x  f (y)
x 6 x x
 x  2y  6  y    3  f 1 (x)   3
2 2 2
40. If f(x) = x – x + x – x …  where |x| < 1, then f 1 (x) is equal to
2 3 4

x x 1 x 1
(A) (B) (C) (D)
1 x 1 x x 1 x
Ans (B)
If f(x) = y, then f 1 (y)  x
x x
f (x )  y
1 x 1 x
y
 y + xy = x  x(1 – y) = y  x 
1 y
x
 f 1 ( x ) 
1 x
 4 4x
41. Let f : R      R be a function defined as f (x)  .
 3 3x  4
 4
The inverse of f is the map g: Range of f  R    given by
 3
3y 4y 4y 3y
(A) g(y)  (B) g(y)  (C) g(y)  (D) g(y) 
3  4y 4  3y 3  4y 4  3y
Ans (B)
Let f(x) = y
4x
  y  4x  3xy  4y
3x  4
4y
 x(4  3y)  4y  x 
4  3y
4y
 f 1 (y)  g(y) 
4  3y
42. If f(x) = x + 1 and g(x) = 2x2 – 3, then the value of (g  f ) 1 (5) is
(A) 1 (B) 2 (C) 0 (D) 3
Ans (A)
Let (g  f ) 1 (5)  x
 (g  f ) ( x )  5
 g(x + 1) = 5

9
2PBCBDM-Relations, Functions & Binary Operations(S)

 2(x + 1)2  3 = 5
 2(x + 1)2 = 8  (x + 1)2 = 4
x+1=2x=1
e x  e x
43. Let f : R  R be defined by f ( x )  , then the inverse of f(x) is
2
(A) log e ( 1  x 2 ) (B) log e (x  1) (C) log e (x  1  x 2 ) (D) loge(x2 + 1)
Ans (C)
e x  e x
Let y   2ye x  (e x )2  1
2
 (e x ) 2  2ye x  1  0
2y  4y 2  4
 ex   y y2  1
2
Now, y 2  1  y 2  y 2  1  y  0  y  y 2  1
Since ex > 0, e x  y  y2  1


 x  log e y  1  y 2 

 f 1 (y)  log e y  1  y 2   f 1 ( x )  log e  x  1  x 2 
 
44. The binary operation * defined on the set of integers as x * y = |x – y| + 2 is
(A) not commutative (B) commutative (C) associative (D) distributive
Ans (B)
x * y = |x – y| + 2, y * x = |y – x| + 2
since |x – y| = |y – x|, * is commutative.
45. If the operation  is defined by a  b = a2 + b2, for all real numbers a and b, then (2  3)  4 is
(A) 185 (B) 184 (C) 182 (D) 181 [CET 2015]
Ans (A)
Given a  b = a2 + b2 for all a, b  R
 (2  3)  4 = (22 + 32)  4 = 13  4 = 169 + 16 = 185
46. Number of binary operations on the set {a, b} is
(A) 10 (B) 16 (C) 20 (D) 8
Ans (B)
Let A = {a, b}  n(A) = 2
Binary operation is a function from A  A  A
2
 Number binary operations =  2n = 24 = 16
47. Let a binary operation ‘*’ be defined on the set N of natural numbers by a * b = a + 2b. The identity
element w.r.t. this operation is
(A) 0 (B) 1 (C) –1 (D) does not exist
Ans (D)
Let e be the identity element. Then
a * e = a a + 2e = a  e = 0  N
 Identity element does not exist.

10
 2PBCBDM-Relations, Functions & Binary Operations(S)

48. Let A be a set containing 3 distinct elements. Then the number of commutative binary operations that
can be defined on A is
(A) 33 (B) 39 (C) 36 (D) 3
Ans (C)
n ( n 1) 3( 4 )
If A has n elements then number of commutative binary operations = n 2
3 2
 36
ab
49. On the set of positive rational numbers Q+,  is defined by a  b  , a, b  Q  , the solution of the
3
equation 5  x  41 in Q+ is
27 1 20
(A) 20 (B) (C) (D)
20 20 27
Ans (B)
9 9
e  3, a 1   41 
a 4
5x 9 27
5  x  41   x
3 4 20

Assignment MCQs
1. If a relation R on the set {1, 2, 3} is defined by R = {(1, 1)}, then R is [CET 2020]
(A) Reflexive and transitive (B) Symmetric and transitive
(C) Only symmetric (D) Reflexive and symmetric
Ans (B)
R = {(1, 1)} on a set {1, 2, 3}
R is symmetric and Transitive
2. If A = {1, 2, 3}, B = {1, 4, 6, 9} and R is a relation from A to B defined by x is greater than y, then the
range of R is
(A) {1, 4, 9} (B) {4, 6, 9} (C) {1} (D) {2, 3}
Ans (C)
Given R  (x, y) x  y, x  A and y  B  {(2, 1), (3, 1)}
 Range of R = 1
3. The relation R on the set A = {x : | x | < 3, x  Z} is defined by R = {(x, y) : y = | x |, x  1}. Then the
number of elements in the power set of R is
(A) 32 (B) 16 (C) 8 (D) 64
Ans (B)
A = 2, 1, 0, 1, 2
R = (2, 2), (0, 0), (1, 1), (2, 2)
Therefore the number of elements in the power set of R is 24 = 16.
4. Define a relation R on A = {1, 2, 3, 4} as xRy, if x divides y. Then R is
(A) equivalence (B) symmetric and transitive
(C) reflexive and symmetric (D) reflexive and transitive
Ans (D)
Given A = {1, 2, 3, 4}
R is defined by xRy iff x divides y

11
2PBCBDM-Relations, Functions & Binary Operations(S)

This relation is not symmetric as 2 4 does not imply 4 2

But x | x,  x  R  R is reflexive
Also x | y and y | z  x | z  R is transitive
5. For real numbers x and y, define a relation R by (x, y)  R if and only if x  y  2 is an irrational
number. Then the relation R is
(A) reflexive (B) symmetric
(C) transitive (D) an equivalence relation
Ans (A)
(i) R is reflexive : For all x  R, x  x  2  2
 (x, x)  R
(ii) R is not symmetric :
( 2, 1)  R as 2  1  2  2 2  1 is an irrational number.
But (1, 2)  R as 1  2  2  1 is a rational number
 
(iii) R is not transitive : 1, 3  R and  
3, 2  R , but 1, 2  R  
6. Let L denote the set of all straight lines in a plane.
Let a Relation R be defined by l1Rl2  l1 is perpendicular to l2, where l1, l2  L. Then, R is
(A) reflexive (B) symmetric
(C) transitive (D) an equivalence relation
Ans (B)
l1 R l2  l1  l2
 l1  l2  l2  l1  l2 R l1  R is symmetric
7. On the set of real numbers, the relation R  {(x, y) |1  xy  0} is
(A) an equivalence relation (B) reflexive only
(C) transitive only (D) reflexive and symmetric but not transitive
Ans (D)
(i) For all x  R, 1 + x.x = 1 + x2 > 0  (x, x)  R.  R is Reflexive.
(ii) Let (x, y)  R  1 + xy > 0  1 + yx > 0  (y, x)  R.  R is symmetric.
 1 1 
(iii) R is not transitive, for example  1,   R and  ,1  R, but (1,1)  R
 2 2 
8. The maximum number of equivalence relations on the set H = {, , } is
(A) 1 (B) 2 (C) 3 (D) 5
Ans (D)
9. Let A = {1, 2, 3, 4, 5, 6, 7}, then the number of symmetric relations that can be defined on A is
(A) 249 (B) 49 (C) 77 (D) 228
Ans (D)
Given A = {1, 2, 3, 4, 5, 6, 7}
n2  n
The number of symmetric relations on the set with n elements  2 2

72  7 49  7 56
The number of symmetric relations on A is  2 2
2 2
 2 2  228

12
 2PBCBDM-Relations, Functions & Binary Operations(S)

x2
10. If f : R  R is defined by f (x)  , then f (f (1)) is [CET 2015]
x 1
1 29 1 1
(A) (B) (C) (D)
2 10 6 29
Ans (C)
1 1
1 1 1
f (1)   f (f (1))  4  4 f (f (1)) 
11 2 1 3 6
1
2 2
2x ; x 3
 2
11. Let f : R  R be defined by f (x)   x ; 1  x  3 . Then f(1) + f(2) + f(4) is [CET 2018]
3x ; x 1

(A) 9 (B) 14 (C) 5 (D) 10
Ans (A)
f ( 1)  f (2)  f (4)  3( 1)  22  2(4)  3  4  8 = 9
x1  1 
12. If f (x)  , then f   is equal to
x 1  f (x) 
1
(A) 1 (B) 0 (C) x (D)
x
Ans (D)
x 1
1
x 1 1 x 1  1   x 1  x  1 2 1
Given f (x)     f f   x 1  
x  1 f (x) x  1  f (x)   x  1  1 2x x
x 1

13. The domain of f ( x )  2  2x  x 2 is

(A)  1  3, 3  1 (B)   3, 3  (C) 0, 3  1 (D)  1  3, 0 

Ans (A)
f(x) is defined only if 2  2x  x2  0
 x2 + 2x  2  0  (x + 1)2  3  0
 (x  1) 2  3
  3  x 1  3
 1  3  x  3  1
14. The domain of the function f : R  R defined by f (x)  x 2  7x  12 is [CET 2019]
(A) (, 3]  (4, ) (B) (3, 4)
(C) (, 3]  [4, ) (D) (, 3]  [4, )
Ans (C)
F(x) is defined iff x 2  7x  12  0
 (x – 4) (x – 3)  0
 x  ( ,3]  [4, )

13
2PBCBDM-Relations, Functions & Binary Operations(S)

2x
15. Let f (x)  1  x and g(x)  , then which of the following is not correct?
x2 1
(A) domain of (f + g) = (1, ) (B) domain of (f + g) = [0, )
(C) range f  range g = {1} (D) range f  range g = [1, )
Ans (A)
Domain of f(x) = [0, ) and domain of g(x) = R
Range of f(x) = [1, ) and range of g(x) = [1, 1]
 Domain of (f + g) = [0, )  R = [0, )
Range of f  range of g = [1, )  [1, 1] = {1}
Range of f  range of g = [1, )  [1, 1] = [1, )
16. The domain of the function defined by f (x)  cos 1 x  1 is [CET 2020]
(A) [0, 2] (B) [–1, 1] (C) [0, 1] (D) [1, 2]
Ans (D)
f (x)  cos 1 x  1
–1  cos–1 x  1 and 1  x  1  1
0  (x – 1)  1  1  x  2
log (2x  3)
17. The domain of definition of the function f ( x )   5  2x is
x 1
 5 3 5   5  3 5
(A) 1,  (B)  ,  (C) 1,  (D)  , 
 2 2 2   2  2 2
Ans (D)
f(x) is defined for x  1 > 0, 2x  3 > 0 and 5  2x  0
3 5 3 5
 x > 1, x > and x   x
2 2 2 2
1
18. The range of the function f (x)  is
x 5
(A) R  {5} (B) R  {0} (C) R (D) (0, 5)
Ans (B)
1 1 5y  1
Given y   x 5  x  Range of f(x) is R  {0}
x 5 y y
19. The total number of injective mappings from a finite set with 5 elements to a set with 3 elements is
5! 5!
(A) (B) (C) 35 (D) 0
2 6
Ans (D)
Since n(B) < n(A), number of injective mappings = 0
20. If A  x | x  N, x  5 and B  x | x  Z, x 2  5x  6  0 , then the number of onto functions from A
to B is [CET 2019]
(A) 23 (B) 32 (C) 2 (D) 30
Ans (D)
A = {1, 2, 3, 4, 5} and B = {2, 3)
Number of onto functions from a set to a set containing 2 elements is  2n  2 = 25 – 2 = 30

14
 2PBCBDM-Relations, Functions & Binary Operations(S)

21. Set A has 2 elements and set B has 5 elements. The number of injections that can be defined from A to B
is
(A) 25 (B) 5 (C) 20 (D) 4
Ans (C)
Since 2 is less than 5, injective functions from A to B are defined.
5!
The total of such functions is 5 P2 
 5  2 !
5!
 = 20
3!
22. The number of bijective functions from set A to itself when A contains 12 elements is
(A) 12 (B) 123 (C) 12! (D) 212
Ans (C)
Let n(A) = m
Then number of bijective functions = m! = 12!
23. The function f : X  Y defined by f(x) = sin x is one-one but not onto, if X and Y are respectively equal
to
    
(A)  ,  and [1, 1] (B) 0,  and [1, 1]
 2 2  2
(C) [0, ] and [0, 1] (D) R and R
Ans (B)
 
If X  0,  and Y  [1, 1] , then f is one-one and is not onto.
 2

For example if sin x =   x = 225  X.
2
24. Let f : R  R be defined as f (x) = x4. Then [CET 2017]
(A) f is one-one and onto (B) f is many-one onto
(C) f is one-one but not onto (D) f is neither one-one nor onto
Ans (D)
f(1) = f(1) = 1  f is not one-one.
Consider an element 2  R (co-domain). But there is no element x  R (domain) such that f(x) = 2.
 f is not onto.
n 1
 2 , if n is odd
25. Let f : N  N be defined by f (n)   , then f is [CET 2014]
 n, if n is even
 2
(A) one-one and onto (B) one-one but not onto
(C) onto but not one-one (D) neither one-one nor onto
Ans (C)
11 2
(i) f (1)   1 and f (2)   1
2 2
 1 and 2 have the same image 1  f is not one-one
(ii) Since every natural number is an image of a natural number under f, the mapping is onto.

15
2PBCBDM-Relations, Functions & Binary Operations(S)

2x  1
26. Let f : N  R be the function defined by f (x)  and g : Q  R be another function defined by
2
3
g(x) = x + 2. Then (g  f ) is
2
1 7 9
(A) 1 (B) (C) (D)
2 2 3
Ans (D)
2x  1
Given f (x)  and g(x) = x + 2
2
 3 
3   3   2    1
(g  f )  g  f     g   2  
2   2   2 
= g(1) =1 + 2 = 3
1
27. If f (x)  8x 3 and g(x)  x 3 , then (f  g)(x) is [CET 2017]
1
(A) 8x 3 (B) (8x) 3
(C) 83 x (D) 8x
Ans (D)
(f  g)(x)  f[g(x)]  f  x1 3   8x

1
28. Domain of the function f (x)  , where [x] is greatest integer  x is [CET 2021]
[x]  [x]  6
2

(A) ( ,  2)  [4, ) (B) ( ,  2)  [3, )

(C) ( ,  2]  [4, ) (D) (– ,  2)  (3, )
Ans (A)
1
f (x) 
[x]  [x]  6
2

[x]2  [x]  6 > 0

([x]  3) ([x] + 2) > 0
[x] <  2 or [x] > 3
( ,  2)  [4, )
29. Let f, g : R  R be two functions defined as f(x) = | x | + x and g(x) = | x |  x,  x  R. Then
 f  g  (x) for x < 0 is [CET 2018]
(A) 0 (B) 4x (C) 4x (D) 2x
Ans (C)
2x if x  0  0 if x  0
f (x)  | x |  x   and g(x)  | x |  x  
 0 if x  0 2x if x  0
Now for x < 0,  f  g  (x)  f[g(x)]
 f[2x]  2( 2x)  4x
2x
30. If f ( x )  , then the domain of f 1 (x) is
2x
(A) (–, ) (B) (–, –2) (C) R – {–2} (D) R – {–1}
Ans (D)
f(x) = y  f–1(y) = x

16
 2PBCBDM-Relations, Functions & Binary Operations(S)

2x
y  2y  xy  2  x
2x
2(1  y)
 x(y  1)  2(1  y)  x 
1 y
2(1  y) 2(1  x)
 f 1 ( y)  and f 1 (x) 
1 y 1 x
1
 Domain of f (x) = R – {–1}
31. If n(A) = 2 and total number of possible relations from set A to set B is 1024, then n(B) is [CET 2020]
(A) 20 (B) 10 (C) 5 (D) 512
Ans (C)
n(A) = 2
2mn = 1024
 22 n  210
225  210
n(B) = 5
32. If f : R  R is defined by f (x)  x 2  1, then values of f 1 (17) and f 1 (3) respectively are
(A) , {4, 4} (B) {3, 3},  (C) , {3, 3} (D) {4, 4}, 
Ans (D)
Let f 1 (y)  x  y  f (x)  y  x 2  1  x  y  1
 f 1 (x)  x  1
f 1 (17)  17  1  4 and for y = 3, x becomes imaginary that is, there is no value of x.
Hence, f 1 (17)  {4, 4} and f 1 ( 3)  
33. If f(x) = 3x  2 and (g  f ) 1 ( x )  x  2 . Then the function g(x) =
x 8 x 8 x 3 x3
(A) (B) (C) (D)
3 3 8 8
Ans (A)
x2
Given f (x)  3x  2  f 1 (x) 
3
Now (g  f ) ( x )  x  2
1

  f 1  g 1  (x)  x  2
 f 1[g 1 (x)]  x  2
g 1 (x)  2
 x2
3
 g 1 (x)  3x  6  2  3x  8
x 8
Let g 1 (y)  x  3y  8  x  y 
3
x 8
 g 1 (y)  x  y  g(x)  g(x) 
3
5
34. If f(x) = [x], the greatest integer in x and g(x) = |x – 1|, then  f  g    is
2
(A) 1.5 (B) 1 (C) 2 (D) 2.5

17
2PBCBDM-Relations, Functions & Binary Operations(S)

Ans (B)
5   5 
f  g   f g 
2   2 
3
f 
2
3
  =1
2
3
35. The domain of f (x)   log10 (x 3  x) is
4  x2
(A) (1, 2) (B) (1, 0)  (1, 2)
(C) (1, 2)  (2, ) (D) (1, 0)  (1, 2)  (2, )
Ans (D)
f(x) is defined when 4  x2  0 and x3  x > 0
 x   2 and x (x + 1) (x  1) > 0 2 +

 Domain = (1, 0)  (1, 2)  (2, )  1 0  1 2

1
36. The domain of the function f (x)  is
| x | x
(A) (, ) (B) (1, ) (C) (, 0) (D) (, ) {0}
Ans (C)
f(x) is defined if | x |  x > 0
If x  0, then x  x > 0  0 > 0  no solution
If x < 0, then  x  x > 0  x < 0
 Domain of f(x) is (, 0)
2
37. The range of f (x)  3sin  x 2 is
16
 3       
(A) 0,  (B)   ,  (C)  3, 3 (D)   , 
 2  4 4  2 2
Ans (A)
2
f (x) is defined only when  x2  0
16
2 
 x2  | x | 
16 4
 2
  
2
Then  x 2 takes the values in 0, 
16  16 
2  
  x 2 takes the values in 0, 
16  4
 3 
 f (x) takes the values in 0, 
 2
7 x
38. The range of the function f (x)  Px 3 is
(A) {1, 2, 3} (B) {1, 2, 3, 4, 5, 6} (C) {1, 2, 3, 4} (D) {1, 2, 3, 4, 5}
Ans (A)

18
 2PBCBDM-Relations, Functions & Binary Operations(S)

f(x) is defined if 0  x  3  7  x  3  x  5
 x = 3, 4, 5
 Domain of f is {3, 4, 5}
f(3) = 4P0 = 1, f(4) = 3P1 = 3, f(5) = 2P2 = 2  Range of f = {1, 2, 3}
1 x 
39. If 2f (x  1)  f    x , then f(x) is
 x 
1 1  (1  x) 1 1 1 
(A)  2(1  x)   (B) 2(1  x)  (C) x 2  2  4 (D) (x  2)  
3 1 x  x x 4 x  2
Ans (A)
1 
Given 2f (x  1)  f   1  x …(1)
x 
1 1  1
Replacing x by , we get 2f  1  f  x  1  …(2)
x x  x
1
Multiplying (1) by 2 and after adding with (2), we get 3f (x  1)  2x 
x
1 1 1 
Changing x to x + 1, we get 3f (x)  2(x  1)   f (x)  2(x  1)  
(x  1) 3 (x  1) 
40. The period of the function f(x) = sin(3x + 2) is
 2  3
(A) (B) (C) (D)
3 3 6 7
Ans (B)
T
If the period of f(x) is T, then period of f(ax + b) is
|a|
2
 Period of sin(3x + 2) is
3
41. Consider a binary operation  on N defined as a  b = a3 + b3. The correct answer is
(A)  both associative and commutative (B)  commutative but not associative
(C)  associative but not commutative (D)  neither commutative nor associative
Ans (B)
ab
42. Let * be a binary operation defined on R by a * b  for all a, b  R. Then the operation * is
4
(A) commutative and associative (B) associative but not commutative [CET 2016]
(C) commutative but not associative (D) neither commutative nor associative
Ans (C)
ab
Given a * b  ,  a, b  R
4
ab ba
(i) For all a, b  R, a * b    b * a  * is commutative
4 4
(ii) Let a, b, c  R
ab bc
c a
ab 4 a  b  4c  b  c  4  4a  b  c
(a * b) * c   *c   and a * (b * c)  a *  
 4  4 16  4  4 16
 (a * b) * c  a * (b * c)  * is not associative.

19
2PBCBDM-Relations, Functions & Binary Operations(S)

43. For any two real numbers, an operation * defined by a * b = 1 + ab is [CET 2014]
(A) both commutative and associative (B) neither commutative nor associate
(C) associative but not commutative (D) commutative but not associative
Ans (D)
Given a * b = 1 + ab on R
(i) For all a, b  R , a  b = 1 + ab = 1 + ba = b  a.  * is commutative
(ii) a  (b  c) = a  (1 + bc) = 1 + a(1 + bc) = 1 + a + abc
(a  b)  c = (1 + ab)  c = 1 + (1 + ab)c = 1 + c + abc
 a  (b  c)  (a  b)  c  * is not associative
a
44. Binary operation * on R  {1} defined by a * b  is [CET 2017]
b 1
(A) associative and commutative (B) neither associative nor commutative
(C) commutative but not associative (D) associative but not commutative
Ans (B)
1 1 2
(i) 1* 2   and 2 *1  1  1 * 2  2 * 1  * is not commutative
2 1 3 11
1 1 1 2
(ii) (1* 2) *3  *3  and 1* (2 *3)  1*   (1 * 2) * 3  1 * (2 * 3)  * is not associative
3 12 2 3
45. On the set Q of all rational numbers the operation  which is both associative and commutative is given
by a  b =
(A) 2a + 3b (B) ab + 1 (C) a2 + b2 (D) a + b + ab
Ans (D)
a  b = a + b + ab
Consider (a  b)  c = (a + b + ab)  c
= a + b + c + ab + ac + bc + abc
Now a  (b  c) = a  (b + c + bc)
= a + b + c + bc + ab + ac + abc   is associative
Also, a  b = b  a  * is commutative.
46. In the set of rational numbers under the operation  given by a  b = a + b + 1, the identity is
(A) 1 (B)  1 (C) 0 (D) 2
Ans (B)
Given a  b = a + b + 1
By identity law, a  e = a  a + e + 1 = a  e = 1  Q
47. On the set Z, of all integers * is defined by a * b = a + b  5. If 2 * (x * 3) = 5, then x =
(A) 5 (B) 10 (C) 0 (D) 3
Ans (B)
Given 2 * (x *3)  5  2  (x  3  5)  5
 2  x  2  5  2 + x  2  5 = 5  x = 10
48. If A = {a, b, c}, then the number of binary operations on A is [CET 2020]
(A) 36 (B) 33 (C) 39 (D) 3
Ans (C)
2 2
The number of binary operations are n n  33  39

20
 2PBCBDM-Relations, Functions & Binary Operations(S)

3ab
49. On the set of all non-zero reals, an operation  is defined as a  b  . In this group, the solution of
2
(2  x)  31  41 is
3 1
(A) (B) (C) 1 (D) 6
2 6
Ans (B)
3ae 2
By identity law, a * e  a  ae
2 3
1
3aa 2 4
By inverse law, a * a 1  e    a 1 
2 3 9a
Given (2  x)  31  41  2  x  41 *3
1
3 3
3 2 x 1 9 x1
  *3  3x 
2 9 2 6
2ab
50. On the set of positive rationals, a binary operation * is defined by a * b  . If 2 * x  31 , then x =
5
5 125 1 2
(A) (B) (C) (D) [CET 2019]
12 48 6 5
Ans (B)
2ab
Given a * b 
5
2ae 5
By identity law, a * e  a  ae
5 2
1
2aa 5 25
By inverse law, a * a 1  e    a 1 
5 2 4a
2(2x) 25 125
Now, 2 * x  31   x
5 4(3) 48

JEE Main

1. Let X = {1, 2, 3, 4, 5, 6, 7, 8, 9}. Let R1 and R2 be two relations on X given by

R1 = {(x, y) : x – y is divisible by 3} and
R2 = {(x, y) : {x, y}  {1, 4, 7} or {x, y}  {2, 5, 8} or {x, y}  {3, 6, 9}, then
(A) R1 = R2
(B) R1 is not an equivalence relation
(C) R1  R2
(D) R2 is not an equivalence relation
Ans (A)
Here the elements of sets {1, 4, 7}, {2, 5, 8} and {3, 6, 9} are such that the difference between the
elements in each set is a multiple of 3
 (x, y) R1  x – y is a multiple of 3
 {x, y}  {1, 4, 7} or {x, y}  {2, 5, 8} or {x, y}  {3, 6, 9}
 (x, y)  R2
Thus R1 = R2

21
2PBCBDM-Relations, Functions & Binary Operations(S)

2. Consider the following relations: [AIEEE 2010]

R = (x, y) : x, y are real numbers and x = wy for some rational number w.
 m p  
S   ,  m, n, p and q are such that n, q  0 and qm  pn  .
 n q  
Then
(A) R is an equivalence relation but S is not an equivalence relation
(B) neither R nor S is an equivalence relation
(C) S is an equivalence relation but R is not an equivalence relation
(D) R and S both are equivalence relations
Ans (C)
(i) For a  0, (0, a)  R but (a, 0)  R. Thus R is not symmetric.
Hence R is not an equivalence relation.
(ii) S is an equivalence relation
 5x  x 2 
3. The domain of the function f (x)  log10   is
 4 
(A) [1, 4] (B) [1, 0] (C) [0, 5] (D) [5, 0]
Ans (A)
 5x  x 2  5x  x 2
f(x) is defined only if log10    0  1
 4  4
 x2  5x + 4  0  (x  1) (x  4)  0  x  [1, 4]
4. The range of the function f(x) = loge (3x2  4x + 5) is
  11    1    11     11  
(A) log e   ,   (B)  log   ,   (C)  , log  3   (D)  , log   
 3    3       3 
Ans (A)
f is defined if 3x2 – 4x + 5 > 0
Discriminant of 3x2  4x + 5 = (4)2  60 = 44 < 0 and coefficient of x2 = 3 > 0
Hence, (3x2  4x + 5) > 0 for all x  R
 Domain of f is R.
Let y = loge (3x2  4x + 5)
 3x2  4x + 5 = ey  3x2  4x + (5  ey) = 0
Since x is real, discriminant  0
 42  4(3)(5  ey)  0
44
 ey 
12
11  11 
 e y   y  log e  
3 3


5. The function f (x)  log x  x 2  1 , is 
(A) an even function (B) an odd function
(C) a periodic function (D) neither an even nor an odd function

22
 2PBCBDM-Relations, Functions & Binary Operations(S)

Ans (B)
  
Given f (x)  log x  x 2  1  f (  x)  log  x  x 2  1 

Consider f (x)  f ( x)  log x  x  1   log   x 
2
x2  1  = log (1) = 0

Hence f(x) is an odd function

6. The period of y = [sin 3x] + [cos 6x], where [] denotes the greatest integer function, is
 2
(A) (B)  (C) (D) 2
2 3
Ans (C)
2
[sin(3x + 3T1)] = [sin 3x] if 3T1 = 2, 4, 6, . . .  T1 =
3

[cos 6x] = [cos 6(x + T2)] if 6T2 = 2, 4, 6, . . .  T2 =
3
2  2
 Period of y = LCM of and =
3 3 3
 x if x  Q
7. If f(x) is defined on [0, 1] by f (x)   , then for x  [0, 1]
1  x if x  Q
(A) (f  f) (x) = 1  x (B) (f  f) (x) = 1 + x (C) (f  f) (x) = x (D) (f  f) (x) = 2 + x
Ans (C)
Let x  [0, 1]
(i) when x  Q, f(x) = x
 (f  f )(x)  f (f (x))  f (x)  x ( x  Q)
(ii) when x  Q, f(x) = 1  x
 (f  f )(x)  f (f (x))  f (1  x)  1  (1  x)  x ( x  Q  1  x  Q)
In both the cases (f  f )(x)  x
n
8. If f : R R satisfies f(x + y) = f(x) + f(y), for all x, y  R and f(1) = 7, then  f (r)
r 1
is

7n 7(n  1) 7n(n  1)
(A) (B) (C) 7n (n + 1) (D)
2 2 2
Ans (D)
n

 f (r)  f (1)  f (2)  f (3)    f (n)

r 1

= f(1) + 2f(1) + 3f(1) + … + nf(1) [since f(x + y) = f(x) + f(y)]

= (1 + 2 + 3 + … + n) f(1)
n(n  1) 7n(n  1)
 7 
2 2
1
9. If f (x)  2f    3x, x  0 and S = {x  R : f(x) = f(x)}, then S [Mains 2016]
x
(A) contains more than two elements (B) is an empty set
(C) contains exactly one element (D) contains exactly two elements
Ans (D)
1
Given f (x)  2f    3x …(1)
x

23
2PBCBDM-Relations, Functions & Binary Operations(S)

1
Replacing x by , we get
x
1 3 1 6
f    2f (x)   4f (x)  2f    …(2)
x x x x
2
Solving equations (1) and (2), we get f (x)  x
x
Now f(x) = f(x)
2 2
 x x
x x
4
 2x   x 2  2  x   2
x
10. If f(x) = (x + 1)2  1, x  1, then the set S = {x : f(x) = f 1(x)} is
  3  i 3  3  i 3 
(A) 0,1, ,  (B) {1, 0, 1}
 2 2 
(C) {1, 0} (D) 
Ans (C)
Let f 1(x) = y  x = f(y)
2
 x = (y + 1)  1
2
 x + 1 = (y + 1)
 y  x  1 1
 f 1 (x)  x  1 1
Given f(x) = f 1(x)
 (x  1)2  1  x 1 1
 (x  1) 2  x  1  (x + 1)4 = x + 1
 x + 1 = 0 or (x + 1)3 = 1  x = 1 or x + 1 = 1, , 2
Since , 2 are imaginary, x = 1, 0
 S = {1, 0}
11. If f (x)  2  x and g(x)  1  2x , then the domain of (f  g)(x) is
 3 1  1  1   3 1
(A)   ,   (B)  ,  (C)   , 2  (D)   , 
 2 2  2  2   2 2
Ans (D)
Given f (x)  2  x and g(x)  1  2x
 1
D f   , 2 and D g   , 
 2
 1
Consider (f  g)(x)  f[g(x)]  f  1  2x  , x   ,  …(1)
 2
Also    1  2x  2  0  1  2x  2
 0  1  2x  4  1  2x  3
3 1
 x …(2)
2 2
 3 1
From (1) and (2), D f g   , 
 2 2

24
 2PBCBDM-Relations, Functions & Binary Operations(S)

12. A real valued function f (x) satisfies the functional equation f(x  y) = f(x) f(y)  f(2  x) f(2 + y) and
f(0) = 1, then f(4  x) is equal to
(A) f(x) (B) f(2) + f(2 x) (C) f(x) (D)  f(x)
Ans (D)
Given f(x y) = f(x) f(y)  f(2  x) f(2 + y) for all x, y  R
f (0) = (f (0))2  (f (2))2  f (2) = 0
Now f(4  x) = f [2  (x  2)]
= f(2) f(x  2)  f(0) f(x) =  f(x)
5
13. If g(x) = x2 + x  1 and (g  f )(x)  4x 2  10x  5, then f   us equal to [JEE Main 2020]
4
1 3 1 3
(A) (B)  (C)  (D)
2 2 2 2
Ans (C)
g(f(x)) = f2 (x) + f(x)  1
2
  5  5 5 5
g  f     4    10.  5 
  4  4 4 4
  5  5 5
g  f    f 2    f   1
  4  4 4
5 5 5
  f 2    f   1
4 4 4
5 5 1
f2 f   0
4 4 4
2
 5 1
f      0
 4 2
5 1
f 
 
4 2
1
x
14. f : R  R is defined by f(x) = 2x  1, g(x)  2 , then f(g(x)) is
x 1
(A) one-one, onto (B) many-one, onto (C) one-one, into (D) many-one, into
Ans (C)
 1
2 x  
2 x
f (g(x))  2g(x)  1   
x 1 x 1
1
f (g(x))  1 
x 1
15. Set A contains 3 elements, set B contains 5 elements, number of one-one functions from A to B is x, and
number of one-one function from A to A  B is ‘y’ then [JEE main 2021]
(A) 2y = 78 x (B) 4y = 91 x (C) 2y = 91 x (D) y = 52 x
Ans (C)

25
2PBCBDM-Relations, Functions & Binary Operations(S)

Numerical Problems
    5
16. If f ( x)  sin 2 x  sin 2  x    cos x cos  x   and g    1 , then (g  f) (x) is equal to
 3  3  4
Ans 1
   
Given f (x)  sin 2 x  sin 2  x    cos x cos  x  
 3  3
1  2    
 1  cos 2 x  1  cos  2 x    cos  2 x    cos 
2  3   3 3
1 1  2  1   1
 1  cos 2 x  cos  2 x    cos  2 x   
2 2  3  2  3 4
5 1    1  
  2 cos  2 x   cos  cos  2 x  
4 2  3 3 2  3
5 1   1   5 5
  cos  2 x    cos  2 x     (g  f )(x)  g(f (x))  g    1
4 2  3 2  3 4 4
2
x  x [x ]}
17. The period of the function f (x)  20{sin  cos 2 x is (where [x] denotes greatest integer function)
Ans 1
sin2 (x + 1) = sin2( + x) = sin2 x, (x + 1)  [x + 1] = x  [x] and
cos2 (x + 1) = cos2( + x) = cos2x
Hence f(x + 1) = f(x)
 Period of f(x) is 1
Aliter
Period of sin 2 x is 1, period of x  [x]  {x} is 1 and period of cos2 x is 1
 Period of f (x) is 1
18. If f(x) is a real valued function satisfying f(x + y) = f(x) + f(y)  xy  1 for all x, y  R such that
f(1) = 1, then the number of solutions of f(n) = n, n  N is
Ans 1
Given f(x + y) = f(x) + f(y)  xy  1
Replacing x by n and y by 1, we get f(n + 1) = f(n)  n, for all n  N
 f(n + 1) < f(n)  f(n + 1) < f(n) < f(n  1) <  < f(2) < f(1) = 1
 f(n + 1) < 1 for all n  N  f(n) = n only for n = 1
 a  b, if a  b  6
19. A binary operation * on the set {0, 1, 2, 3, 4, 5} is defined as a * b  
a  b  6, if a  b  6
Find the identity element.
Ans 0
The operation table for * is given as
* 0 1 2 3 4 5
0 0 1 2 3 4 5
1 1 2 3 4 5 0
2 2 3 4 5 0 1
3 3 4 5 0 1 2
5 5 0 1 2 3 4
From the table, we note that a * 0 = 0 * a = a, for all a  {0, 1, 2, 3, 4, 5}
Hence, 0 is the identity for operation

26
 2PBCBDM-Relations, Functions & Binary Operations(S)

20. Let f be a function such that f(m + n) = f(m)f(n) and f(6) = 18, f(1) = 3. Then find the value of f(2)f(3)
Ans 6 [JEE Main 2021]
f(m + n) = f(m)f(n)
f(1 + 5) = f(1)f(5)
18 = 3f(5)
f(5) = 6
f(2 + 3) = f(2)f(3) = 6

Solution to Self Assessment Test – 1.1

1. Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)} be a relation on the set
A = {3, 6, 9, 12}. Then the relation R is
(A) reflexive and symmetric only (B) an equivalence relation
(C) reflexive only (D) reflexive and transitive only
Ans (D)
(i) For all x  A, (x, x)  R  R is reflexive
(ii) (6, 12)  R but (12, 6)  R  R is not symmetric
(iii) (x, y), (y, z)  R  (x, z)  R  R is transitive
2. Let R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation on the set A = {1, 2, 3, 4}. The relation R is
(A) a function (B) transitive (C) not symmetric (D) reflexive
Ans (C)
(i) R is not a function because image of 2 is 4 as well as 3
(ii) R is not transitive because (4, 2), (2, 3)  R but (4, 3)  R
(iii) R is not symmetric because (2, 3)  R but (3, 2)  R
(iv) R is not reflexive because (1, 1), (2, 2), (3, 3), (4, 4)  R
3. 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) an equivalence relation (D) reflexive, transitive but not symmetric
Ans (D)
Since n divides n,  n  N, R is reflexive.
R is not symmetric because (3, 6)  R but (6, 3)  R.
Since for n, m, r whenever n divides m and m divides r, then n will divide r, R is transitive.
4. Let L denote the set of all straight lines in a plane. Define a relation R on L by lRm if and only if l is
perpendicular to m. Then R is
(A) reflexive (B) symmetric (C) transitive (D) an equivalence relation
Ans (B)
5. Let R = {(b, c), (c, d)} be a relation defined on the set A = {a, b, c, d}. The minimum number of ordered
pairs to be added to R so that resulting R is an equivalence relation is
(A) 2 (B) 3 (C) 5 (D) 8
Ans (D)
Given R = {(b, c), (c, b)} … (1)

27
2PBCBDM-Relations, Functions & Binary Operations(S)

To make it reflexive, we change R as follows

i.e., R = {(a, a), (b, b), (c, c), (d, d), (b, c), (c, d)}
We have added 4 ordered pairs to make it reflexive.
We write R as R = {(a, a), (b, b), (c, c), (d, d), (b, c), (c, b), (c, d), (d, c)}
Now we have added 2 more ordered pairs to make R as symmetric.
Finally to make it transitive, we change R to
R = {(a, a), (b, b), (c, c), (d, d), (b, c), (c, b), (c, d), (d, c), (b, d), (d, b)}
Again we have added 2 more ordered pairs.
 Totally 8 more ordered pairs must be added to R in (1) to make it as an equivalence relation.
6. If a relation R on the set {1, 2, 3} is defined by R = {(2, 2)}, then R is
(A) Reflexive and transitive (B) Symmetric and transitive
(C) Only symmetric (D) Reflexive and symmetric
Ans (B)
R = {(1, 1)} on a set {1, 2, 3}
R is symmetric and Transitive
7. 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
Ans (B)
(i) aRa  a is brother of a, which is not true.
 R is not reflexive.
(ii) aRb  a is brother of b
This does not mean b is also a brother of a ( b can be a sister of a)
 R is not symmetric.
(ii) aRb and bRc
 a is brother of b and b is a brother of c
 a is a brother of c
 R is transitive.
1
8. Let f: R  R be defined by f (x)  , x  R . Then f is
x
(A) one-one (B) onto (C) bijective (D) f is not defined
Ans (D)
For x = 0, f(x) is not defined.
Therefore, f(x) is not a defined function.
1
 2x  1 3
9. The domain of the function y   2  is
 x  10x  11 
(A) (, ) (B) (0, ) (C) (, 0) (D) R  {1, 11}
Ans (D)
The function is defined only if x2  10x + 11  0
 (x  11) (x + 1)  0
 x  1 and x  11

28
 2PBCBDM-Relations, Functions & Binary Operations(S)

10. The domain of (x  2)(3  x) is

(A) (2, 3) (B) [2, 3] (C) (, 3) (D) (2, )
Ans (B)
The function is defined only if (x  2) (3  x)  0  2  x  3
x2
11. The range of y  is
1  x2
(A) [0, 1] (B) [0, 1) (C) (0, 1) (D) (0, 1]

Ans (B)
Domain of y is R
x2 y y
Given y   x2  x
1 x 2
1 y 1 y
y
In either case, x is defined if 0 0y<1
1 y
x 1
12. If f (x)  , then f(2x) is equal to
x 1
f (x)  1 f (x)  3 3f (x)  1 f (x)  1
(A) (B) (C) (D)
f (x)  3 f (x)  1 f (x)  3 f (x)  1
Ans (C)
x 1
Given f (x) 
x 1
Using componendo and dividendo, we get
f (x)  1 (x 1)  (x  1)

f (x) 1 (x 1)  (x  1)
f (x)  1 1  f (x)
 x  x 
f (x)  1 1  f (x)
1  f (x) 
2 1
2x  1  1  f (x)  2  2f (x)  1  f (x) 3f (x)  1
Now f (2x)    
2x  1 1  f (x)  2  2f (x)  1  f (x) f (x)  3
2  1
1  f (x) 
13. If f = {(1, 4) (2, 5) (3, 6)} and g = {(4, 8) (5, 7) (6, 9)}, then gof is
(A) { } (B) {(1, 7) (2, 8) (3, 9)}
(C) {(1, 8) (2, 7) (3, 9)} (D) {(1, 4) (2, 5) (3, 6)}
Ans (C)
gof(1) = g(f(1)) = g(4) = 8
gof(2) = g(f(2)) = g(5) = 7
gof(3) = g(f(3)) = g(6) = 9
14. Let N be the set of natural numbers and the function f : N  N be defined by f (n) = 2n + 3,  n  N.
Then f is
(A) surjective (B) injective (C) bijective (D) not injective
Ans (B)

29
2PBCBDM-Relations, Functions & Binary Operations(S)

15. The number of functions from set A into set B, when n(A) = 9 and n(B) = 5 is
(A) 59 (B) 95 (C) 5! (D) 9!
Ans (A)
If n(A) = n and n(B) = m, then the number of functions from A to B is mn
Here n = 9, m = 5
 The number of functions 59
16. The number of bijective functions from set B to itself, when B contains 206 elements is
(A) 206 (B) (206)2 (C) 206! (D) 2206
Ans (C)
The total number of bijections from set containing n elements to itself is n!
Hence, required number = 206!
17. 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
Ans (B)
Given f(x) = x + 2
Let f(x1) = f(x2)  x1 + 2 = x2 + 2  x1 = x2  f(x) is one-one.
Let y  Z such that f(x) = y
x+2=yx=y2Z
 f(x) is onto.
Hence, f(x) is a bijective function.
x
 , if x is even
18. On the set Z of all integers define f : Z  Z as f (x)   2 . Then f is
 0, if x is odd
(A) oneone and onto (B) oneone but not onto
(C) onto but not oneone (D) into
Ans (C)
f(0) = 0 and f(1) = 0  f is not one-one
Range of f = Z = co-domain  f is onto.
19. If f and g are functions from R to R defined by f(x) = 2x + k and g(x) = 3x  1 such that f  g  g  f ,
then the value of k is
1 1
(A) 1 (B) 1 (C)  (D)
2 2
Ans (C)
Given (f  g)(x)  (g  f )(x)
 f(g(x)) = g(f(x))
 f(3x – 1) = g(2x + k)  2(3x – 1) + k = 3(2x + k) – 1
1
 6x – 2 + k = 6x + 3k – 1  k  
2
1 x  3x  x 3
20. If f (x)  log   and g(x)  , then (f  g)(x) equals
1 x  1  3x 2
(A) f (x) (B) 3f (x) (C) [f (x)]3 (D) [f (x)]2

30
 2PBCBDM-Relations, Functions & Binary Operations(S)

Ans (B)
 1  g(x) 
f  g(x)  log  
 1  g(x) 
 3x  x 3 
1  
 f (g(x))  log  1  3x 3
2

1  3x  x 
 1  3x 2 
3
 1  x   f (g(x))  3 log  1  x   3f (x)
 f (g(x))  log    
1 x   1 x 
21. Let f : R  R be the function defined by f (x) = x3 + 5. Then f 1 (x) is
1 1 1
(A) (x  5) 3 (B) (x  5) 3 (C) (5  x) 3 (D) 5 – x
Ans (B)
Given f(x) = x3 + 5
1
Consider y  x 3  5  x 3  y  5  x  (y  5) 3
1
1
 f (x)  (x  5) 3

1
22. If f : [0, )  [2, ) is given by f (x)  x  , then f 1 (x) is equal to
x
x  x2  4 x 2x  x 2  4
(A) (B) (C) (D) 1  x 2  4
2 1 x2 2
Ans (A)
1
Let f (x)  y  x   x 2  xy  1  0
x
y  y2  4
x
2
y  y2  4 y  y2  4
x or x 
2 2
y  y2  4 y  y2  4
 f 1 (y)  or f 1 (y) 
2 2
x  x2  4
 f 1 (x) 
2
23. Let f : A  B and g : B  C be the bijective functions. Then (g  f ) 1 is
(A) f 1  g 1 (B) f  g (C) g 1  f 1 (D) g  f
Ans (A)
If f : A  B and g : B  C be the bijective functions, then (g  f ) 1  f 1  g 1
24. Which of the following functions is not invertible?
(A) f : R  R, f(x) = 3x + 1 (B) f : R  [0, ], f(x) = x2
  3 
(C) f : R  R, f(x) = x3 (D) f :  ,   [ 1, 1] , f(x) = sin x
2 2 
Ans (B)
f(x) = x2 is not one-one because f(2) = 4 and f(2) = 4  f is not invertible

31
2PBCBDM-Relations, Functions & Binary Operations(S)

ab
25. In the set of non-zero real numbers  is defined by a  b   Then identity element is
2
1 1
(A) 1 (B) 2 (C) (D)
2 3
Ans (B)
ab
Given a  b 
2
ae
By identity law, a  e  a   a  e  2  R  {0}
2
26. Let Q1 be the set of all rational numbers except 1 and  be a binary operation defined by
a  b = a + b + ab,  a, b  Q1, then the solution of the equation 4  x = 3 is
3 1 1 1
(A) (B) (C)  (D)
4 5 5 3
Ans (C)
Given a  b = a + b + ab
1
 4 * x  3  4  x  4x  3  x  
5
27. Let * be a binary operation on the set of integers Z, defined by a * b = 2a + b  3. Then the value of
3 * 4 is
(A) 2 (B) 4 (C) 7 (D) 6
Ans (C)
Given a * b = 2a + b  3
 3 * 4 = 2(3) + 4  3
=6+43 =7
28. If a binary operation * is defined by a * b = a2 + b2 + ab + 1, then (2 * 3) * 2 is equal to
(A) 20 (B) 40 (C) 400 (D) 445
Ans (D)
Given a * b = a2 + b2 + ab + 1
 (2 * 3) * 2 = [(2)2 + (3)2 + (2)(3) + 1] * 2
= 20 * 2 = (20)2 + (2)2 + (20)(2) + 1
= 400 + 4 + 40 + 1 = 445
29. If the binary operation * on the set of integers Z, is defined by a * b = a + 3b2, then the value of 8 * 3 is
(A) 32 (B) 40 (C) 36 (D) 35
Ans (D)
Given a * b = a + 3b2 for all a, b  Z
 8 * 3 = 8 + 3.32 = 8 + 27 = 35
3ab
30. Let * be a binary operation on Q defined by a * b  . Then * is
5
(A) not associative but commutative (B) not commutative but associative
(C) both commutative and associative (D) neither commutative nor associative
Ans (C)
3ab
Given a * b  ,  a, b  Q
5

32
 2PBCBDM-Relations, Functions & Binary Operations(S)

3ab 3ba
(i) For all a, b  Q, a * b    b*a  * is commutative
5 5
(ii) Let a, b, c  Q
 3ab  9abc  3bc  9abc
(a * b) * c   *c  and a * (b * c)  a *  
 5  25  5  25
 (a * b) * c = a * (b * c)  * is associative.

Solution to Self Assessment Test - 1.2

1. If A is the set of even natural numbers less than 8 and B is the set of prime numbers less than 7, then the
number of relations from A to B is
(A) 29 (B) 92 (C) 32 (D) 29  1
Ans (A)
Here, A = {2, 4, 6} and B = {2, 3, 5}
 A  B contains 3  3 = 9 elements.
Hence, number of relations from A to B is 29 as A  B has 29 subsets.
2. Let A = {x, y, z} and B = {a, b, c, d}. Which one of the following is not a relation from A to B?
(A) {(x, a), (x, c)} (B) {(y, c), (y, d)} (C) {(z, a), (z, d)} (D) {(z, b), (y, b), (a, d)}
Ans (D)
In option (D), ordered pair (a, d)  A  B. Thus it is not a relation.
3. Let R be a relation on the set N of natural numbers defined by n Rm  n is a factor of m. Then R is,
(A) reflexive and symmetric (B) transitive and symmetric
(C) equivalence (D) reflexive, transitive but not symmetric.
Ans (D)
Reflexive : n|n for all nN
 R is reflexive.
Symmetric : 2|6 but 6 does not divide 2
 R is not symmetric.
Let nRm and mRp  n|m and m|p
 n|p  nRp, so R is transitive.
4. Let R be a relation defined on the set of integers given by aRb iff a = 2k b for some integer k, then R is
(A) an equivalence relation (B) reflexive but not symmetric
(C) reflexive and transitive but not symmetric (D) reflexive and symmetric but not transitive.
Ans (A)
(i) As 0I, a = 20. a, therefore, a R a for all a  I.
 R is reflexive.
(ii) Let a R b, then
a = 2k b for some integer k
 b = 2k a,  k is an integer ( k is an integer)
bRa
 R is symmetric.
(iii) Let aRb and bRc
 a = 2k b and b = 2lc, where k, l are integers

33
2PBCBDM-Relations, Functions & Binary Operations(S)

 a = 2k (2l c) = 2k+l c  a R c as k + l is an integer.

 R is transitive.
Hence, R is an equivalence relation.
5. If R is an equivalence relation on a set A, then R1 is
(A) Reflexive only (B) Symmetric but not transitive
(C) Equivalence (D) Transitive only
Ans (C)
Standard result
6. A relation R on the set of real numbers which is defined by (x, y)  R, if x2 = xy is
(A) Symmetric and reflexive (B) Reflexive but not symmetric
(C) Symmetric but not reflexive (D) neither reflexive nor symmetric
Ans (B)
x2 = x2  x  R  relation is reflexive.
(0, 5)  R but (5, 0)  R.  R is not symmetric.
7. On the set W of whole numbers an equivalence relation R is defined as follows : aRb iff both a and b
leave same remainder when divided by 5. The equivalence class of 1 is given by
(A) {0, 5, 10, 15, …} (B) {1, 6, 11, 16, …} (C) {2, 7, 12, 17, …} (D) {4, 9, 14, 19, …}
Ans (B)
Equivalence class of 1, i.e., [1] is the set of those whole numbers which leave remainder 1 when divided
by 5. ( when 1 is divided by 5, the remainder is 1)
 [1] = {1, 6, 11, 16, …}
8. Let W denote the words in English dictionary. Define relation R on W by R = {(x, y) : words x and y
have atleast one letter in common}. Then R is
(A) symmetric and transitive but not reflexive (B) reflexive and symmetric but not transitive
(C) reflexive, symmetric and transitive (D) reflexive, not symmetric and transitive
Ans (B)
Clearly R is reflexive and symmetric.
Now consider, three words x = “MODE”, y = “MARK”, z = “RAT”.
Clearly (x, y), (y, z)  R but (x, z)  R.
 R is not transitive.
9. If a relation R on the set {1, 2, 4} is defined by R = {(1, 1)}, then R is
(A) symmetric and transitive (B) only symmetric
(C) reflexive and symmetric (D) reflexive and transitive
Ans (A)
Since (2, 2), (3, 3)  R, R is not reflexive.
It is trivially transitive.
10. Let R be a relation on N be defined by a + 2b = 8. The range of R is
(A) {2, 4, 6} (B) {1, 2, 3} (C) {1, 2, 3, 4, 6} (D) {2, 4, 8}
Ans (B)
Range of R = {y : (x, y) R} Range of R = {1, 2, 3}

34
 2PBCBDM-Relations, Functions & Binary Operations(S)

11. Let A and B be finite sets containing respectively m and n elements. The number of functions that can be
defined from A to B is
(A) 2mn (B) mn (C) nm (D) nm
Ans (C)
Since each of m elements of A can be associated to an element of B in n ways, therefore, all the m
elements can be associated to elements of B in nm ways.
 Required number of functions = nm.
12. The set B onto which the set A = {3, 27} is mapped by the function f(x) = log3x is
(A) {0, 3} (B) {1, 3} (C) {1, 4} (D) {0, 4}
Ans (B)
Here, f(x) = log3 x, therefore, f(3) = log3 3 = 1 and f(27) = log3 27 = 3.
Hence, B = {1, 3}.
x
13. Let f (x)  , x  1, then range of f is
1 x
(A) ( , ) (B) ( 1, ) (C) ( ,  1) (D) ( ,  1)  ( 1, ).
Ans (D)
Clearly, Df = R  {1}. For Rf, let y = f(x)
x y
y  y  xy = x  x  is defined if y  –1
1 x 1 y
 Rf = R  { 1}.
 
14. The range of the function y = sin [x],   x  is
4 4
(A) {0} (B) {0,  1} (C) {0,  sin (1)} (D) {0,  sin 1}.
Ans (D)
 
For   x  0 , [x] =  1 and for 0  x  , [x] = 0, therefore, f(x) takes the values sin ( 1) and sin (0)
4 4
 
only in   x  . Hence, Rf = {0,  sin 1}.
4 4
15. Let S be the set of all triangles in a given plane ‘’ and R+ be the set of positive real numbers, then the
function f : S  R+ defined by
f(s) = area of s for all s  S, is
(A) injective but not surjective (B) surjective but not injective
(C) bijective (D) neither injective nor surjective.
Ans (B)
Corresponding to any +ve real p, we have a right triangle with sides 2p, 2p and 2 p whose area is
1
 2p  2p  p . So f is surjective.
2
Since there can be many triangles with the same area, f is not one-one.
16. Let f : I  I be defined by f(x) = x + i, where i is a fixed integer, then f is
(A) one-one but not onto (B) onto but not one-one
(C) non-invertible (D) both one-one and onto.
Ans (D)
f(x1) = f(x2)  x1 + i = x2 + i  x1 = x2 and for any integer y, y = x + i
 x = y  i, i.e., f(y  i) = y and hence f is both one-one and onto.

35
2PBCBDM-Relations, Functions & Binary Operations(S)

17. If f : A  B is a bijective, then (f−1of) is

(A) the identity function on B (B) the identity function on A
(C) equal to fof−1 (D) both option (A) and (D)
Ans (B)
For all x  A, (f−1of)(x) = f−1(f(x)) = f−1(y) = x
Then f−1of is the identity function on A.
    5
18. If f (x)  sin 2 x  sin 2  x    cos x cos  x   and g    1 , then (g  f ) (x) is equal to
 3  3 4
5
(A) 0 (B) 1 (C) sin x (D)
4
Ans (B)
 2 
1  cos  2x  
1  cos2x  3   1 cos  2x     cos  
Given f (x)      
2 2 2  3 3
1  2    
 1  cos 2x  1  cos  2x    cos  2x    cos 
2  3   3 3
1   2     1 
  2  cos 2x  cos  2x    cos  2x     
2   3   3  2 
5 1      
  2cos  2x   cos  cos  2x    (Using transformation formula)
4 2  3 3  3 
5 1 5
  (0)  , which is constant.
4 2 4
 (g of) (x) = g(f(x)) = g(5/4) = 1
1
19. If g(x) = x2 + x  2 and  g  f   x   2x 2  5x  2 , then f(x) is equal to
2
(A) 2x  3 (B) 2x + 3 (C) 2x2 + 3x + 1 (D) 2x2  3x  1
Ans (A)
1
Here, g(x) = x2 + x  2 and  gf   x   2x 2  5x  2
2
 g(f(x)) = 4x2  10x + 4
 (f(x))2 + f(x)  2 = 4x2  10x + 4
 (f(x))2 + f(x)  (4x2  10x + 6) = 0
1  1  16x 2  40x  24 1  (4x  5)
 f (x)    2x  3,  2x  2
2 2
20. Let function f : R  R be defined by f(x) = 2x + sin x for x  R. Then f is
(A) one-to-one and onto (B) one-to-one but NOT onto
(C) onto but NOT one-to-one (D) neither one-to-one nor onto.
Ans (A)
Here, f(x) = 2x + sin x
 f (x) = 2 + cos x  1 > 0 (  1  cos x  1,  1  2 + cos x  3)
 f is strictly increasing on R.
 f is one-one on R.
Moreover, every horizontal line does meet the graph of f(x), therefore, f is onto.

36
 2PBCBDM-Relations, Functions & Binary Operations(S)

21. Which of the following function is an even function?

a x  a x ax 1
(A) f (x)  x (B) f (x) 
a  a x ax 1
 ax 1 
(C) f (x)  x  x  (D) f (x)  log 2  x  x 2  1 
 a 1
Ans (C)
 ax 1 
f (x)  x  x 
 a 1
a x  1
Now, f ( x)  ( x)  x
a 1
1 ax   ax 1 
 x    x   x   f (x)  f(x) is even function.
 1  ax   a 1
22. For real x, let f(x) = x3 + 5x + 1, then
(A) f is onto R but not one-one (B) f is both one-one and onto R.
(C) f is neither one-one nor onto R (D) f is one-one but not onto R.
Ans (B)
Here, Df = R ( f is a polynomial)
2
Also, f (x) = 3x + 5 > 0 for all x  R.
 f is strictly increasing on R.
 f is one-one.
Again, if y  Rf, then y = f(x) for some x  R
 y = x3 + 5x + 1 or x3 + 5x + (1  y) = 0,
which being an odd degree equation with real coefficients, must have a real solution.
 Corresponding to each y  R, there exists x  R s.t. y = f(x)
 Rf = R Hence, f is onto.
23. The range of f(x) = cos x  sin x is
  
(A) ( 1, 1) (B) [1, 1) (C)   ,  (D)   2, 2 
 2 2
Ans (D)
Since maximum and minimum values of cos x  sin x are 2 and  2 respectively, therefore range of
f(x) is   2, 2 
1 tan  1
 
24. If f : 0,   R is defined as f ()   tan  1 tan  . Then the range of f is
 2
1  tan  1
(A) (2, ) (B) ( , 2] (C) [2, ) (D) (, 2]
Ans (C)
f() = 2 sec2 
Range of f = [2, )
25. The domain of f (x)  (x  7)(9  x) is
(A) (7, 9) (B) (7, 9] (C) [7, 9) (D) [7, 9]
Ans (D)
We have, f (x)  (x  7)(9  x)

37
2PBCBDM-Relations, Functions & Binary Operations(S)

f(x) is well defined for (x  7) (9  x)  0

(x  7) (9  x)  0
 (x  7) (x  9)  0
7x9 i.e., x [7, 9]
26. Let A be a set containing n distinct elements. Number of binary operations that can be defined on A is
2 2
(A) 2 n (B) n2 (C) 2n2 (D) n n
Ans (D)
Standard result
27. A binary operation ‘’ defined on the set of integers as a  b = |a  b|  1 is
(A) not commutative (B) commutative
(C) associative (D) neither commutative nor associative
Ans (B)
‘’ is commutative as b  a = |b  a|  1
= |a  b|  1 = a  b ( | x| = |x| for all x  R)
mn
28. In the set N of natural numbers the binary operation ‘’ is defined as follows, m  n  , where p is a
p
fixed number, then the identity element of  is
(A) a prime number (B) p + m + n (C) p  1 (D) p
Ans (D)
If the identity element is ‘e’, then m  e = m = e  m
me em
 m ep
p p
29. If a binary operation * is defined by a * b = a2 + b2 + ab + 1, then (2 * 3) * 2 is equal to
(A) 20 (B) 40 (C) 400 (D) 445
Ans (D)
(2 * 3) * 2 = (22 + 32 + 2  3 + 1) * 2
= 20 * 2 = 202 + 22 + 20(2) + 1 = 445
30. Let A = Q  Q, where Q is the set of rational numbers and * be a binary operation on A defined by
(a, b) * (c, d) = (ac, b + ad), for all (a, b), (c, d)  A. Then which of the following statement is/are true?
Statement I: The identity element of * in A is (0, 1)
Statement II: Inverse of elements of A exists.
(A) only statement I (B) only statement II
(C) Both statements I and II (D) neither statement I nor statement II
Ans (D)
Consider (a, b) * (0, 1) = (a(0), b + a(1)) = (0, a + b)  (a, b)
 Statement I is false
Also, consider (a, b) * (c, d) = (1, 0) ((1, 0) is the identity element)
 (ac, b + ad) = (1, 0)
 ac = 1 and b + ad = 0
1 b
c and d  exists only if a  0
a a
 For elements of the form (0, b), inverse does not exist.
 Statement II is false.

38
 2PBCBDM-Relations, Functions & Binary Operations(S)

Solution to Self Assessment Test - 1.3

1. Let A and B be two sets containing four and two elements respectively. Then the number of subsets of
the set A  B, each having at least three elements is
(A) 219 (B) 256 (C) 275 (D) 510
Ans (A)
n(A) = 4, n(B) = 2
n(A  B) = 8
No. of subsets   Total   No. of   No. of 
        No. of subsets 
with at least    no. of    empty    singleton    
3 elements   subsets   subsets   subsets   with 2elements 
      
= 28  1  8C1  8C2 = 28  1  8  28 = 28  37
= 256  37 = 219
2. Let X = {1, 2, 3, 4, 5, 6, 7, 8, 9}. Let R1 be a relation in X given by R1 = {(x, y) : x – y is divisible by 3}
and R2 be another relation on X given by
R 2  (x, y) |{x, y}  {1, 4, 7}or{x, y}  {2,5,8}or{x, y}  {3,6,9}
Then,
(A) R1  R2 (B) R2  R1 (C) R1 = R2 (D) R1  R2
Ans (C)
Note that the elements of each of the sets {1, 4, 7}, {2, 5, 8} and {3, 6, 9} are such that difference of the
elements is a multiple of 3. So {x, y} is a subset of one of these sets implies that x – y is divisible by 3.
Hence R1 = R2.
3. The void relation (a subset of A  A) on a non-empty set A is
(A) reflexive (B) reflexive and symmetric
(C) reflexive and transitive (D) transitive and symmetric
Ans (D)
The relation { }  A  A is surely not reflexive as (a, a) is not in relation for any aA.
However the void relation is symmetric and transitive.
4. Let R be the real line. Consider the following subsets of the plane R  R.
S = {(x, y) : y = x + 1 and 0 < x < 2}
T = {(x, y) : x  y is an integer}
Which one of the following is true?
(A) S is an equivalence relation on R but T is not (B) T is an equivalence relation on R but S is not
(C) neither S nor T is an equivalence relation on R (D) Both S and T are equivalence relations on R.
Ans (B)
Since x  x + 1, therefore, (x, x)  S
 S is not reflexive.
So, S cannot be an equivalence relation.
However, T is an equivalence relation as
(i) (x, x)  T for all x  R ( x  x = 0 is an integer)
(ii) (x, y)  T  x  y is an integer.
 y  x is an integer  (y, x)  T.

39
2PBCBDM-Relations, Functions & Binary Operations(S)

(iii) (x, y)  T and (y, z)  T

 x  y is an integer and also y  z is an integer.
 (x  y) + (y  z) is an integer.
 x  z is an integer  (x, z)  T.
5. For any two real numbers a and b, we define aRb if and only if sin2 a + cos2 b = 1. The relation R is
(A) Reflexive but not Symmetric (B) Symmetric but not transitive
(C) Transitive but not Reflexive (D) An Equivalence relation
Ans (D)
sin2 a + cos2 b = 1
Reflexive sin2 a + cos2 a = 1  aRa
aRb  sin2 a + cos2 b = 1  1  cos2 a + 1  sin2 b = 1
 sin2 b + cos2 a = 1  bRa
Hence symmetric.
Let aRb, bRc
 sin2 a + cos2 b = 1 and …(i)
2 2
sin b + cos c = 1 …(ii)
(i) + (ii)
 sin2 a + cos2 c = 1.
Hence, transitive therefore equivalence relation.
6. R  A  A (where A  ) is an equivalence relation, if R is
(A) Reflexive, symmetric but not transitive (B) Reflexive, neither symmetric nor transitive
(C) Reflexive, symmetric and transitive (D) Reflexive only
Ans (C)
By definition, a relation is equivalence if it is reflexive, symmetric and transitive.
7. Let A = {1, 2, 3, 4, 5, 6}. Which of the following corresponds to an equivalence relation on A?
(A) {1, 2, 3}, {3, 4, 5, 6} (B) {1, 2}, {4, 5, 6}
(C) {1, 2}, {3, 4}, {2, 3, 5, 6} (D) {1, 3}, {2, 4, 5}, {6}
Ans (D)
In (D), the given subsets are pairwise disjoint and their union is equal to the set A.
So it forms a partition and hence an equivalence relation on A.
8. If S is defined on R by (x, y)  S iff xy  0, then S is
(A) an equivalence relation (B) reflexive only
(C) symmetric only (D) transitive only
Ans (A)
 x  R, x2  0  (x, x)  S  x  R
 R is reflexive
(x, y)  S  xy  0  yx  0  (y, x)  R
 R is symmetric
(x, y)  S, (y, z)  S  xy  0 and yz  0
 xy2 z  0  xz  0 ( y2  0)
 (x, z)  S  R is transitive
 R is an equivalence relation.

40
 2PBCBDM-Relations, Functions & Binary Operations(S)

9. The function f : R  R defined by f(x) = 5x + 5|x| is

(A) one-one and onto (B) many one and onto
(C) one-one and into (D) many one and into
Ans (C)
5x > 0, 5|x| > 0 for all x  R.
So f is into. for different values of x, 5x and 5|x| are different positive numbers, clearly f is one-one.
10. Let R and S be two non-void relations on a set A. Which of the following statements is false?
(A) R and S are transitive  R  S is transitive (B) R and S are transitive  R  S is transitive
(C) R and S are symmetric  R  S is symmetric (D) R and S are reflexive  R  S is reflexive
Ans (A)
Let A = {1, 2, 3} and R = {(1, 1), (1, 2)}, S = {(2, 2) (2, 3)} be transitive relations on A.
Thus R  S = {(1, 1), (1, 2), (2, 2) , (2, 3)}
Obviously, R  S is not transitive. Since (1, 2)  R  S and (2, 3)  R  S but (1, 3)  R  S.
11. Let A contain n distinct numbers. How many bijections from A to A can be defined?
(A) n2 (B) n (C) n (D) n3
Ans (B)
A bijection from A to A is infact an arrangement of its n elements, taken all at a time, which can be done
in n ways. Hence, the number of bijections from A to A is n .
x
12. Range of the function f (x)  is
1 x
(A) (0, ) (B) [0, ) (C) [0, )  {1} (D) R – {–1}
Ans (C)
x
Note that f is defined only when 0.
1 x
 x <  1 or x  0
 Df = ( ,  1)  [0, )
For Rf, let y = f(x), x  Df
x
 y  y2 (1 + x) = x and y  0
1 x
y2
x
1  y2
Now x is real when y2  1, i.e., if y   1; but y  0, therefore, Rf = [0, )  {1}.
13. The domain of the function f(x) = logx (x + 2) is
(A) (0, ) (B) ( 2, ) (C) (0, 1)  (1, ) (D) (1, )
Ans (C)
For Df, x > 0, x  1 and x + 2 > 0
 x > 0, x  1, x >  2
 x > 0, x  1  x  (0, 1)  (1, )
14. Let a function f be strictly decreasing on [a, b], then range of f is
(A) [f (a), f(b)] (B) [f(b), f(a)] (C) (f (a), f(b)) (D) (f(b), f(a)).
Ans (B)
Since f is decreasing on [a, b], therefore, f(b) < f(a) (as b > a).

41
2PBCBDM-Relations, Functions & Binary Operations(S)

15. A mapping f : N  N, where N is the set of natural numbers, is defined as f(n) = n2, if n is odd
f(n) = 2n + 1, if n is even, for n  N, then f is
(A) surjective but not injective (B) injective but not surjective
(C) bijective (D) neither surjective nor injective.
Ans (D)
Note that f is not one-to-one as f(3) = 9 = f(4) etc.
Also f(n) is odd for all n  N.
When n is odd, f(n) = n2 is odd and also f(n) = 2n + 1 is odd when n is even.
 Rf  N as Rf contains no even integer.
16. Which of the following is an even function?
(A) x (B) x2 + sin2 x (C) sin3 x (D) ex
Ans (B)
Let f(x) = x2 + sin2 x, then f( x) = f(x), therefore, f(x) = x2 + sin2 x is an even function.
17. If the function f is defined for x  [0, 1], then the function f(2x + 3) is defined for
 3   3 
(A) x  R (B) x    ,1 (C) x    ,  1 (D) x  [0, 1]
 2   2 
Ans (C)
Let f(2x + 3) is defined only if
 0 ≤ 2x + 3 ≤ 1
3
 −3 ≤ 2x ≤ −2    x  1
2
18. If f (x)   x , then domain of f  f is
(A) (0, ) (B) ( , 0) (C) ( , ) (D) {0}
Ans (D)
Since Df = (, 0] and Rf = [0, ), therefore, Df f  x  D f : f (x)  D f 
= {x  0 : f(x)  0}
= {x  0 : f(x) = 0}  f (x)  0 
= {0}.
1   1 
19. If f (x)  1  , then f f   =
x   x 
1 1 x 1
(A) (B) (C) (D)
x 1 x x 1 x 1
Ans (C)
1 1
f    1  1 x
x 1
 
x
  1  1 1  x  1 x x
f  f     f (1  x)  1    
  x  1 x 1 x 1 x x 1
20. If f(x) = (ax2 + b)3, x  0, then f1 (x) =
1 1
b  x3 x3  b 1 1
(A) (B) (C) (D)  ax 2  b  3
a a  ax 2  b 3

42
 2PBCBDM-Relations, Functions & Binary Operations(S)

Ans (B)
Since Df = [0, ), f is one-one.
( f(x1) = f(x2)  ax12  b  ax 22  b  x12  x 22  |x1| = |x2|  x1 = x2)
 f1(x) exists and if y = f(x) then x = f1(y).
1 1
Here, y = (ax2 + b)3  y 3  ax 2  b  ax 2  y 3  b
1 1 1
y3  b y3  b x3  b
x  f 1 (y)  or f 1 (x) 
a a a

21. The function f (x)  sin log  x  x 2  1  is 
(A) an even function (B) an odd function
(C) neither even nor odd (D) a periodic function.
Ans (B)
Here, Df = R.
 x 2
 x 2  1 | x |  x 2  1   x 2  1  x  x 2  1  x  x 2  1  0for all x  R 

Also, f (  x)  sin log   x  x 2  1  
   x 2  1  x  x 2  1  x   
 sin log  

  x2  1  x  
  1 
 sin log  
  x  1  x 
2


 sin  log  x 2  1  x 
=  f(x) for all x  R.
 f is an odd function.
x2
22. If the function f : R  A, given by f (x)  is surjective, then A =
x2  1
(A) [0, 1) (B) (0, 1] (C) R (D) [0, 1]
Ans (A)
Here, A = Range of f. Note that Df = R.
x2 1
Now f (x)  2  1 2  1 for all x  R
x 1 x 1
 Rf = [0, 1)
Alternatively, for yRf, let y = f(x)
x2
y 2  x2y + y = x2
x 1
y y
 x2  ; but x2  0, therefore,  0, y  1
1 y 1 y
y 1  y 
2

 0,y1
1 y
 y(1  y)  0, y  1  y(y  1)  0, y  1
 0  y < 1.

43
2PBCBDM-Relations, Functions & Binary Operations(S)

1
23. The domain of the function f (x)  log is
| sin x |
(A) R  {2n, n  I} (B) R  {n, n  I} (C) R  { , } (D) ( , )
Ans (B)
1
f (x)  log  sin x  0
| sin x |
 x  n. Domain of f(x) = R  {n, n  I}.
24. Domain and Range are equal for the
(A) Constant function (B) One-one function (C) Identity function (D) Onto function
Ans (C)
Standard result
1
25. The domain of the function f (x)  is
(x  6)(x  9)
(A) ( , 6]  (9, ) (B) ( , 6]  [9, ) (C) ( , 6)  [9, ) (D) ( , 6)  (9, )
Ans (D)
1
We have, f (x) 
(x  6)(x  9)
f(x) is well defined for (x  6) (x  9) > 0
Now, (x  6) (x  9) > 0 for x < 6 or x > 9
 domain of f(x) is ( , 6)  (9, ).
26. Let A be a set containing n distinct elements. Then number of commutative binary operations that can be
defined on A is
n(n 1)
2
(A) n n (B) n 2
(C) (n2)n (D) n
Ans (B)
Standard result
27. Let a binary operation ‘’ be defined on the set N of natural numbers by the rule
a  b = a + 2b , a, b  N, then
(A) ‘’ is commutative (B) ‘’ is associative
(C) N is not closed with respect to ‘’ (D) Identity element under ‘’ does not exist.
Ans (D)
(i) a  b = a + 2b  b + 2a = b  a.
(ii) (a  b)  c = (a + 2b)  c = a + 2b + 2c
whereas
a  (b  c) = a  (b + 2c) = a + 2(b + 2c) = a + 2b + 4c.
(iii) a + 2b  N for all a, b  N, therefore, a  b  N.
(iv) If ‘e’ is the identity element, then a  e = a  a + 2e = a  e = 0,
but then e  a = 0  a = 0 + 2a = 2a  a  e in general.
So, identity element does not exist.
28. In Z, the set of all integers, inverse of  7, w.r.t. ‘’ defined by a  b = a + b + 7, for all a, b  Z, is
(A)  14 (B) 7 (C) 14 (D)  7

44
 2PBCBDM-Relations, Functions & Binary Operations(S)

Ans (D)
–7 is the identity element
 a  a–1 = e  – 7  a–1 = – 7
 –7 + a–1 + 7 = – 7  a–1 = – 7
ab
29. If the binary operation * is defined on the set Q+ of all positive rational numbers by a * b  . Then
4
1 1
3*  *  is equal to
5 2
3 5 3 3
(A) (B) (C) (D)
160 160 10 20
Ans (A)
1 1 1
   3*
 1 1  1 40  3
3*  *   3*  5 2   3* 
5 2  4  40 4 160
  x x  
30. Let the binary operation on the set S     : x  , x  0  be defined as matrix multiplication.
  x x  
Then the identity element is
 1 1
 2 2  2 2   1 1  1 1 
(A)   (B)   (C)   (D)  
 1 1   2 2   1 1   1 1
 
 2 2 
Ans (A)
 x  x   e e   x  x  1
Consider       2xe  x  e 
  x x   e e    x x  2
 e e   x  x   x  x  1
Also,     e
 e e    x x    x x  2
 1 1
  
 Identity element is  2 2

 1 1 
 
 2 2 

***

45