CHAPTER – 1: RELATIONS AND FUNCTIONS

MARKS WEIGHTAGE – 06 marks

NCERT Important Questions & Answers

1. Determine whether each of the following relations are reflexive, symmetric and transitive : (iv)
Relation R in the set Z of all integers defined as R = {(x, y): x − y is an integer }
Ans:
For reflexive put y = x, x − x = 0 which is an integer for all x  Z. So, R is reflexive on Z.
For symmetry let (x,y)  R, then (x − y) is an integer λ and also y − x = −λ [ λ  Z  −λ  Z]
 y − x is an integer  (y, x)  R. So, R is symmetric.
For transitivity let (x,y)  R and (y, z)  R  x − y = integer and y − z = integers, then x − z is also
an integer
 (x, z)  R. So, R is transitive.

2. 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
For symmetry, we observe that − 1 ≤ 32 but 3 > (−1)2
 (−1, 3)  R but (3, −1) R.
So, R is not symmetric.
For transitivity, we observe that2 ≤ (−3 )2 and −3 ≤ (1)2 but 2 > (1)2
 (2, − 3)  R and (−3,1)  R but (2, 1) R. So, R is not transitive.
Hence, R is neither reflexive, nor symmetric and nor transitive.

3. Show that the relation R in R defined as R = {a, b) : a ≤ b}, is reflexive and transitive but not
symmetric.
Ans:
We have R = {(a,b) : a ≤ b}. Let a,b  R.
Reflexive: for any a  R we have a ≤ a. So, R is reflexive.
Symmetric: we observe that (2, 3)  R but (3, 2) R. So, R is not symmetric.
Transitivity: (a,b)  R and (b, c)  R  a ≤ b and b ≤ c  a ≤ c  (a,c)  R
So, R is transitive. Hence, R is reflexive and transitive but not symmetric.

4. Check whether the relation R in R defined by R = {(a, b): a ≤ b3} is reflexive, symmetric or
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.

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

 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.

5. 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
⇒(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.
6. 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

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

 ∴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.
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

7. In each of the following cases, state whether the functions is one-one, onto or bijective. Justify
answer.
(i) f : R→ R defined by f (x) = 3 − 4x
(ii) f : R→ R defined by f (x) =1 + x2
Ans:
(i) Here, f :R → R is defined by f(x) = 3 − 4x
Let x1, x2 ∈R such that f(x1) = f(x2)
⇒ 3 – 4 x1 = 3 – 4x2
⇒– 4 x1 = – 4x2
⇒ x1 = x2
Therefore, f is one-one.
3 y  3 y   3 y 
For any real number y in R, there exists in R such that f    3  4  y
4  4   4 
Therefore, f is onto. Hence, f is bijective.

(ii) Here f :R → R is defined as f(x) = 1 + x2

Let x1, x2 ∈R such that f(x1) = f(x2)
⇒ 1 + x12 = 1 + x22
⇒ x12 = x22
⇒ x1 =  x2
For instance, f(1) = f(− 1) = 2
Therefore, f(x1) = f(x2) does not imply that x1 = x2
Therefore, f is not one-one.
Consider an element − 2 in co-domain R.
It is seen that f(x) = 1 + x2 is positive for all x ∈R.
Thus, there does not exist any x in domain R such that f(x) = − 2.
Therefore, f is not onto. Hence, f is neither one-one nor onto.

 x2
8. Let A = R − {3} and B = R − {1} . Consider the function f : A→ B defined by f(x) =   is f
 x 3 
one-one and onto ? Justify your answer.
Ans:
 x2
Here, A = R − { 3), B = R − {1} and f : A→ B is defined as f(x) =  
 x 3 
Let x, y ∈A such that f(x) = f(y)

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

 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
 3 x  2 y  3 y  2 x
 3x  2 x  3 y  2 y  x  y

Therefore, f is one- one. Let y ∈B = R −{1} . Then, y ≠ 1

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 )  3 y  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  3 y   1  y  2  3y  2  2 y  y
f    y
 1  y   2  3 y   3 2  3 y  3  3 y 1
 1 y 
 
Therefore, f is onto. Hence, function f is one-one and onto.

4x  3 2 2
9. If f ( x )  , x  , show that (fof)(x) = x, for all x  . What is the inverse of f?
6x  4 3 3
Ans:
4x  3 2
Given that f ( x )  ,x 
6x  4 3
 4x  3 
