II P U C MATHEMATICS April-May - 2022

a  b = a − b, a, b  Z + . Is  is a binary
RELATION AND FUNCTIONS operation on Z + ?
Solution: It is not a binary operation as
1-M+1-M+2-M+3-M+5-M+5-M=17Marks the image of (1, 2) under
 is 1 2 = 1 − 2 = −1 Z + .
ONE MARK QUESTIONS
Ex: An operation  on Z + (the set of all
Ex: A relation R on A = 1, 2, 3 defined by non-negative integers) is defined as
a  b = a − b , a, b  Z + . Is a binary operation
R = (1,1) , (1, 2 ) , ( 3, 3) is not symmetric. Why?
on Z + ?
Solution: R is not symmetric, as (1, 2 )  R
but ( 2,1)  R . Solution: There is a unique element
a − b in Z + . Therefore  is a binary
Ex: The relation R in the set {1, 2, 3} given operation on Z + .
by R = (1, 1) , ( 2, 2 ) , ( 3, 3) , (1, 2 ) , ( 2, 3 )
is not transitive. Why? Ex: Let  be a binary operation on the set
Solution: of natural numbers given by
R = (1, 1) , ( 2, 2 ) , ( 3, 3) , (1, 2 ) , ( 2, 3 ) a  b = L.C.M.of a and b , find 5  7 .
Solution: We have 5  7 = L.C.M.of 5and 7 = 35 .
R is not transitive:
(1, 2)  R and ( 2, 3)  R but (1,3)  R . Ex: Let  be the binary operation on N
given by a  b = LCM of a and b. Find 20  60 .
Ex: Define Bijective function. Solution:
Solution: A function which is both one- 20*16 = L.C.M . of 20 and 16 = 80  N .
one and onto is called Bijective function.
TWO MARK QUESTIONS
Ex: Define binary operation.
Solution: A binary operation  on a set A
is a function  : A  A → A . Ex: Show that the function f : N → N , given
by f ( x ) = 2 x , is one-one but not onto.
Ex: Let  be a binary operation defined
on the set of rational numbers Q defined Solution: Let x1 , x2  N ,
by a  b = ab + 1 , prove that  is a f ( x1 ) = f ( x2 )  2 x1 = 2 x2  x1 = x2 . Therefore f
commutative. is one one
Solution: Let a  b = ab + 1 = ba + 1 = b  a . Further, f is not onto, as for 1 N , there
Therefore  is commutative. does not exist any x in N such that
f ( x ) = 2 x = 1.
Ex: Let  be a operation defined on the set
ab
of rational numbers by a  b = , find the Ex: Show that if f : A → B and g : B → C are
4
one-one, then g f : A → C is also one-one.
identity element.
ae Solution: Suppose g f ( x1 ) = g f ( x 2 )
Solution: Let a  e = a  = a  e = 4 .
4 ( ) (
 g f ( x1 ) = g f ( x 2 ) )
 f ( x1 ) = f ( x 2 ) ,
as g is one-one
Ex: An operation  on Z + (the set of all
 x1 = x 2 , as f is one-one
non-negative integer) is defined as

Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 1

 II P U C MATHEMATICS April-May - 2022
Hence, g f is one-one.  bc 
a 
 
a  (b  c ) = a    =   =
bc 2 abc
Ex: Show that if f : A → B and g : B → C are  2  2 4

onto, then g f : A → C is also onto.   is associative.

Solution: If f : A → B is onto  f (A) = B and
g : B → C is onto  f (B) = C THREE MARK QUESTIONS

Consider g f ( A ) = g ( f ( A ) ) = g ( B ) = C
Ex: Find, gof and fog if f : R → R
Hence g f : A → C is onto.
and g : R → R are given by f ( x ) = cos x and

Ex: Find 𝑔𝑜𝑓and 𝑓𝑜𝑔, if g ( x ) = 3x 2 . Show that gof  fog .

Solution: we have
1
f ( x ) = 8 x3 and g ( x ) = x 3 .
gof ( x ) = g ( f ( x ) ) = g ( cos x ) = 3 ( cos x ) = 3 cos 2 x
2
Solution:
fog ( x ) = f ( g ( x ) ) = f ( 3x 2 ) = cos ( 3x 2 )
1

( gof )( x ) = g ( f ( x ) ) = g (8 x3 ) = (8 x3 ) 3 = 2 x
Note that 3 cos 2 x  cos ( 3 x 2 ) .
3
 1  1
and ( fog )( x ) = f ( g ( x ) ) = f  x 3  = 8  x 3  = 8x .
   
