Class 12 - Maths - Relations and Functions
Class 12 - Maths - Relations and Functions
Maths
Chapter 1 - Relations and Functions
Exercise 1.1
Since 1, 1 R .
In the given relation R there is not any ordered pair such that x, y and y, z
both R , therefore we can say that x, z cannot belong to R .
Hence, the given relation R is reflexive and transitive but it does not belong to
symmetric.
Ans: The given relation is: R = { x, y : x and y work at the same place }
Now, x, y R , then x and y work at the same place, which means y and x
also work at the same place. Therefore, y, x R .
Therefore, x, z R .
Since, x, x R .
Since x, y R , x and y live in the same locality. Therefore, y and x also live
in the same locality, so, y, x R .
Hence, R is symmetric.
Let x, y R and y, z R . Hence x and y live in the same locality and y and
z also live in the same locality. Which means that x and z also live in the same
locality.
Therefore, x, z R .
Since, x, x R .
d) R = { x, y : x is wife of y}
Since, x, x R
e) R = { x, y : x is father of y}
Since, x, x R
1 1 1 1
Since , R . [Since is not less than ]
2 4 2 4
Since, a, a R,a A .
Therefore, the given relation R is neither reflexive, nor symmetric, nor transitive.
Since, a, a R .
Therefore, R is reflexive.
Hence, R is transitive.
Therefore, the given relation R is reflexive and transitive but not symmetric.
1 1 1 1
Since , R . [Since is not less than ]
2 8 2 8
Therefore, the given relation R is neither reflexive, nor symmetric, nor transitive.
Since 1, 1 , 2, 2 , 3, 3 R
Therefore R is symmetric.
Therefore, the given relation R is symmetric but neither reflexive nor transitive.
7. Show that the relation R in the set A of all the books in a library of a
college, given by R = { x, y : x and y have same number of pages } is an
equivalence relation.
Ans: The given relation is: R = { x, y : x and y have the same number of pages }
Therefore, R is reflexive.
Therefore R is symmetric.
Hence, R is transitive.
Ans: Let a A ,
Therefore, R is reflexive.
Let a, b R ,
Therefore, b, a R
Therefore R is symmetric.
Let a, b R and b, c R ,
a-c is even.
a, c R
Therefore, R is transitive.
All the elements of set 1, 3, 5 are all odd. Hence, the modulus of the difference
of any two elements will be an even number. So, all the elements of this set are
related to each other.
Therefore, the absolute value of the difference between the two elements (from
each of these two subsets) will not be an even value.
i. R = { a, b : a – b is a multiple of 4}
Let a A ,
a, a R as a-a =0 is a multiple of 4 .
Therefore, R is reflexive.
b, a R
Therefore R is symmetric.
a, b , b, c R .
a-b is a multiple of 4 and b-c is a multiple of 4 .
a, c R
Therefore, R is transitive.
1-1 0 is a multiple of 4 ..
5-1 0 is a multiple of 4 ..
9-1 0 is a multiple of 4 .
ii. R = a, b : a = b
a A, a, a R , since a = a .
Therefore, R is reflexive.
Let a, b R a=b .
b=a b, a R
Therefore R is symmetric.
a, b , b, c R
a=b and b=c
a=c
a, c R
Therefore, R is transitive.
So, the relation R is not reflexive because for aR , a, a R since a cannot be
strictly less than itself.
Let
Let a, b , b, c R .
Therefore, R is transitive.
Since a, b R .
Therefore R is reflexive.
Let .
a 3 b3 and b3 c3
a 3 c3
Therefore R is transitive.
Ans: Let us take a relation R= -5, -6 , -6, -5 , -5, -5 in set A= -5, -6 .
Therefore R is symmetric.
Therefore R is transitive.
11. Show that the relation R in the set A of points in a plane given by
R = { P, Q : Distance of the point P from the origin is same as the
distance of the point Q from the origin}, is an equivalence relation.
Further, show that the set of all point related to a point P 0, 0 is the
circle passing through P with origin as centre.
Since, P, P R .
Therefore R is symmetric.
Let P, Q , Q, S R .
Distance of P from the origin is the same as the distance of Q from the origin
and distance of Q from the origin is the same as the distance of S from the origin.
So, distance of S from the origin will be same as the distance of P from the
origin. So, P, S R .
Therefore R is transitive.
The set of points related to P 0, 0 will be those points whose distance from
origin is same as distance of P from the origin and will form a circle with the
centre as origin and this circle passes through P .
12. Show that the relation R defined in the set A of all triangles as
R = { T1 , T2 : T1 is similar to T2 } , is equivalence relation. Consider
three right angle triangles T1 with sides 3, 4, 5 and T2 with sides
5, 12, 13 and T3 with sides 6, 8, 10 . Which triangles among T1 , T2 and
T3 are related?
If T1 , T2 R , then T1 is similar to T2 .
T2 is similar to T1 .
Therefore R is symmetric.
Let T1, T2 , T2 , T3 R .
T1 is similar to T3 .
T1, T3 R
Therefore R is transitive.
3 4 5 1
= = =
6 8 10 2
Since, the corresponding sides of triangles T1 and T3 are in the same ratio,
therefore triangle T1 is similar to triangle T3 .
Hence, T1 is related to T3 .
13. Show that the relation R defined in the set A of all polygons as
R = { P1 , P2 : P1 and P2 have same number of sides } , is an equivalence
relation. What is the set of all elements in A related to the right angle
triangle T with sides 3, 4 and 5 ?
Let P1 , P2 R .
P2 , P1 R
Therefore R is symmetric.
Let P1, P2 , P2 , P3 R .
P1, P3 R
Therefore R is transitive.
14. Let L be the set of all lines in XY plane and R be the relation in L
defined as R = { L1 , L 2 : L1 is parallel to L 2 } . Show that R is an
equivalence relation. Find the set of all lines related to the line y=2x+4 .
Let L1 , L2 R .
L2 , L1 R
Therefore R is symmetric.
L1 is parallel to L 2
L 2 is parallel to L3
L1 is parallel to L3
L1 , L3 R
Therefore R is transitive.
Set of all lines related to line y=2x+4 is set of all lines that are parallel to the line
y=2x+4 .
Slope of line y=2x+4 is m = 2 . Therefore, lines parallel to the given line is of the
form y=2x+c , where c R .
Therefore R is transitive.
(B) 3, 8 R
(C) 6, 8 R
(D) 8, 7 R
Considering 2, 4 R .
Considering 3, 8 R .
Since 3 8 - 2 , so 3, 8 R .
Considering 6, 8 R .
1
1. Show that the function f: R * R * defined by f x = is one-one and
x
onto, where R * is the set of all non-zero real numbers. Is the result true, if
the domain R * is replaced by N with co-domain being same as R * ?
1
Ans: The function f: R * R * is defined by f x = .
x
For f to be one – one:
x, y R * such that f x = f y
1 1
=
x y
x=y
For f to be onto:
1
For y R * there exists x = R * [as y 0 ] such that
y
1
f x= =y
1
y
Therefore, the given function f is onto.
1
Consider a function g: N R * defined by g x =
x
1 1
We have, g x1 =g x 2 = x1 =x 2
x1 x 2
The function g is not onto as for 1.2 =R * there does not exit any x in N such
1
that g x = .
1.2
i. f: N N given by f x =x 2
For x, y N ,
f x = f y
x 2 = y2
x=y
ii. f: Z Z given by f x =x 2
Since,
f -1 = f 1
Since -2 Z , but, there does not exist any element x Z such that
f x = -2
iii. f: R R given by f x =x 2
Now,
f -1 = f 1
=1
But -1 1 .
Since -2R , but, there does not exist any element x R such that
f x = -2 .
iv. f: N N given by f x =x 3
f x = f y
x 3 = y3
x=y
v. f: Z Z given by f x =x 3
For x, y Z ,
f x = f y
x 3 = y3
x=y
Now,
f 1.2 = 1.2
=1
f 1.9 = 1.9
=1
Therefore, f 1.2 = f 1.9 , but 1.2 1.9 .
Hence, the greatest integer function is neither one – one nor onto.
Ans: f: R R is f x = x
x; x>0
-x; x<0
Now,
=1
f 1 = 1
=1
Therefore, f 1 = f -1 , but -1 1 .
1 if x>0
5. Show that the Signum Function f: R R , given by f x = 0, if x=0 is
-1 if x<0
neither one-one nor onto.
1 if x>0
Ans: The function f: R R is given by f x = 0, if x=0
-1 if x<0
Now,
f 1 = f 2
=1
But 1 2
Since,
f 1 = 4
f 2 = 5
f 3 = 6
7. In each of the following cases, state whether the function is one – one, onto
or bijective.
i. f: R R defined by f x = 3 - 4x .
-4x1 = -4x 2
x1 = x 2
3-y
For any real number y in R , there exists in R such that
4
3-y 3-y
f =3-4
4 4
=y
ii. f: R R defined by f x = 1 + x 2
1+x12 =1+x 22
x12 =x 22
x1 =±x 2
Hence function f is not one – one because f x1 = f x 2 does not mean that
x1 =x 2 .
b1 =b 2 and a1 = a 2
b1, a1 = b2 , a 2
For b, a B×A ,
n+1
2 , if n is odd
9. Let f: N N be defined by f n = for all n N . State
n
, if n is even
2
whether the function f is bijective. Justify your answer.
Now,
1+1
f(1)=
2
=1
2
f(2)=
2
=1
Here, f 1 = f 2 , but 1 2 .
Taking n N ;
Case I: n is odd
4r+1+1
f 4r + 1 =
2
=2r+1
Case II: n is even
4r
f 4r =
2
= 2r .
10. Let A=R-3 and B = R - 1 . Consider the function f:A B defined
x-2
by f x = . Is f one-one and onto? Justify your answer.
x-3
x-2
Ans: The function f:A B is defined by f x = , where A=R-3 and
x-3
B = R - 1.
x-2 y-2
=
x-3 y-3
(x–2)(y–3) = (y–2)(x–3)
xy–3x–2y + 6 = xy–2x–3y + 6
–3x–2y = –2x–3y
x=y
If y B = R-1 , then y 1 .
x-2
=y
x-3
x–2 = xy–3y
x(1–y) = –3y + 2
2-3y
for any y B , there exists A such that,
1-y
2-3y
2-3y 1-y
-2
f =
1-y 2-3y -3
1-y
2-3y-2+2y
=
2-3y-3+3y
-y
=
-1
=y
x 4 =y 4
Hence, The correct answer is ( D ) function f is neither one – one nor onto.
3x = 3y
x=y
y
For y R , there exists in R such that;
3
y y
f =3
3 3
=y
Exercise 1.3
f = 1, 2 , 3, 5 , 4, 1
Now,
= g 2 [as f 1 =2 ]
3 [as g 2 = 3 ]
= g 5 [as f 3 = 5 ]
=1 [as g 5 = 1 ]
= g 1 [as f 4 = 1 ]
=3 [as g 1 = 3 ]
f + g oh = foh + goh
f.g oh = foh . goh
Ans: To prove: f + g oh = foh + goh .
Simplifying LHS:
LHS = f + g oh x
= f + g h x
= foh x + goh x
= RHS
Hence proved.
Simplifying LHS:
LHS = f . g oh x
= f . g h x
= foh x . goh x
= f.g oh x
=RHS
Hence proved.
Calculating gof :
go f x = g f x
= g |x|
= 5 x -2
Calculating fog :
fog x = f g x
= f |5x-2|
= 5x-2
= 5x-2
1
ii. The functions are x =8x and x =x
3 3
1
Ans: The given functions are f x =8x and g x =x
3 3
Calculating gof :
go f x = g f x
= g 8x 3
1
= 8x
3 3
fog x = f g x
3
13
= f x
3
1
= 8 x 3
= 8x
4. If x =
4x+3 ,x 2 , 2
show that fof x = x , for all x . What is the
6x-4 3 3
inverse of f ?
(4x+3) 2
Ans: The given function is f x = ,x .
(6x-4) 3
So,
fof x =f f x
(4x+3)
=f
(6x-4)
4x+3
4 +3
= 6x-4
4x+3
6 -4
6x-4
16x+12+18x-12
=
24x+18-24x+16
fof = I x
Therefore, the given function f is invertible and the inverse of the function f is
the function f itself.
f 1 = f 2 = f 3 = f 4 = 10
All distinct elements of the set 2, 3, 4, 5 have distinct images under h .
Since for every element y of the set 7, 9, 11, 13 there is an element x in the set
2, 3, 4, 5 such that h x = y , therefore the function h is onto.
(Hint: For y Range f, y= x = X+2 , for some x in [-1, 1], i.e., x = 2y(1-y) )
f x = f y
xy +2x = xy +2y
2x = 2y
x=y
Therefore, the function f: -1, 1 Range f is one – one and onto and therefore,
the inverse of the function f: -1, 1 Range f exists.
x
y=
(x+2)
xy+2y=x
x(1-y)=2y
2y
x- ,y 1
1-y
2y
g(y)= ,y 1.
1-y
So,
x
=g
x+2
x
2 x+2
=2
1- x
x+2
2x
=
x+2-x
2x
=
2
=x
And
(fog)(y)=f(g(y))
2y
=f
1-y
2y
1-y
=2
2y
1-y
2y
=
2y+2-2y
2y
=
2
=y
2y
Therefore, f -1 (y)= ,y 1.
1-y
f x = f y
4x +3 = 4y +3
4x = 4y
x=y
y R , let y = 4x + 3 .
y-3
x= R
4
y-3
For any y R , there exists x= R , such that
4
y-3
f x =f
4
y-3
=4 +3
4
=y
Now,
y-3
Defining g: R R by g x =
4
gof x =g f x
= g 4x + 3
(4x + 3)-3
=
4
4x
=
4
=x
and
fog y = f g y
y-3
=f
4
y-3
= 4 +3
4
=y-3+3
=y
f x = f y
x 2 + 4 = y2 + 4
x 2 = y2
x = y [as x = y R + ]
x 2 = y - 4 0 as y 4
x= Y - 4 0
f x = f Y-4
2
= Y - 4 +4
=y-4+4
=y
So,
gof x = g f x
= x +4 -4
2
= x2
=x
fog y = f g y
=f Y-4
2
= Y-4 +4
=y-4+4
=y
y = 3x + 1 -1-5= 3x + 1 -6
2 2
y + 6 = 3x + 1
2
( y+6)-1
x =
3
( y+6)-1
Defining g: -5, R+ as g(y) =
3
gof x = g f x
= g 9x 2 + 6x-5
= g 3x + 1 -6
2
= (3x+1) 2 -6+6-1
3x+1-1 3x
= =
3 3
=x
fog y = f g y
( y 6) 1
3
( y 6) 1 2
3 1 6
3
Class XII Maths www.vedantu.com 46
=( y+6)2 -6
=y+6-6
=y
Therefore,
gof = x = IR
fog = y = IRange f
( y+6)-1
f -1 y =g(y)= .
3
For all y Y ,
fog1 y = IY y
= fog 2 y
f g1 y = f g2 y
We have
fog a = f g a
= f 1
=a
fog b = f g b
= f 2
=b
fog c = f g c
= f 3
=c
And,
=1
gof 2 = g f 2
= f b
gof 3 = g f 3
= f c
=3
=1
goh 2 = g h 2
= g b
=2
=3
And
hog a = h g a
= h 1
hog b = h g b
= h 2
=b
hog c = h g c
= h 3
=c
So, h = f .
Hence, f -1 = f .
-1
So, f -1 =g .
1
3
(A) x
(B) x3
(C) x
(D) 3 - x 3
1
Ans: The function f: R R is defined as f x = 3-x
3 3
fof x =f(f(x))
1
3 3
=f(3-x )
1
3 3
=[3-(3-x )]
1
3 3
=(x )
Therefore, fof x = x .
4 4x
14. Let f: R- - R be a function as f x = . The inverse of f is
3 3x+4
4
map g: Range f R- - given by
3
3y
(A) g y = .
3-4y
4y
(C) g y = .
4-3y
3y
(D) g y = .
4-3y
4 4x
Ans: The function f: R- - R is dined as a function f x = .
3 3x+4
4
There exists x R- - such that y = f x
3
4x
y=
3x+4
3xy+4y=4x
x(4-3y)=4y
4y
x=
4-3y
4 4y
Defining g: Range f R- - as g y = .
3 4-3y
Calculating gof(x) :
4x
4
4x 3x+4
=
3x+4 4-3 4x
3x+4
16x
=
12x+16-12x
Class XII Maths www.vedantu.com 52
16x
=
16
=x
Therefore, gof(x)= g(f(x)) = g .
Calculating fo y :
fo(y)=f(g(y))
4y
=f( )
4-3y
4y
4
4-3y
=
4y
3 +4
4-3y
16y
=
12y+16-12x
16y
=
16
=y
4 4y
The inverse of f is the map g: Range f R- - which is given by g y =
3 4-3y
4y
So, the correct answer is (B) g y = .
4-3y
In the event that * is not a binary operation, give justification for this.
i. On Z+ , define * by a * b = a-b .
Ans: On Z+ , * is defined by a * b = ab .
Ans: On Z+ , * is defined by a * b = a - b .
v. On Z+ , define * by a * b = a .
Ans: On Z+ , * is defined by a * b = a .
i. On Z, define a * b = a-b
Ans: On Z , * is defined by a .
For 1, 2 Z ,
1*2=1-2
= -1
2*1=2-1
=1
Therefore 1 * 2 2 * 1 .
For 1, 2, 3 Z ,
1*2*3= 1-2*3
1* 1
1 1
2
Therefore, 1 * 2 * 3 1 * 2 * 3 .
For all a, b Q , ab = ba .
ab + 1 = ba + 1 for all a, b Q
a * b = a * b for all a, b Q
For 1, 2, 3 Q ,
1 * 2 * 3 = 1 × 2 + 1 * 3
=3*3
=3×3+1
= 10
1 * 2 * 3 = 1 * 2 × 3 + 1
Therefore, 1 * 2 * 3 1 * 2 * 3 .
ab
iii. On Q , define a * b = .
2
ab
Ans: On Q , * is defined by a * b = .
2
For all a, b Q , ab = ba .
ab ba
=
2 2 for all a, b Q
a * b = b * a for all a, b Q
For 1, 2, 3 Q ,
ab
(a*b)*c= *c
2
ab
c
=
2
2
abc
=
4
And
bc
a
=
2
2
abc
=
4
Therefore, a*b *c = a* b*c .
For all a, b Z+ , ab = ba .
a * b = b * a for all a, b Z+
For 1, 2, 3 Z+ ,
(1*2)*3=21×2 *3
=4*3
=24×3
=212
1*(2*3) = 1*22×3
= 1*26
= 21×64
= 264
Therefore, 1 * 2 * 3 1 * 2 *3 .
b
v. On Z+ , define a * b = a .
Ans: On Z+ , * is defined by a * b = a b .
For 1, 2 Z+ ,
1*2 = 12
=1
2*1=21
=2
Therefore, 1 * 2 2 * 1 .
For 2, 3, 4 Z+
(2*3)*4 = 23*4
=8*4
=84
= 212
2*(3*4)=2*34
=2*81
a
vi. On R – {-1} define a*b = .
b+1
a
Ans: On R - -1 , * is defined by a*b = .
b+1
For 2, 3 R-{-1}.
2
2*3 =
3+1
1
=
2
3
3*2 =
2+1
=1
Therefore, 2 * 3 3*2 .
For 2, 3, 4 R-{-1}
2
(2*3)*4= *4
3+1
1
= *4
2
1
= 2
4+1
3
2*(3*4) = 2*
4+1
3
=2*
5
2
=
3
+1
5
2
=
8
5
5
=
4
Therefore, 2 * 3 * 4 2 * 3 * 4 .
So, the operation * is not associative.
* 1 2 3 4 5
1 1 1 1 1 1
2 1 2 2 2 2
3 1 2 3 3 3
4 1 2 3 4 4
5 1 2 3 4 5
i. Compute 2 * 3 * 4 and 2 * 3 * 4 .
Ans: Calculating 2 * 3 * 4 :
2 * 3 * 4 = 1 * 4
=1
Calculating 2 * 3 * 4 :
2 * 3 * 4 = 2 * 1
=1
ii. Is * commutative?
Ans: Calculating 2 * 3 * 4 * 5 :
Since,
2 * 3 * 4 * 5 = 1 * 1
=1
*' 1 2 3 4 5
1 1 1 1 1 1
2 1 2 2 2 2
3 1 2 3 3 3
4 1 2 3 4 4
5 1 2 3 4 5
As we can see, the operation tables for the operations * and *' are the same.
Therefore, operation *' is same as the operation * .
i. Calculate 5 * 7 and 20 * 16 .
Ans: Calculating 5 * 7 :
ii. Is * commutative?
So, a * b = b * a .
iii. Is * associative?
Ans: For a, b, c N ,
So, a * b * c = a * b * c .
Now,
Ans: For a, b N , the elements in N are invertible with respect to the operation
* only for the condition a * b = e = b * a .
e =1
L.C.M of a and b =1= L.C.M of b and a for all a, b N .
* 1 2 3 4 5
1 1 2 3 4 5
2 2 2 6 4 10
3 3 6 3 12 15
4 4 4 12 4 20
5 5 10 15 20 5
3 * 2 = 2 * 3 = 6A
5 * 2 = 2 * 5 = 10 A
3 * 4 = 4 * 3 = 12 A
4 * 5 = 5 * 4 = 20 A
Therefore, a * b = b * a .
So, a * b * c = a * b * c .
1 1 1 1
* = -
2 3 2 3
3-2
=
3
1
=
6
And;
1 1 1 1
* = -
3 2 3 2
2-3
=
6
-1
=
6
1 1 1 1
Therefore, * * .
2 3 3 2
1 1 1
For , , Q ,
2 3 4
1 1 1 1 1 1
* * = - *
2 3 4 2 3 4
1 1
= *
6 4
1 1
= -
6 4
1 1 1 1 1 1
* * = * -
2 3 4 2 3 4
1 4-3
= *
2 12
1 1
= *
2 12
1 1
= -
2 12
5
=
12
1 1 1 1 1 1
Therefore, * * * * .
2 3 4 2 3 4
ii. a * b = a2 + b2
For a,b Q ,
a*b=a 2 +b2
=b 2 +a 2
=b*a
For 1,2,3Q ,
1 * 2 * 3 = 12 + 22 * 3 = 1 * 4 + 9
= 1 + 4 * 3
=5*3
= 52 + 32
= 34
And;
1 * 2 * 3 = 1 * 22 + 32
= 1 * 4 + 9
= 1 * 13
= 12 + 132
=170
Therefore, 1 * 2 * 3 1 * 2 * 3 .
iii. a * b = a + ab
For 1,2 Q ,
1*2=1+1×2
=1+2
For 1,2,3Q ,
1 * 2 * 3 = 1+ 1×2 * 3
= 1 + 2 * 3
=3*3
= 3 + 3×3
=3+9
= 12
And,
1 * 2 * 3 = 1 * 2 + 2×3
= 1 * 2 + 6
=1*8
= 1 + 1×8
=9
Therefore, 1 * 2 * 3 1 * 2 * 3 .
For a,b Q ,
a * b = a - b
2
b * a = b - a
2
= - a - b
2
= a - b
2
a*b=b*a
Therefore, the binary operation * is commutative.
For 1,2,3Q ,
1 * 2 * 3 = 1 – 2
2
*3
= – 1 * 3
2
=1*3
= 1 – 3
2
= – 2
2
=4
And,
1 * 2 * 3 = 1 * 2 – 3
2
=1* – 1
2
=1 * 1
Class XII Maths www.vedantu.com 71
=0
Therefore, 1 * 2 * 3 1 * 2 * 3 .
ab
v. a * b =
4
ab
Ans: The binary operation * is defined as a * b = on set Q .
4
For a,b Q ,
ab
a*b=
4
ba
=
4
=b*a
Therefore, a * b = b * a .
For a,b,c Q ,
ab
(a*b)*c = *c
4
ab
.c
= 4
4
abc
=
16
And,
bc
a
= 4
4
abc
=
16
Therefore, a * b * c = a * b * c
vi. a * b = ab2
1 1
For , Q ,
2 3
2
1 1 1 1
* = .
2 3 2 3
1 1
= .
2 9
1
=
18
And,
2
1 1 1 1
* = .
3 2 3 2
1 1
= .
3 4
1 1 1
For , , Q ,
2 3 4
1 1 1 1 1 1
2
* * = . *
2 3 4 2 3 4
1 1
= *
18 4
2
1 1
=
18 4
1
=
18 16
1
=
288
And;
1 1 1 1 1 1
2
* * = *
2 3 4 2 3 4
1 1
= *
2 48
2
1 1
=
2 48
1
=
4608
1 1 1 1 1 1
Therefore, * * * * .
2 3 4 2 3 4
Ans: For the binary operation * , e Q will be the identity element only if
a * e = a = e * a , for all a Q .
As we can see, there is no such element e Q for the operations given above
satisfying the condition a * e = a = e * a .
a, b * c, d = a + c, b + d
c, d * a, b = c + a, d + b = a + c, b + d
Therefore, a, b * c, d = c, d * a, b .
Let a, b , c, d , e, f A and a, b, c, d, e, f N
= a + c + e, b + d + f
And,
12. State whether the following statements are true or false. Justify.
Taking b = a = 3 ,
3*3=3+3=6 3
Therefore the given statement is false.
Simplifying R.H.S :
R.H.S= c * b * a
= b * c * a [as * is commutative]
= a * b * c [as * is commutative]
=L.H.S
Therefore, a * b * c = c * b * a .
For a,b N ,
a*b=a 3 + b3
=b3 + a 3
=b*a
For 1,2,3 N ,
1 * 2 * 3= 13 +23 * 3
= 1+8*3
=9*3
=93 +33
= 756
And,
1* 2 * 3 = 1 * 23 +33
=1*8 + 27
=1*35
=13 +353
=1+42875
=42876
Therefore, 1 * 2 * 3 1 * 2 * 3 .
Therefore, the correct answer is option (B) the binary operation * is commutative,
but not associative.
Exercise 1.5
f x = f y , where x, y R .
10x + 7 = 10y + 7
x=y
y-7
x= R
10
y-7
So, for any y R , there exists x = R such that:
10
x = f
y-7
10
y-7
= 10 + 7
10
=y- 7+7
=y
y-7
Defining g: R R as y = .
10
Calculating gof :
= g 10x+7
=
10x+7 -7
10
10x
=
10
=x
Calculating fog :
fo y =f g y
y-7
=f
10
y-7
=10 +7
10
=y-7+7
=y
n-1 if n is odd
Ans: The function f: W W is defined as f n =
n+1 if n is even
f n = f m
Similarly, the possibility that of n is even and m is odd can also be ignored.
f n = f m
n - 1 = m - 1
n=m
f n = f m
n + 1 = m + 1
n=m
Now, for any odd number 2r + 1 N is the image of 2r N and any even number
2r N is the image of 2r + 1 N .
m+1 if m is even
Defining g: W W as m =
m-1 if m is odd
When n is odd:
go n = g f n
=n-1+1
=n
When n is even
go n = g f n
= g n + 1
=n+1-1
=n
When m is odd
fo m = f g m
= f m - 1
=m-1+1
=m
When m is even
fo m = f g m
= f m + 1
=m+1-1
=m
Therefore, gof = I W and fog = I W .
Calculating f f x :
f f x = f x 2 - 3x + 2
= x 2 - 3x + 2 - 3 x 2 - 3x+2 +2
2
x
Ans: The function f: R {x R:-1 < x < 1} is defined as f x = ,x R .
1+|x|
f x = f y , where x, y R .
x y
=
1+|x| 1+|y|
x y
=
1+x 1+y
2xy=x-y
Therefore, 2xy x - y .
Hence, x being positive and y being negative is not possible. Similarly x being
negative and y being positive can also be ruled out.
f(x)=f(y)
x y
=
1+x 1+y
x+xy=y+xy
x=y
f(x)=f(y)
x y
=
1+x 1+y
x+xy=y+xy
x=y
For onto:
y
If y is negative, then, there exists x = R such that
1+y
y
1+y
=
-y
1+
1+y
y
=
1+y-y
=y
y
If y is positive, then, there exists x = R such that
1-y
y
y 1-y
f =
1-y 1+ y
1-y
y
1-y
=
-y
1+
1-y
y
=
1-y+y
=y
f x = f y where x, y R .
x 3 =y3 …… (1)
x 3 y3
-1 = -1 = 1
1 = 1= 1
go x = g f x
= gx
= x
x = y
x-1, if x>1
(Hint: Consider f x = x+1 and x = )
1, if x>1
x-1, if x>1
And the function g: N N by g x =
1, if x>1
Since this element is not an image of any of the elements in domain N , therefore
g is not onto.
= g x + 1
=x+1-1 [ as x N x + 1 > 1 ]
=x
So, for y N , there exists x = y N such that gof x = y .
Ans: We know that every set is a subset of itself, ARA for all A P X
Therefore R is reflexive.
Let ARB A B .
A B and B C
AC
ARC
A X = A = X A for all A P X
A * X = A = X * A for all A P X
Or
A B=X=B A
This is only possible when A = X = B.
10. Find the number of all onto functions from the set {1, 2, 3, ... , n} to itself.
Ans: The total number of onto maps from {1, 2, 3, ... , n} to itself will be same
as the total number of permutations on n symbols 1, 2, 3, ... , n .
11. Let S = a, b, c and T = 1, 2, 3 . Find F-1 of the following functions F
from S to T , if it exists.
F a = 3, F b = 2, F c = 1
Hence, the function F is not invertible so its inverse does not exist.
And,
For 1,2,3 R ,
= 1-3
=2
And,
=1*1
= 1-1
=0
Therefore, 1o 2 2o1
For a,b, c R ,
a o b oc =a ob=a
Operation o is associative.
For a,b, c R ,
a * b oc =a * b= a-b
=1o1
=1
1o2 *1o3 =1*1
= 1-1
=0
For A P(X) ,
=A Φ
=A
Φ*A= Φ-A A-Φ
=Φ A
=A
Therefore, A*Φ=Φ*A for all A P(X) .
For A P(X) , if there exists B P(X) such that A*B=Φ=B*A , then element
A P(X) will be invertible.
=Φ-Φ
=Φ
a+b if a+b<6
The binary operation * on X is defined as a*b= .
a+b-6 if a+b 6
If a*e=a =e*a for all a X , then element e X is the identity element for the
operation * .
For a X , we have
a*0=a +0= a [ a X a 0 6 ]
0*a =0+a= a [ a X a 0 6 ]
a+b=0=b+a, if a+b<6
a*b=
a+b-6=0=b+a-6, if a+b 6
a= -b or b=6-a
=1+1
=2
And,
1
g -1 =2 -1 - -1
2
3
=2 -1
2
=3-1
=2
f -1 =g -1
f 0 = 0 - 0
2
=0
And,
1
g 0 =2 0 - -1
2
=1-1
=0
f 0 =g 0
=1-1
=0
And,
1
g 1 =2 1 - -1
2
1
=2 -1
2
=1-1
=0
f 1 =g 1
f 2 = 2 - 2
2
=4-2
=2
And,
1
g 2 =2 2 - -1
2
3
=2 -1
2
=3-1
=2
f 2 =g 2
(A) 1
(B) 2
(C) 3
(D) 4
The relation Relation R will become transitive on adding and two pairs
3, 2 , 2, 3 .
Therefore the total number of desired relations is one.
(A) 1
(B) 2
(C) 3
(D) 4
Class XII Maths www.vedantu.com 97
Ans: We are given a set A= 1, 2, 3 .
On order to add one pair, say 2, 3 , we must add 3, 2 for symmetry. And we
are required to add 1, 3 , 3, 1 for transitivity.
Therefore, the total number of equivalence relations containing 1, 2 are two.
1,x>0
18. Let f:R R be the Signum Function defined as x = 0,x=0 and
-1,x<0
g:R R be the Greatest Integer Function given by g x = x where
x is greatest integer less than or equal to x . Then does fog and gof
coincide in (1, 0] ?
1,x>0
Ans: It is given that, f:R R is defined as R x = 0,x=0 and g:R R is
-1,x<0
defined as g x = x where x is the greatest integer less than or equal to x .
Now,
= f x
1,if x=1
=
0,if x 0,1
= 1
=1
Therefore, when x(1,0], fog = 0 and gof = 1, so they do not coincede in (1.0].
(A) 10
(B) 16
(C) 20
(D) 8