Then ( fof )( x)  f ( f ( x ))  f  
 6x  4 
 4x  3 
4 3
 6 x  4  16 x  12  18 x  12 34 x
   x
 4x  3  24 x  18  24 x  16 34
6 4
 6x  4 
2
Therefore (fof)(x) = x, for all x 
3
Hence, the given function f is invertible and the inverse of f is itself.
x
10. Show that f :[−1,1]→ R, given by f ( x )  , x  2 , is one-one. Find the inverse of the
x2
function f :[−1,1]→ Range f .
Ans:
x
Given that f :[−1,1]→ 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 2y
Let y   x  xy  2 y  x 
x2 1 y
So, for every y except 1 in the range there exists x in the domain such that f(x) = y. Hence, function f
is onto.
Therefore, f :[−1,1] → Range f is one-one and onto and therefore, the inverse of the function f
:[−1,1]→ Range f exists.
Let y be an arbitrary element of range f.
Since, f :[−1,1]→ Range f is onto, we have y = f(x) for some x  [1,1]
x 2y
y  x  xy  2 y  x  , y 1
x2 1 y
2y
Now, let us define g: Range f→[−1,1] as g ( y )  , y 1
1 y
 x 
2
 x   x  2  2x 2x
( gof )( x)  g ( f ( x))  g      x
 x  2  1  x  x  2  x 2
 x2
 
 2y 
 1 y 
 2y     2y 2y
and ( fog )( y )  f ( g ( y ))  f    y
 1 y   2 y   2 2 y  2  2 y 2
 1 y 
 
–1
Therefore, gof = fog = IR, Therefore, f = g
2y
Therefore, f 1 ( y )  , y 1
1 y

11. Consider f : R→ R given by f (x) = 4x + 3. Show that f is invertible. Find the inverse of f .
Ans:
Here, f :R→R is given by f(x) = 4x + 3
Let x,y  R, such that f(x) = f(y)
 4x + 3 = 4y + 3
 4x = 4y  x = y
Therefore, f is a one-one function.
Let y = 4x + 3
 y 3
 There exist, x     R, y  R
 4 
 y 3
Therefore, for any y  R , there exist x     R such that
 4 
 y 3  y 3
f ( x)  f    4 3 y
 4   4 
Therefore, f is onto function.
Thus, f is one-one and onto and therefore, f−1 exists.
x3
Let us define g : R → R by g ( x) 
4
(4 x  3)  3
Now, ( gof )( x)  g ( f ( x ))  g (4 x  3)  x
4
 y 3  y 3
and ( fog )( y )  f ( g ( y ))  f    4 3 y
 4   4 
Therefore, gof = fog = IR

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

 y 3
Hence, f is invertible and the inverse of f is given by f 1 ( y )  g ( y ) 
4

12. Consider f : R+ →[4, ∞) given by f (x) = x2 + 4. Show that f is invertible with the inverse f −1 of
given by f −1y = y  4 , where R+ is the set of all non-negative real numbers.
Ans: Here, function f : R+ →[4,∞] is given as f(x) = x2 + 4
Let x,y  R+ , such that f(x) = f(y)
 x2 + 4 = y2 + 4  x2 = y2
 x = y [as x = y  R+ ]
Therefore, f is a one-one function.
For y  [4,∞), let y = x2 + 4
 x2 = y − 4≥ 0 [as y ≥ 4]
 x = y4 ≥ 0
Therefore, for any y  R+ , There exists x = y  4  R+ such that
f(x) = f( y  4 ) = ( y  4 )2 + 4 = y − 4 + 4 = y
Therefore, f is onto. Thus, f is one-one and onto and therefore, f −1 exists.
Let us define g : [4,∞)→R+ by g(y) = y  4
Now, gof(x) = g(f(x)) = g(x2 + 4) = ( x 2  4)  4  x 2  x
2
and fog(y) = f(g(y)) = f( y  4 ) =  y4   4  ( y  4)  4  y
Therefore, gof  I R and fog  I[4, )
Hence, f is invertible and the inverse of f if given by f 1 ( y )  g ( y )  y 4

13. Consider f : R+ → [−5, ∞) given by f (x) = 9x2 + 6x − 5. Show that f is invertible with
 y  6 1 
f 1 ( y )    .
 3
 