Hence, gof  fog .
Ex: If f : R → R and g : R → R are given by
Ex: Show that the relation R in the set Z
f ( x) = cos x and g ( x) = 3x 2 . Find
of integers given by R = {(a, b) : 2 divides a – b}
g f and f g .
is an equivalence relation.
Solution: We have Solution: R is reflexive, as 2 divides
gof ( x) = g ( f ( x) ) = g (cos x) = 3(cos x)2 = 3cos2 x (a – a) for all a  Z .
and Further, if (a, b)  R , then 2 divides
fog ( x) = f ( g ( x) ) = f (3x 2 ) = cos(3x 2 ) . a − b . Therefore, 2 divides b − a . Hence,
(b, a)  R , which shows that R is symmetric.
Ex: Define binary operation on a set. Similarly, if (a, b)  R and (b, c)  R , then a − b
Verify whether the operation  defined on and b − c are divisible by 2.
Q set of rational numbers by a  b = ab + 1 , Now, a – c = (a – b) + (b – c) is even (Why?).
 a, b  Q is binary or not. So, (a – c) is divisible by 2. This shows
Solution: A binary operation  on a set A that R is transitive. Thus, R is an
is a function  : A  A → A . equivalence relation in Z.
As  a, b  Q  ab + 1  Q . so  is binary.
Ex: Determine whether is the relation R in
the set A={1, 2, 3, 4, 5, …….13, 14}
Ex: Verify whether the operation  defined defined as R = ( x, y ) : 3x − y = 0 is reflexive,
ab
on 𝑄 by a  b = is associative or not. symmetric and transitive.
2
ab
Solution: y = 3x  R = (1,3) , ( 2,6 ) , ( 3,9 ) , ( 4,12 )
Solution: Given a  b = ,  a, b  Q , then for
2 Reflexive: As 1 R but (1,1)  R
all a, b, c  Q we have,  R is not reflexive.
 ab  Symmetric: As (1,3)  R but ( 3,1)  R
 2  c abc
( a  b )  c =    c =   =  R is not symmetric.
ab
and
 2  2 4

Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 2

 II P U C MATHEMATICS April-May - 2022
Transitive: As (1,3)  R and ( 3,9)  R but a, b  R
(1,9)  R R is not transitive. As a  a  a  R  ( a, a )  R is Reflexive.
As (1, 2 )  Rbut ( 2,1)  R  R is not
Ex: Prove that the relation R in the set of symmetric. 1  2 but 2 1
integers Z defined by
R = {( x, y) : x − y is an integer} is an As (1, 2 )  R , ( 2,3)  R  (1, 3)  R  R is
equivalence relation. transitive. 1  2 but 2  3  1  3 .
Solution: Let Z = ... − 1, −2, −3,0,1,2,3,.... and
R = {( x, y) : x − y is an integer} Ex: Check whether the relation R defined
Reflexive: As a − a = 0  ( a, a )  Ra  Z .
in the set 1,2,3,4,5,6 as R = ( a,b ) : b = a + 1 is
So R is reflexive.
reflexive or symmetric.
Symmetric: As ( a,b )  R  ( b,a )  R .
So R is symmetric. Solution: Let A = 1,2,3,4,5,6 and
Transitive: As
( a,b )  R and ( b,c )  R  ( a − c )  (a,c)  R . R = ( a,b ) : b = a + 1 i.e.,
So R is transitive. R = (1,2 ) , ( 2,3) , ( 3,4 ) , ( 4,5 ) , (5,6 ) .
Hence, R is equivalence relation.
Reflexive: Since (1,1)  R , so R is not
Ex: Show that the relation R in the set reflexive.
A = {1, 2,3, 4,5} given by B = {(a, b) : a – b is even}
is an equivalence relation. Symmetric: Since (1,2)  R but ( 2,1)  R , so
Solution: R is reflexive: R is not symmetric.
a − a = 0 is an even number
Ex: Show that the relation R defined in the
 ( a,a )  R, a A set A of all triangles as
R is symmetric: ( a,b )  R  a − b is even R = {(T1 , T2 ) : T1 is similar toT2 } , is equivalence
 − ( b − a ) is even relation.
 b − a is even Solution: Let A be the set of all triangles
in a plane. The relation is
 b−a R
R = {(T1 , T2 ) : T1 is similar toT2 }
R is transitive: ( a,b )  R and ( b,c )  R Reflexive: Every triangle is similar to
 a − b is even and b − c even itself, so R is reflexive.
 a − b is even and b − c is even Symmetric: If the triangle T1 is similar toT2 ,
 ( a − b ) + ( b − c ) is even then clearly T2 is similar toT1 . Therefore R is
 a − c is even symmetric.
Transitive: Let T1 is similar toT2 and
 a − c is even  ( a,c )  R
T2 is similar toT3 . Then the triangle
R is an equivalence relation.
T1 is similar toT3 . Therefore R is transitive.
Ex: Show that the relation R in R defined Hence R is an equivalence relation.
as R = ( a, b ) : a  b , is reflexive and
transitive but not symmetric.
Solution: Given R = ( a, b ) : a  b , where
FIVE MARK QUESTIONS

Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 3

 II P U C MATHEMATICS April-May - 2022
Is f one-one and onto? Justify your
Ex: Show that the function f : R → R answer.
defined by f ( x) = 3x is one-one onto. Justify  x−2
Solution: Let f ( x ) =  
your answer.  x −3
Solution: Let f ( x) = 3x Let x1 ,x2  A = R − 3 ,
f ( x1 ) = f ( x2 )
Let x1 ,x2  R, f ( x1 ) = f ( x2 )  3x1 = 3x2
x1 − 2 x2 − 2
 x1 = x2  f is one − one  =
x1 − 3 x2 − 3
Let any y  R and f ( x ) = y then  ( x1 − 2 )( x2 − 3) = ( x2 − 2 )( x1 − 3)
y  x1 x2 − 3x1 − 2 x2 + 6 = x1 x2 − 3x2 − 2 x1 + 6
f ( x ) = y  3x = y  x =  R
3
 x1 x2 − 3x1 − 2 x2 + 6 = x1 x2 − 3x2 − 2 x1 + 6
 Corresponding to each y  R
 y  3x2 − 2 x2 = 3x1 − 2 x1
(codomain), there exists    R
3  x1 = x2
(domain) such that. f is one-one
 y Let y  B and let f(x) = y
f   = y  f is onto.
3
x−2
 f is one-one onto.  =y
x −3
Hence f is a bijective function.  x − 2 = xy − 3 y  x − xy = 2 − 3 y
2 − 3y
 x (1 − y ) = 2 − 3 y  x = A
Ex: Check the injectivity and surjectivity 1− y

of the function f : R → R defined by  Corresponding to each y  B

2 − 3y 
f ( x) = 3 − 4 x . Is it a bijective function? there exists    A such that
 1− y 
Solution: Let f ( x ) = 3 − 4 x x  R  2 − 3y 
f = y
Let x1 , x2  R, f ( x1 ) = f ( x2 )  1− y 

 3 − 4 x1 = 3 − 4 x2  −4 x1 = −4 x2  f is onto.
 f is one-one and onto.
 x1 = x2
Hence f is a bijective function.
 f is one-one.
Let any y  R (codomain). Let f ( x ) = y
Ex: Prove that the function f : R → R
3− y
 3 − 4x = y  4x = 3 − y  x = defined by f ( x ) = 4 x + 3 is invertible. Find
4
 corresponding to every y  R there the inverse of f .
3− y Solution: Let us define g : R → R by
exists x =  R such that f ( x ) = y .
x− 3
g ( x) =
4
 f is onto. 4
Hence f is a bijective function. Now ( gof )( x ) = g  f ( x )  = g ( 4 x + 3)

Ex: Let A = R − 3 and B = R − 1 . Consider =

( 4 x + 3) − 3 = 4 x = x
 x−2 4 4
the function f : A → B defined f ( x ) =  .
 x −3

Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 4

 II P U C MATHEMATICS April-May - 2022
 y− 3 Since x  0 , we get, x2 + 4  4 . Thus y  4 .
2
And ( fog )( x ) = f  g ( x )  = f  
 4  Thus y  4,  ) .
 y− 3
= 4  +3 = y −3+3 = y Now y = x 2 + 4  x 2 = y − 4  x =  y − 4
 4 