Ans:
Here, function f : R+ →[−5,∞) is given as f(x) = 9x2 + 6x − 5.
Let y be any arbitrary element of [−5,∞).
Let y = 9x2 + 6x − 5
 y = (3x + 1)2 − 1 − 5 = (3x + 1)2 − 6
 (3x + 1)2 = y + 6
 (3x + 1)2 = y  6 [as y ≥ − 5  y + 6 ≥ 0]
y  6 1
 x
3
Therefore, f is onto, thereby range f = [−5,∞).
y  6 1
Let us define g : [−5,∞)→ R+ as g ( y ) 
3
Now, (gof)(x) = g(f(x)) = g(9x2 + 6x − 5) = g((3x + 1)2 − 6)
(3 x  1)2  6  6  1 3 x  1  1
  x
3 3
2
 y  6  1    y  6 1  
and (fog)(y) = f(g(y))  f    3    1  6
 3  3
     
2
  y6  6  y66  y
Therefore, gof  I R and fog  I [ 5, )

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

 y  6 1
Hence, f is invertible and the inverse of f if given by f 1 ( y )  g ( y ) 
3
14. Let * be the binary operation on N given by a* b = LCM of a and b.
(i) Find 5*7 , 20*16 (ii) Is * commutative?
(iii) Is * associative? (iv) Find the identity of * in N
(v) Which elements of N are invertible for the operation *?
Ans:
The binary operation on N is defined as a*b = LCM of a and b.
(i) We have 5 *7 = LCM of 5 and 7 = 35 and 20*16 = LCM of 20 and 16 = 80

(ii) It is known that LCM of a and b = LCM of b and a for a, b  N.

Therefore, a*b = b*a. Thus, the operation * is commutative.

(iii) For a, b, c  N, we have

(a*b) *c = (LCM of a and b) *c = LCM of a, b, and c
a* (b*c) = a * (LCM of b and c) = LCM of a, b, and c
Therefore, (a*b) *c = a* (b*c). Thus, the operation is associative.

(iv) It is known that LCM of a and 1 = a = LCM of 1 and a, a  N.

a*1 = a = 1*a, a  N
Thus, 1 is the identity of * in N.

(v) An element a in N is invertible with respect to the operation *, if there exists an element b in N
such that a*b = e = b*a.
Here, e = 1. This means that
LCM of a and b = 1 = LCM of b and a
This case is possible only when a and b are equal to 1.
Thus, 1 is the only invertible element of N with respect to the operation *.

15. Let * be the binary operation on N defined by a*b =HCF of a and b. Is * commutative? Is *
associative? Does there exist identity for this binary operation on N?
Ans:
The binary operation * on N is defined as a*b = HCF of a and b.
It is known that HCF of a and b = HCF of b and a for a,b  N.
Therefore, a*b = b*a. Thus, the operation is commutative.
For a,b,c  N , we have (a*b)*c = (HCF of a and b)*c = HCF of a,b and c
a*(b*c) = a*(HCF of b and c) = HCF of a,b, and c
Therefore, (a*b)*c = a*(b*c)
Thus, the operation * is associative.
Now, an element e  N will be the identity for the operation if a*e = a = e*a,  a  N.
But this relation is not true for any a  N.
Thus, the operation * does not have identity in N.

16. Let * be a binary operation on the set Q of rational number as follows :

(i) a*b = a − b (ii) a*b = a2 + b2 (iii) a*b = a + ab
ab
(iv) a*b = (a − b)2 (v) a*b = (vi) a*b = ab2
4
Find which of the binary operation are commutative and which are associative?
Ans:
(i) On Q, the operation * is defined as a*b = a − b.
It can be observed that for 2,3,4  Q, we have 2*3 = 2 − 3 = −1 and 3*2 = 3 − 2 = 1
 2*3 ≠ 3*2
Thus, the operation is not commutative.

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

 It can also be observed that
(2*3)*4 = (−1)*4 = −1 − 4 = − 5
and 2*(3*4) = 2*(−1) = 2 − (−1) = 3
2*(3*4) ≠ 2* (3*4)
Thus, the operation * is not associative.

(ii) On Q, the operation * is defined as a*b = a2 + b2.

For a,b  Q, we have
a*b = a2 + b2 = b2 + a2 = b*a
Therefore, a*b = b*a
Thus, the operation * is commutative.
It can be observed that
(1* 2)* 3 = (12 + 22) * 3 (1 + 4) * 4 = 5 * 4 = 52 + 42 = 41
and 1*(2* 3) = 1* (22 + 32) = 1 * (4 + 9) = 1*13 = 12 + 132 = 170
 (1*2)* 3 ≠ 1*(2*3) where 1,2, 3  Q