Therefore, gof = fog = I R But x  R+ .Hence, y = y − 4 .
Hence, f is invertible and the inverse of f Define, g :  4,  ) → R+ , g ( y ) = y − 4
y− 3 Now
is given by f − 1 ( y ) = . OR
4 ( gof )( x ) = g ( f ( x ) ) = g ( x 2 + 4 ) = x2 + 4 − 4 = x
Proving f is both one one and onto
Hence f −1 ( x) exists Also, ( fog )( y ) = f ( g ( y ) ) = f ( y−4 )
x −3
( )
2
Finding f −1 ( x) = . = y−4 + 4 = y − 4 + 4 = y Hence, gof = I R+
4
and fog = I 4,  )
Ex: Prove that the function, f : N → Y  f is invertible with the inverse given by
defined by f ( x) = x ,where
2
f −1 = g  f −1 ( y ) = y − 4 . OR
Y = { y : y = x , x  N } is invertible. Also find
2
Proving f is both one one and onto
the inverse of f . Hence f −1 ( x) exists
Solution: An arbitrary element y  Y is of Finding f −1 ( x) = x − 4 .
2
the form x , for some x  N
This implies that x = y Example: Let f : N → R be defined by
This gives a function g : Y → N , defined by
f ( x ) = 4 x 2 + 12 x + 15 . Show that f : N → S ,
g ( y) = y
where, S is the range of function f , is
( )
Now gof ( x ) = g ( f ( x ) ) = g x = x = x and
2 2 invertible. Find the inverse of f .
Solution: Let y be an arbitrary element of
fog ( y ) = f ( g ( y ) ) = f ( y)=( y)
2
= y,  y  Y range f .
Then f ( x ) = 4 x 2 + 12 x + 15 , for some x  N ,
Which shows that gof = I N and fog = IY  y = ( 2 x ) + 2 ( 2 x ) 3 + 33 − 9 + 15 = ( 2 x + 3) + 6
2 2

Therefore f is invertible function. Since

y = ( 2 x + 3) + 6  ( 2 x + 3) = y − 6
2 2
gof = I N and fog = IY ,
 2x + 3 =  y − 6
−1
we get, f = g . Hence f − 1 ( x ) = x .
Since x  N ,  2 x = y − 6 − 3
y− 6 − 3
This gives x = as y  6
2
Ex: Let R+ be the set of all non-negative
y− 6 − 3
real numbers. Show that the function Let g : S → N , defined by g ( y ) =
f : R+ →  4,  ) defined by f ( x ) = x 2 + 4 is
2

invertible and write the inverse of f . (

Now gof ( x ) = g ( f ( x ) ) = g ( 2 x + 3) + 6
2
)
Solution: Let y = f ( x ) . Then y = x 2 + 4 . ( 2 x + 3)2 + 6 − 6 −3 2x + 3 − 3
= = =x
2 2

Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 5

 II P U C MATHEMATICS April-May - 2022
 y− 6 − 3
 
2
Also ( fog )( y ) = f ( g ( y ) ) = f   = y +6 −6 = y +6−6 = y .
 2
  Thus gof = R+ and fog = I −5,  )
2
  y − 6 − 3   Thus by definition, f is invertible function,
= 2   + 3 + 6
 y + 6 −1
  2   given by f − 1 ( y ) = .
    3
2 2
= y − 6 –3 + 3 + 6 = y −6 + 6 = y −6+6 = y @@@@@@
Hence gof = I N and fog = I S . By definition,
HOME WORK
y− 6 − 3
f is invertible with f −1
( y)= .
2 Ex: State whether the function f : R → R
defined by f ( x ) = 4 x + 3 is one-one, onto or
Ex: Consider f : R+ →  –5,  ) , given by
bijective. Justify your answer.
f ( x ) = 9 x 2 + 6 x –5 . Show that 𝑓is invertible
y + 6 −1 Ex: Show that the function f : R → R ,
with f −1 ( y ) = . 1
3 defined by f ( x) = is both one-one and
Solution: Let x  R+ and x
onto, where R is the set of all non-zero
9 x 2 + 6 x − 5 = y, y   −5,  )
real numbers.
Then
f ( x ) = ( 3x ) + 2 ( 3x )1 + 12 − 1 − 5 = ( 3x + 1) − 6
2 2
Ex: Check the injectivity and surjectivity
of the function f : R → R , given by
Now y = ( 3x + 1) − 6 . If x  0 , then ( 3x + 1)  1
2 2
f ( x) = 1 + x 2 . Is it a bijective function?
Hence ( 3x + 1) − 6  − 5  y  − 5
2

Thus ( 3x + 1) = y + 6  3x + 1 = y + 6
2

Since x  R+ , ( 3x + 1)  R+
Thus 3x + 1= y + 6  3x = y + 6 –1
y + 6 −1
x =
3
Let g :  −5,  ) → R+ , be defined by
y + 6 −1
g ( y) =
3
Now gof ( x ) = g ( f ( x ) ) = g (( 3x + 1) − 6)
2

( 3x +1)2 − 6 + 6 −1
3 x +1 − 1
= = =x.
3 3
 y + 6 − 1
Also ( fog )( y ) = f ( g ( y ) ) = f  
 3
 
2
  y + 6 − 1  
 
2
= 3    + 1 − 6 = y + 6 –1+1 − 6

  3  

Bhadrasetty-9901782340, sujm pu collge, Harapanahalli – 583131. Page 6