Thus, the operation * is not associative.

(iii) On Q, the operation is defined as a*b = a + ab

It can be observed that
1*2 = 1 + 1 × 2 = 1 + 2 = 3, 2*1 = 2 + 2 × 1 = 2 + 2 = 4
 1*2 ≠ 2*1 where 1, 2  Q
Thus, the operation * is not commutative.
It can also be observed that
(1*2)*3 = (1 + 1 × 2)*3 = 3*3 = 3 + 3 × 3 = 3 + 9 = 12
and 1*(2* 3) = 1*(2 + 2 × 3) = 1*8 = 1 + 1 × 8 = 9
 (1*2)* 3 ≠ 1*(2*3) where 1,2, 3  Q
Thus, the operation * is not associative.

(iv) On Q, the operation * is defined by a*b = (a − b)2.

For a,b  Q, we have a*b = (a − b)2 and b*a = (b − a)2 = [−(a − b)]2 = (a − b)2
Therefore, a*b = b*a
Thus, the operation * is commutative. It can be observed that
(1* 2) * 3 = (1 – 2)2 * 3 = ( 1) * 3 = (1 – 3)2 = 4
and 1 * (2 *3) = 1 * (2 – 3)2 = 1 * (1) = (1 – 1)2 = 0
 (1*2)* 3 ≠ 1*(2* 3) where 1,2, 3  Q
Thus, the operation * is not associative.

ab
(v) On Q, the operation * is defined as a*b =
4
ab ba
For a,b  Q, we have a * b = = =b*a
4 4
Therefore, a*b = b*a
Thus, the operation * is commutative.
ab bc
ab .c abc bc a. abc
For a,b,c  Q, we have a*(b*c )= *c  4  and a*(b*c) = a *  4 
4 4 16 4 4 16
Therefore, (a*b)*c = a*(b*c). Thus, the operation * is associative.

(vi) On Q, the operation is defined as a*b = ab2

It can be observed that for 23  Q
2 * 3 = 2 x 32 = 18 and 3*2 = 3 x 22 = 12
Hence, 2*3 ≠ 3*2
Thus, the operation is not commutative.

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

 It can also be observed that for 1,2,3  Q
(1*2)*3 = (1. 22 )*3 = 4 *3 = 4.32 = 36
and 1*(2* 3) = 1*(2. 32) = 1 *18 =1.182 = 324
 (1*2)*3 ≠ 1*(2*3)
Thus, the operation * is not associative.
Hence, the operations defined in parts (ii), (iv), (v) are commutative and the operation defined in part
(v) is associative.

17. Show that none of the operation given in the above question has identity.
Ans:
An element e  Q will be the identity element for the operation if
a*e = a = e*a, a  Q
(i) a*b = a − b
If a*e = a,a ≠ 0  a −e = a, a ≠ 0  e = 0
Also, e*a = a  e − a = a  e = 2a
 e = 0 = 2a,a ≠ 0
But the identiry is unique. Hence this operation has no identity.

(ii) a*b = a2 + b2
If a*e = a, then a2 + e2 = a
For a = −2, (−2)2 + e2 = 4 + e2 ≠ −2
Hence, there is no identity element.

(iii) a*b = a + ab
If a*e = a  a + ae = a  ae = 0  e = 0,a ≠ 0
a
Also if e*a = a  e + ea = a  e  ,a 1
1 a
a
e  0  ,a  0
1 a
But the identity is unique. Hence this operation has no identify.

(iv) a*b = (a − b)2

If a*e = a, then (a − e)2 = a. A square is always positive, so for
a = −2,(−2 − e)2 ≠ − 2
Hence, there is no identity element.

(v) a*b = ab /4
If a*e = a, then ae /4 = a. Hence, e = 4 is the identity element.
 a*4 =4 *a =4a/4 = a

(vi) a*b = ab2

If a*e =a then ae2 = a  e2 = 1  e = ± 1
But identity is unique. Hence this operation has no identity.
Therefore only part (v) has an identity element.

x
18. Show that the function f :R→ {x  R : −1 < 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 : −1 < x <1} defined by f( x) = ,xR
1 | x |

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

 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 −1 < 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  1 y   y  1 y  y
1  
1 y  1 y 
y
If y is positive, then there exists x   R such that
1 y
 y  y
 
 y   1 y  1 y y
f ( x)  f     y
1 y  1 y  y  1 y  y
1  
1 y  1 y 
Therefore, f is onto. Hence, f is one-one and onto.

19. 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.

 a  b, ifa  b  6
20. Define a binary operation * on the set {0, 1, 2, 3, 4, 5} as a * b   . Show
a  b  6, ifa  b  6
that zero is the identity for this operation and each element a ≠ 0 of the set is invertible with (6
−a) being the inverse of a.
Ans:
Let X = {0,1,2, 3,4, 5}
 a  b, ifa  b  6
The operation * on X is defined as a * b  
a  b  6, ifa  b  6

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

 An element e  X is the identity element for the operation *, if
a*e = a = e*a  a  X
For a  X, we observed that
a*0 = a + 0 = a [ a  X  a + 0 < 6]
0*a = 0 + a = a [ a  X  0 + a < 6]
 a*0 = a = 0*a  a  X

Thus, 0 is the identity element for the given operation *.

An element a  X is invertible, if there exists b  X such that a*b = 0 = b*a
 a  b  0  b  a, ifa  b  6
i.e. 
a  b  6  0  b  a  6, ifa  b  6
i.e., a = −b or b = 6 − a
But X = {0,1,2, 3,4,5} and a, b  X
Then, a ≠ −b
Therefore, b = 6 − a is the inverse of a, a  X.
Hence, the inverse of an element a  X, a ≠ 0 is (6 − a) i.e., a–1 = 6 – a.

21. 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:
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.

22. Show that if f : A → B and g : B → C are one-one, then gof : A → C is also one-one.
Ans:
Suppose gof (x1) = gof (x2)
 g (f (x1)) = g(f (x2))
 f (x1) = f (x2), as g is one-one
 x1 = x2, as f is one-one
Hence, gof is one-one.

23. Determine which of the following binary operations on the set N are associative and which are
ab
commutative. (a) a * b = 1 a, b  N (b) a * b = a, b  N
2
Ans:
(a) Clearly, by definition a * b = b * a = 1 a, b  N .
Also (a * b) * c = (1 * c) =1 and a * (b * c) = a * (1) = 1, a, b, c  N .
Hence R is both associative and commutative.
ab ba
(b) a * b    b * a , shows that * is commutative. Further,
2 2
 ab 
   c a  b  2c
 a b   2 
( a * b) * c   *c  
 2  2 4

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

 bc
a  
bc   2  2a  b  c a  b  2c
But a * (b * c )  a *     in general.
 2  2 4 4
Hence, * is not associative.
7  3 3x  4 3 7 
24. Show that if f : R     R    is defined by f ( x )  and g : R     R    is
5 5 5x  7 5 5
7x  4 3 7 
defined by g ( x )  , then fog = IA and gof = IB, where, A  R    , B  R    ; IA(x) = x,
5x  3 5 5
 x  A, IB(x) = x,  x  B are called identity functions on sets A and B, respectively.
Ans:
 3x  4 
7 4
 3x  4   5 x  7  21x  28  20 x  28 41x
We have gof ( x)  g      x
 5 x  7  5  3x  4   3 15 x  20  15 x  21 41
 5x  7 
 

 7x  4 
3 4
 7x  4   5 x  3  21x  12  20 x  12 41x
Similarly, fog ( x )  f      x
 5 x  3  5  7 x  4   7 35 x  20  35  21 41
 5x  3 
 
Thus, gof (x) = x,  x  B and fog (x) = x,  x  A, which implies that gof = IB and fog = IA.

25. Let f : N →R be a function defined as f (x) = 4x2 + 12x + 15. Show that f : N→ S, where, S is the
range of f, is invertible. Find the inverse of f.
Ans:
Let y be an arbitrary element of range f. Then y = 4x2 + 12x + 15, for some x in N, which implies that
y 6 3
y = (2x + 3)2 + 6. This gives x  , as y ≥ 6.
2
y 6 3
Let us define g : S → N by g ( y ) 
2

Now gof (x) = g(f (x)) = g(4x2 + 12x + 15) = g ((2x + 3)2 + 6)
(2 x  3)2  6  6  3 (2 x  3  3)
  x
2 2
2
 y  6  3    y  6  3   
and fog ( y )  f      2    3   6 
 2    2  
      
2 2
  
y 6 33  6   y6  6 y66  y
Hence, gof = IN and fog =IS. This implies that f is invertible with f –1 = g.

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