Jab Saara India Vedantu Pe Online Padhega: Scholarship Admission Test

PDF download
JAB SAARA INDIA

VEDANTU PE ONLINE PADHEGA
Scholarship Admission Test

 WIN an assured Scholarship upto 100%
 Take the Online Test from the comfort of your home Register NOW
 It’s Absolutely FREE Limited Seats!
 For Class 6-12 CBSE | ICSE | JEE | NEET
W W W.V E D A N T U . C O M
BEST RESULTS
FROM ONLINE CLASSES
548 268 1 OUT OF 3

27
STUDENTS
46
STUDENTS
RANKS RANKS STUDENTS WHO CLEARED SCORED SCORED
ACROSS IN TOP JEE MAINS SECURED A ABOVE ABOVE
RANK IN JEE ADVANCED
INDIA 10K 600 550
Mumbai se Panchkula se Gurugram se Patiala se Maharashtra se Surat se

Dhruv Rambhia Madhav Goel Tanmay Gangwar Shaurya Bhatia Anjaney Pandey Tanishi Bhatt
AIR 43 AIR 208 AIR 227 682/720 670/720 670/720
JEE Adv. NEET
157 Students 171 Students

Scored above 90% in 12th Scored above 90% in 10th
Jharkhand se Dubai se
Akshat Kumar Navya Ratnan
98.20% 98.00%
12TH Boards 10TH Boards
Rajahmundry se Dahod se
Reshma M Ummehani N
99.4% 97.92%
State Boards
Scholarship Admission Test

WIN an assured Scholarship upto 100%

Register NOW
 Take the Online Test from the comfort of your home
 It’s Absolutely FREE Limited Seats!
 For Class 6-12 CBSE | ICSE | JEE | NEET
NCERT Solutions for Class 12
Maths
Chapter 1 - Relations and Functions
Exercise 1.1
1. Determine whether each of the following relations are reflexive,

symmetric and transitive.
i. Relation R in the set A = 1, 2, 3...13, 14 defined as

R =  x, y  : 3x - y = 0
Ans: The given relation is: R = 1, 3 ,  2, 6 , 3, 9  ,  4, 12 
Since 1, 1 ,  2, 2 ... and 14, 14  R .
We conclude that R is not reflexive.
Since 1, 3  R , but  3, 1  R . [since 3 3 -1  0 ]
We conclude that R does not belong to symmetric.
Since 1, 3 and  3, 9   R , but 1, 9  R. 31 -9  0 .
We conclude that R is not transitive.
Therefore, the relation R is not reflexive, symmetric or transitive.
ii. Relation R in the set N of natural numbers defined as

R = {  x, y  : y = x + 5 and x<4}
Ans: The given relation is: R = 1, 6 ,  2, 7  ,  3, 8 .
Since 1, 1  R .
We conclude that R is not reflexive.
Class XII Maths www.vedantu.com 1

Since 1, 6   R but  6, 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 .
Therefore R is not transitive.
Hence, the given relation R is not reflexive, symmetric or transitive.
iii. Relation R in the set A = {1, 2, 3, 4, 5, 6} as R= {  x, y  : y is divisible by

x}
Ans: The given relation is R = { x, y  : y is divisible by x}
As we know that any number except 0 is divisible by itself, therefore  x, x   R
We conclude that R is reflexive.
Since  2, 4   R [because 4 is divisible by 2 ], but  4, 2   R [since 2 is not

divisible by 4 ].
Assuming that  x, y  and  y, z   R , y is divisible by x and z is divisible by y

Hence z is divisible by x   x, z   R .
We conclude that R is transitive.
Hence, the given relation R is reflexive and transitive but it does not belong to
symmetric.
iv. Relation R in the set Z of all integers defined as R = {  x, y  : x - y} is as

integer
Ans: The given relation is R = { x, y : x - y is an integer }

If x  Z,  x, x   R because x-x = 0 is an integer.
Hence, we conclude that R is reflexive.
For x, y  Z , if  x, y   R , then x - y is an integer and therefore  y-x  is also an

integer.
Therefore, we conclude that  y, x   R and hence R is symmetric.
Assuming that  x, y  and  y, z   R , where x, y, z  Z .
We can say that  x-y  and  y-z  are integers.
Therefore x-z = (x-y) + (y-z) is also an integer, so,  x, z   R
Hence, we conclude that R is transitive.
Therefore the given relation R is reflexive, symmetric, and transitive.
v. Relation R in the set A of human beings in a town at a particular time

given by
a) The relation is: R = {  x, y  : x and y work at the same place }
Ans: The given relation is: R = { x, y : x and y work at the same place }
This implies that  x, y   R .
Hence, we conclude that R is reflexive.
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 .
Hence, we conclude that R is symmetric.
Let us assume that  x, y  ,  y, z   R .

Then, we can say that x and y work at the same place and y and z work at the
same place. Which means that x and z also work at the same place.
Therefore,  x, z   R .
Therefore, the given relation R is reflexive, symmetric and transitive.
b) The relation is: R = {  x, y  : x and y live in the same locality }
Ans: The given relation is R = { x, y : x and y live in the same locality }
Since,  x, x   R .
Therefore, we conclude that R is reflexive.
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 .
Therefore, the given relation R is reflexive, symmetric and transitive.
c) R = {  x, y  : x is exactly 7 cm taller than y}
Ans: The given relation is: R = { x, y : x is exactly 7 cm taller than y}
Since,  x, x   R .

Therefore, we conclude that R not is reflexive.
Let  x, y   R , Since x is exactly 7 cm taller than y , therefore y is obviously

not taller than x , so,  y, x   R .
Hence, R is not symmetric.
Assuming that  x, y  ,  y, z   R , we can say that x is exactly 7 cm taller than

y and y is exactly 7 cm taller than z . Which means that x is exactly 14 cm
taller than z . So,  x, z   R .
Hence, R is not transitive.
Therefore, the given relation R is not reflexive, symmetric or transitive.
d) R = {  x, y  : x is wife of y}
Ans: The given relation is: R = { x, y : x is the wife of y} .
Since,  x, x   R
Let  x, y   R , Since x is the wife of y , therefore y is obviously not the wife

of x , so,  y, x   R .
Assuming that  x, y  ,  y, z   R , we can say that x is the wife of y and y is the

wife of z , which is not possible. So,  x, z   R .
Therefore the given relation R is not reflexive, symmetric or transitive.
e) R = {  x, y  : x is father of y}

Ans: The given relation is: R = { x, y : x is the father of y}
Since,  x, x   R
Let  x, y   R , Since x is the father of y , therefore y is obviously not the father

of x , so,  y, x   R .
Assuming that  x, y  ,  y, z   R , we can say that x is the father of y and y is

the father of z , then x is not the father of z . So,  x, z   R .
Therefore the given relation R is not reflexive, symmetric or transitive.
2. Show that the relation R in the set R of real numbers, defined

R =  a, b  : a  b 2  is neither reflexive nor symmetric nor transitive.
Ans: The given relation is: R =  a, b : a  b 

2
1 1 1 1
Since  ,   R . [Since is not less than ]
2 4 2 4
Therefore, R is not reflexive.
Since 1, 4   R as 1<42 , but  4, 1  R as 42 is not less than 12 .
Therefore R is not symmetric.
 3, 2 ,  2, 1.5  R , so, 3<22 =4 and 2< 1.5 =2.25 but

2
Assuming that
3> 1.5 =2.25 .
2

Therefore, the given relation R is neither reflexive, nor symmetric, nor transitive.

3. Check whether the relation R defined in the set 1, 2, 3, 4, 5, 6 as
R =  a, b  : b=a+1 is reflexive, symmetric or transitive.
Ans: The given relation is R =  a, b : b=a+1 defined in the set

A=1, 2, 3, 4, 5, 6 .
So, R=1, 2 ,  2, 3 , 3, 4  ,  4, 5 , 5, 6 
Since,  a, a   R,a  A .
1, 1 ,  2, 2 , 3, 3 ,  4, 4 , 5, 5 ,  6, 6   R

Therefore, R is not reflexive
Since, 1, 2   R , but  2, 1  R .
Since 1, 2  ,  2, 3  R , but 1, 3  R .
4. Show that the relation R in R defined as R =  a, b  : a  b is reflexive

and transitive but not symmetric.
Ans: The given relation is R =  a, b : a  b .
Since,  a, a  R .
Therefore, R is reflexive.
Since,  2, 4  R (as 2<4 ), but  4, 2  R (as 4>2 ).

Assuming that  a, b  ,  b, c  R , a  b and b  c , therefore, a  c .
Hence, R is transitive.
Therefore, the given relation R is reflexive and transitive but not symmetric.
5. Check whether the relation R in R defined as R =  a, b  : a  b 3  is

reflexive, symmetric or transitive.
Ans: The given relation is: R =  a, b : a  b 

3
1 1 1 1
Since  ,   R . [Since is not less than ]
2 8 2 8
Since 1, 4   R as 1<43 , but  4, 1  R as 4 is not less than 13 .

3 3 3
 3 3 6 3 3 6 6
Assuming that  3,  ,  ,   R , so, 3<   and <   but 3>   .
 2 2 5 2 2 5 5
6. Show that the relation R in the set 1, 2, 3 given by R =  1, 2  ,  2, 1

is symmetric but neither reflexive nor transitive.
Ans: The given relation is R = 1, 2 ,  2, 1 on the set A= 1, 2, 3 .
Since 1, 1 ,  2, 2  ,  3, 3  R

Since, 1, 2  R and  2, 1 R .
Therefore R is symmetric.
Since, 1, 2  R and  2, 1 R , but 1, 1  R .
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 }
Since  x, x   R as x and x have same number of pages.
Let  x, y  R , so x and y have the same number of pages, therefore y and x

will also have the same number of pages.
Assuming  x, y  R and  y, z  R . x and y have the same number of pages and

y and z also have the same number of pages. Therefore, x and z will also have
the same number of pages. So,  x, z  R .
Hence, R is transitive.
Therefore, the given relation R is an equivalence relation.
8. 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: Let a  A ,
So, a-a = 0 (which is an even number).
Let  a, b   R ,
Now, a-b is even,
Hence a-b and b-a are both even
Therefore,  b, a   R
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
 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.

All elements of 2, 4 are even while all the element of 1, 3, 5 are odd so no
element of 1, 3, 5 can be related to any element of 2, 4 .
Therefore, the absolute value of the difference between the two elements (from
each of these two subsets) will not be an even value.
9. Show that each of the relation R in the set A = {x  Z: 0  x  12} , is an

equivalence relation. Find the set of all elements related to 1 in each case.
i. R = {  a, b  : a – b is a multiple of 4}
Ans: The given set
A = {x  Z: 0  x  12} = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12
The given relation is: 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 .
Let,  a, b   R  a-b is a multiple of 4 .
 -  a-b  = b-a is a multiple of 4 .
  b, a   R
 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-c  =  a-b  +  b-c  is a multiple of 4 .

 a-c is a multiple of 4 .
  a, c   R
The set of elements related to 1 is 1, 5, 9 as
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
Ans: The given relation is: R =  a, b  : a = b .
a A,  a, a  R , since a = a .
Let  a, b   R  a=b .
 b=a   b, a  R
 a, b  ,  b, c  R
 a=b and b=c
 a=c
  a, c  R

The set of elements related to 1 is 1 .
10. Given an example of a relation. Which is
i. Symmetric but neither reflexive nor transitive.
Ans: Let us assume the relation R=  5, 6 ,  6, 5 in set A= 5, 6, 7 .
So, the relation R is not reflexive as  5, 5 ,  6, 6  ,  7, 7   R .
The relation R is symmetric as  5, 6  R and  6, 5 R .
The relation R is not transitive as  5, 6  ,  6, 5 R , but  5, 5  R .
Therefore, the given relation R is symmetric but not reflexive or transitive.
ii. Transitive but neither reflexive nor symmetric.
Ans: Let us assume the relation R =  a, b  : a < b
So, the relation R is not reflexive because for aR ,  a, a   R since a cannot be
strictly less than itself.
Let
Since 2 is not less than 1 ,  2, 1  R .
Therefore R not is symmetric.
Let  a, b  ,  b, c  R .
 a<b and b<c

a<c

  a, c  R
So, the relation R is transitive but not reflexive and symmetric.
iii. Reflexive and symmetric but not transitive.
Ans: Let us assume the relation
R   4, 4 ,  6, 6 , 8, 8 ,  4, 6  ,  6, 4  ,  6, 8 , 8, 6  in set A= 4, 6, 8 .
The relation R is reflexive since for aR ,  a, a  R .
The relation R is symmetric since  a, b  R   b, a  R for a,b R .
The relation R is not transitive since  4, 6  ,  6, 8 R , but  4, 8  R .
Therefore the relation R is reflexive and symmetric but not transitive.
iv. Reflexive and transitive but not symmetric.
Ans: Let us take the relation R =  a, b  : a 3

 b3  .
Since  a, b   R .
Therefore R is reflexive.
Since  2, 1  R , but 1, 2   R ,
Therefore R not is symmetric.
Let .
 a 3  b3 and b3  c3
 a 3  c3

  a, c   R
Therefore R is transitive.
Therefore the relation R is reflexive and transitive but not symmetric.
v. Symmetric and transitive but not reflexive.
Ans: Let us take a relation R= -5, -6 ,  -6, -5 ,  -5, -5 in set A= -5, -6 .
The relation R is not reflexive as  -6, -6   R .
Since  -5, -6   R and  -6, -5  R .
Since  -5, -6 ,  -6, -5  R and  -5, -5  R .
Therefore the relation R is symmetric and transitive but not reflexive.
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.
Ans: The given relation is R = { P, Q  : Distance of P from the origin is the

same as the distance of Q from the origin}
Since,  P, P   R .
The relation R is reflexive.

Let  P, Q   R , distance of P from the origin is the same as the distance of Q
from the origin similarly distance of Q from the origin will be the same as the
distance of P from the origin. So,  Q, P   R .
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 the relation R is an equivalence relation.
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?
Ans: The given relation is R = { T1, T2  : T1 is similar to T2 } .
The relation R is reflexive since every triangle is similar to itself.
If  T1 , T2   R , then T1 is similar to T2 .
 T2 is similar to T1 .

  T2 , T1   R
Let  T1, T2  ,  T2 , T3   R .
 T1 is similar to T2 and T2 is similar to T3 .
 T1 is similar to T3 .
  T1, T3   R
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 ?
Ans: R = { P1, P2 : P1 and P2 have same number of sides } .
Since  P1 , P1   R , as same polygon has same number of sides.
Let  P1 , P2   R .
 P1 and P2 have same number of sides.

  P2 , P1   R
Let  P1, P2  ,  P2 , P3   R .
  P1, P3   R
The elements in A related to right-angled triangle  T  with sides 3, 4 and 5 are

the polygons having 3 sides.
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 .
Ans: R = { L1, L2 : L1 is parallel to L 2 } .
The relation R is reflexive as any line L1 is parallel to itself, so,  L1, L1   R .
Let  L1 , L2   R .
 L1 is parallel to L 2 , therefore L 2 is parallel to L1 .
  L2 , L1   R

Let  L1, L2  ,  L2 , L1   R .
 L1 is parallel to L 2
 L 2 is parallel to L3
 L1 is parallel to L3
  L1 , L3   R
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 .
15. Let R be the relation in the set 1, 2, 3, 4 given by

R =  1, 2  ,  2, 2  ,  1, 1 ,  4, 4  ,  1, 3  ,  3, 3  ,  3, 2  . Choose the
correct answer.
(A) R is reflexive and symmetric but not transitive.
(B) R is reflexive and transitive but not symmetric.
(C) R is symmetric and transitive but not reflexive.
(D) R is an equivalence relation
Ans: R = 1, 2 ,  2, 2  , 1, 1 ,  4, 4  , 1, 3 , 3, 3 ,  3, 2 .

Since  a, a   R , for every a 1, 2, 3, 4

Since 1, 2   R , but  2, 1  R .

 a, b  ,  b, c   R   a, c   R for all a, b, c 1, 2, 3, 4 .
Therefore the relation R is reflexive and transitive but not symmetric.
The correct answer is ( B ) R is reflexive and transitive but not symmetric.
16. Let R be the relation in the set N given by R =  a, b  : a = b - 2, b > 6

Choose the correct answer.
(A)  2, 4   R
(B)  3, 8   R
(C)  6, 8   R
(D)  8, 7   R
Ans: The given relation is R =  a, b : a = b - 2, b > 6

Now,
Considering  2, 4   R .
Since, b > 6 , so,  2, 4   R .
Considering  3, 8  R .
Since 3  8 - 2 , so  3, 8  R .
Considering  6, 8  R .
Since 8>6 and 6=8-2 , so  6, 8  R .
Therefore, the correct answer is ( C )  6, 8  R .

Exercise 1.2
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
Therefore, the given function f is one – one.
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.
Hence the given function f is one – one and 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

Therefore the function g is one – one.
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
Therefore, function g is one-one but not onto.
2. Check the injectivity and surjectivity of the following functions:
i. f: N  N given by f  x  =x 2
Ans: The given function f: N  N is defined by f  x  =x 2 .
For x, y  N ,
f  x  = f  y
 x 2 = y2
x=y
Therefore function f is injective.
Since 2  N , but, there does not exist any x in N such that f  x  =2 .
Therefore function f is not surjective.
Hence, function f is injective but not surjective.
ii. f: Z  Z given by f  x  =x 2
Ans: The given function f: Z  Z is defined by f  x  =x 2 .
Since,
f  -1 = f 1

=1
But -1  1
Therefore function f is not injective.
Since -2  Z , but, there does not exist any element x  Z such that
f  x  = -2
Hence, function f is neither injective nor surjective.
iii. f: R  R given by f  x  =x 2
Ans: The given function f: R  R is given by f  x  = x 2
Now,
f  -1 = f 1
=1
But -1  1 .
Therefore function f is not injective.
Since -2R , but, there does not exist any element x  R such that
f  x  = -2 .
Hence, function f is neither injective nor surjective.
iv. f: N  N given by f  x  =x 3
Ans: The given function f: N  N is given by f  x  = x 3

For x, y  N ,
f  x  = f  y
 x 3 = y3
x=y
Since 2  N , but, there does not exist any x in N such that f  x  =2 .
v. f: Z  Z given by f  x  =x 3
Ans: The given function f: Z  Z is given by f  x  = x 3
For x, y  Z ,
f  x  = f  y
 x 3 = y3
x=y
Since 2  Z , but, there does not exist any x in Z such that f  x  =2 .

3. Prove that the Greatest Integer Function f: R  R given by f  x  =  x  ,
is neither one – one nor onto, where  x  denotes the greatest integer less
than or equal to x .
Ans: The function f: R  R is defined by f  x  =  x  .
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 function f is not one – one.
Taking 0.7R , f  x  =  x  is an integer. There does not exist any element x  R

such that f  x  = 0.7 .
Therefore, function f is not onto.
Hence, the greatest integer function is neither one – one nor onto.
4. Show that the Modulus Function f: R  R given by  x  = x is neither

one – one nor onto, where x is x , if x is positive or 0 and x is -x , if x is
negative.
Ans: f: R  R is f  x  = x
 x; x>0 
 
-x; x<0 
Now,

f  -1 = -1
=1
f 1 = 1
=1
Therefore, f 1 = f  -1 , but -1  1 .
Taking -1 R , f  x  = x is non-negative. Hence, there does not exist any

element x  R such that f  x  = -1 .
Therefore, the modulus function is neither one-one nor onto.
 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  x  takes only 3 values 1, 0, or -1 , for the element -2 in co-domain
R , there does not exist any x in domain R such that f  x  = -2 .
Therefore, the Signum function is neither one-one nor onto.
6. Let A = 1, 2, 3 , B = 4, 5, 6, 7 and let f =  1, 4  ,  2, 5  ,  3, 6  be a

function from A to B . Show that f is one – one.
Ans: The function f: A  B is defined as f = 1, 4 ,  2, 5 ,  3, 6 . Where

A = 1, 2, 3, B = 4, 5, 6, 7
Since,
f 1 = 4
f  2 = 5
f  3 = 6
Hence the images of distinct elements of A under f are distinct.
Therefore, the function f is one – one.
7. In each of the following cases, state whether the function is one – one, onto
or bijective.
Justify your answer.
i. f: R  R defined by f  x  = 3 - 4x .
Ans: The function f: R  R is defined by f  x  = 3 - 4x .
Taking x1 , x 2  R such that f  x1  = f  x 2  ,

 3- 4x1 = 3- 4x 2
 -4x1 = -4x 2
 x1 = x 2
Hence function f is one – one.
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
So, function f is onto.
Therefore, function f is bijective.
ii. f: R  R defined by f  x  = 1 + x 2
Ans: The function f: R  R defined as f  x  = 1 + x 2
Taking x1 , x 2  R such that f  x1  = f  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 .
Taking -2R . Since f  x  = 1 + x 2 is positive for all x  R , so there does not

exist any x in domain R such that f  x  = -2 .

Hence, the function f is neither one – one nor onto.
8. Let A and B be sets. Show that f: A × B  B × A such that

 a, b  =  b, a  is bijective function.
Ans: The function f: A × B  B × A is defined as f  a, b  =  b, a  .
 a1, b1  ,  a 2 , b2   A×B such that f  a1, b1  = f  a 2 , b2 

  b1, a1  =  b2 , a 2 
 b1 =b 2 and a1 = a 2
  b1, a1  =  b2 , a 2 
For  b, a   B×A ,
There exists  a, b   A×B such that f  a, b  =  b, a 
Therefore, function f is bijective.
 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.

 n+1 
 2 , if n is odd 
Ans: The function f: N  N is defined by f  n  =   for all
n
 , if n is even 
 2 
nN.
Now,
1+1
f(1)=
2
=1
2
f(2)=
2
=1
Here, f 1 = f  2  , but 1  2 .
Hence function f not is one – one.
Taking n  N ;
Case I: n is odd
Hence n = 2r + 1, for some r  N there exists 4r + 1 N such that
4r+1+1
f  4r + 1 =
2
=2r+1
Case II: n is even
Hence, n = 2r for some r  N there exists 4r  N such that
4r
f  4r  =
2
= 2r .

Therefore, function f is not bijective.
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.
For x, y  A such that f  x  =f  y 
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 .
The function f is onto if there exists x  A such that f  x  = y .
x-2
 =y
x-3
 x–2 = xy–3y
 x(1–y) = –3y + 2

2-3y
 x=  A [y  1]
1-y
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
Hence, function f is one – one and onto.
11. Let f: R  R be defined as f  x  = x4 . Choose the correct answer.
(A) f is one-one onto
(B) f is many-one onto
(C) f is one-one but not onto
(D) f is neither one-one nor onto
Ans: The function f: R  R is defined as f  x  = x 4 .
Taking x, y  A such that f  x  =f  y 
 x 4 =y 4

 x=±y
Therefore, f  x  = f  y  does not necessarily mean that x=y .
For 2  R , there does not exist any x in domain R such that f  x  = 2 .
So, function f is not onto.
Hence, The correct answer is ( D ) function f is neither one – one nor onto.
12. Let f: R  R be defined as f  x  = 3x . Choose the correct answer.
(A) f is one – one onto
(B) f is many – one onto
(C) f is one – one but not onto
(D) f is neither one – one nor onto
Ans: The function f: R  R is defined as f  x  = 3x .
Taking x, y  A such that f  x  =f  y 
 3x = 3y
x=y
y
For y  R , there exists in R such that;
3
 y  y
f   =3 
3 3
=y

Therefore, the correct answer is ( A ) function f is one – one and onto.
Exercise 1.3
1. Let f: 1, 3, 4  1, 2, 5 and g: 1, 2, 5  1, 3 be given by

f =  1, 2  ,  3, 5  ,  4, 1 and g = 1, 3  ,  2, 3  ,  5, 1 . Write down gof
Ans: The function f: 1, 3, 4  1, 2, 5 is given by
f = 1, 2 ,  3, 5 ,  4, 1
The function g: 1, 2, 5  1, 3 is given by g =1, 3 ,  2, 3 ,  5, 1
Now,
gof 1 = g f 1
= g  2 [as f 1 =2 ]
 3 [as g  2  = 3 ]
gof  3 = g f  3
= g  5 [as f  3 = 5 ]
=1 [as g  5 = 1 ]
gof  4 = g f  4
= g 1 [as f  4  = 1 ]
=3 [as g 1 = 3 ]
Hence, gof = 1, 3 ,  3, 1 ,  4, 3 .

2. Let f,g and h be functions from R to R . Show that
 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 
= f h  x  + g h  x 
=  foh  x  +  goh  x 
=  foh  +  goh  x 
= RHS
Hence proved.
To Prove:  f.g  oh =  foh . goh  .
Simplifying LHS:
LHS =  f . g  oh   x 
=  f . g  h  x 
= f h  x  + g h  x 
=  foh  x  .  goh  x 
=  f.g  oh   x 
=RHS
Hence proved.

3. Find gof and fog , if
i. The functions are  x  = x and  x  = 5x - 2
Ans: The given functions are f  x  = x and g  x  = 5x - 2
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

= 2x
Calculating fog :
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

34x
=
34
=x
Hence proved.
 fof = I x
Therefore, the given function f is invertible and the inverse of the function f is
the function f itself.
5. State with reason whether following functions have inverse
i. The function f: 1, 2, 3, 4  10 defined as

f =  1, 10  ,  2, 10  ,  3, 10  ,  4, 10 
Ans: The function f: 1, 2, 3, 4  10 defined as

f = 1, 10 ,  2, 10 , 3, 10  ,  4, 10 
As we can see, the function f is a many one function as
f 1 = f  2  = f  3 = f  4  = 10
Therefore, the function f does not have an inverse.
ii. The function g: 5, 6, 7, 8  1, 2, 3, 4 defined as

g =  5, 4  ,  6, 3  ,  7, 4  ,  8, 2 
Ans: The function g: 5, 6, 7, 8  1, 2, 3, 4 is defined as

g =  5, 4 ,  6, 3 ,  7, 4 , 8, 2 
As we can see, the function g is a many one function as

g  5 =g  7  =4 .
Hence function g is not one – one.
Therefore, the function g does not have an inverse.
iii. The function h: 2, 3, 4, 5  7, 9, 11, 13 defined as

h =  2, 7  ,  3, 9  ,  4, 11 ,  5, 13 
Ans: The function h: 2, 3, 4, 5  7, 9, 11, 13 defined as
h =  2, 7  , 3, 9  ,  4, 11 , 5, 13
All distinct elements of the set 2, 3, 4, 5 have distinct images under h .
Hence function h is one – one.
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.
Hence. The function h is a one – one and onto function.
Therefore the function h has an inverse.
6. Show that f:  -1, 1  R , given by  x  = X  X+2  is one – one. Find the

inverse of the function f:  -1, 1  Range f .
(Hint: For y  Range f, y=  x  =  X+2  , for some x in [-1, 1], i.e., x = 2y(1-y) )
Ans: The function f: -1, 1  R is given as  x  = X  X+2 
For function f to be one – one,
f  x  = f  y

  X+2  =  Y+2 
 xy +2x = xy +2y
 2x = 2y
x=y
And f: -1, 1  Range f is onto.
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.
Let us assume that the function g: Range f  -1, 1 be the inverse of f .
Let y be an arbitrary element of range f .
Since f: -1, 1  Range f is onto,
y = f  x  for some x [-1, 1]
x
 y=
(x+2)
 xy+2y=x
 x(1-y)=2y
2y
 x- ,y  1
1-y
Let us define g: Range f  -1, 1 as:
2y
g(y)= ,y  1.
1-y
So,

(gof)(x)=g(f(x))
 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
Therefore, gof=x=I-1,1 and fog=y=IRange f .

 f -1 =g
2y
Therefore, f -1 (y)= ,y  1.
1-y
7. Consider f: R  R given by f  x  =4x+3 . Show that f is invertible. Find

the inverse of f .
Ans: The given function f: R  R is given by, f  x  =4x+3
For function f to be one – one
f  x  = f  y
 4x +3 = 4y +3
 4x = 4y
x=y
For function f to be onto
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

Hence, the function f is a onto.
Therefore, the inverse of the function f exists.
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
Therefore, gof=fog=I R . The function f is invertible and the inverse of f is given

y-3
by f -1  y  = g  y  = .
4

8. Consider f: R+   4,   given by f  x  =x 2 +4 . Show that f is invertible
with the inverse f -1 of given f by f -1 (y)= Y-4 , where R+ is the set of all
non-negative real numbers.
Ans: The given function f: R+   4,   is defined as f  x  =x 2 +4 .
For function f to be one – one:
f  x  = f  y
x 2 + 4 = y2 + 4
 x 2 = y2
 x = y [as x = y  R + ]
For function f to be onto:
For y [4,) , let y = x 2 +4
 x 2 = y - 4  0  as y  4
 x= Y - 4  0
Hence, for any y [4,) there exists x = Y - 4  R + , such that
f x = f  Y-4 
 
2
= Y - 4 +4
=y-4+4
=y
Hence function f is onto.
Since function f is one – one and onto and therefore, f -1 exists.

Let us define g:  4,    R+ by g  y  =Y - 4 .
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
Therefore, gof = fog = IR .
Hence, the function f is invertible and the inverse of f is given by

f -1  y  = g  y  = Y-4
9. Consider f: R+   -5,   given by f  x  = 9x 2 + 6x - 5 . Show that f is

 ( y+6)-1 
invertible with f -1  y  =   .
 3 
Ans: The function f: R+  -5,   is given as f  x  = 9x 2 + 6x - 5 .
Let y be an arbitrary element of  -5,   .

y=9x 2 +6x–5
 y =  3x + 1 -1-5=  3x + 1 -6
2 2
 y + 6 =  3x + 1
2
 3x+1 = Y+6 [as y  -5  y + 6 > 0]
 ( y+6)-1 
 x = 
 3
 
Therefore, function f is onto, range f = [-5,) .
 ( 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  
=( y+6)2 -6
=y+6-6
=y
Therefore,
gof = x = IR
fog = y = IRange f
So, the function f is invertible and the inverse of f is given by:
 ( y+6)-1 
f -1  y  =g(y)=   .
 3
 
10. Let f: X  Y be an invertible function. Show that f has unique inverse.
(Hint: suppose g 1 and g 2 are two inverses of f . Then for all

y  Y, fog1  y  = I Y  y  = fog 2  y  . Use one – one ness of f ).
Ans: Let f: X  Y be an invertible function.
Assuming that f has two inverses ( g1 and g 2 )
For all y  Y ,
fog1  y  = IY  y 
= fog 2  y 
 f  g1  y   = f  g2  y  
 g1  y  = g 2  y  [as f is invertible  f is one – one]
 g1 = g 2 [as g is one – one]

Therefore, the function f has a unique inverse.

11. Consider f: 1, 2, 3  a, b, c given by f  1 = a, f  2  = b and
f  3  = c . Find f -1 and show that  f -1  = f .

-1
Ans: Function f: 1, 2, 3  a, b, c is given by f 1 = a, f  2  = b and

f  3 = c .
If we define g: a, b, c  1, 2, 3 as g  a  = 1, g  b  = 2, g  c  = 3 .
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,
 gof 1 = g  f 1

= f a 
=1
 gof  2 = g  f  2
= f b

=2
 gof  3 = g  f 3
= f c
=3
So, gof=I X and fog = I Y , where X = 1, 2, 3 and Y= a, b, c .
Therefore, the inverse of f exists and f -1 =g .
So, function f -1: a, b, c  1, 2, 3 is given by

f -1  a  = 1, f-1  b  = 2, f–1  c  = 3
If we define h: 1, 2, 3  a, b, c as h 1 = a, h  2  = b, h  3 = c .
 goh 1 = g  h 1

= g a 
=1
 goh  2 = g  h  2
= g  b
=2
 goh 3 = g  h 3

= g c
=3
And
 hog  a  = h  g  a 
= h 1

=a
 hog  b  = h  g  b 
= h  2
=b
 hog  c = h  g  c 
= h  3
=c
So, goh=I X and hog = I Y , where X = 1, 2, 3 and Y= a, b, c .
The inverse of g exists and g -1 = h  (f -1 )-1 = h .
So, h = f .
Hence,  f -1  = f .
-1
12. Let f: X  Y be an invertible function. Show that the inverse of f -1 is f

, i.e.,  f -1  = f .
-1
Ans: Let f: X  Y be an invertible function.
Then there exists a function g: Y  X such that gof = I X and fog = I Y .
So, f -1 =g .
 gof = IX and fog = I Y .
Hence, f -1: Y  X is invertible and f is the inverse of f -1 i.e.,  f -1  = f .

-1

1
13. If f: R  R be given by  x  =  3-x 3
 3
, then fof  x  is
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 .
The correct answer is ( C ) 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
(B) g  y  = .
4-3y
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
Let y be an arbitrary element of Range f .
 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
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
Therefore, fo(y) = f(g(y)) = f .
So, gof=I 4

and fog=IRangef
R- 
3
Hence, g is the inverse of f i.e., f -1 =g .
 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

Exercise 1.4
1. Determine whether or not each of the definition of given below gives a

binary operation.
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 = a-b .
So, * is not a binary operation as the image of 1, 2 under * is

1 * 2=1-2=-1 Z+ .
ii. On, Z+ define * by a * b = ab .
Ans: On Z+ , * is defined by a * b = ab .
For each a, b  Z+ there is a unique element ab in Z+ .
So, we can say that * carries each pair  a, b  to a unique element a * b = ab in

Z+ . Therefore, * is a binary operation.
iii. On R , define * by a * b = ab2 .
Ans: On R , * is defined by a * b = ab2 .
For each a,b  R , there is a unique element ab 2 in R .
Therefore, * carries each pair  a, b  to a unique element a * b = ab2 in R .
Hence, * is a binary operation.
iv. On, Z+ define * by a * b = a - b *.
Ans: On Z+ , * is defined by a * b = a - b .

For each a, b  Z+ there is a unique element a - b in Z+ .
Therefore, * carries each pair (a,b) to a unique element a * b = a - b in Z+ .

Hence, * is a binary operation.
v. On Z+ , define * by a * b = a .
Ans: On Z+ , * is defined by a * b = a .
For each a, b  Z+ there is a unique element a in Z+ .
Therefore, * carries each pair  a , b  to a unique element a * b = a in Z+ . Hence,

* is a binary operation.
2. For each binary operation * defined below, determine whether * is

commutative or associative.
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 .
Hence, the operation * is not commutative.
For 1, 2, 3 Z ,
1*2*3= 1-2*3

=-1*3
=-1-3
= -4
1* 2*3 =1* 2-3
 1* 1
 1   1
2
Therefore, 1 * 2  * 3  1 *  2 * 3 .
Hence, the operation * is not associative.
ii. On Q , define a*b=ab+1.
Ans: On Q , * is defined by a*b=ab+1 .
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
Hence, operation * is commutative.
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

=1*7
=1×7+1
=8
Therefore, 1 * 2  * 3  1 *  2 * 3 .
So, the operation * is not associative.
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*(b*c)=   *c
 2
 bc 
 a
= 
2
2
abc
=
4
Therefore,  a*b *c = a* b*c  .
So, the operation * is associative.
iv. On Z+ , define a * b = 2ab .
Ans: On Z+ , * is defined by a * b = 2ab .
For all a, b  Z+ , ab = ba .
 2ab = 2ba for all a, b  Z+
 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

= 1*64
= 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

=281
Therefore,  2 * 3 * 4  2 *  3 * 4  .
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

1
=
10
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  .
3. Consider the binary operation  on the set 1, 2, 3, 4, 5 defined by

a  b = min a, b . Write the operation table of the operation  .
Ans: The binary operation  on the set 1, 2, 3, 4, 5 is defined by

a  b = min a, b for all a, b 1,2, 3, 4, 5 .
Operation table for the given binary operation  is:

 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

4. Consider a binary operation * on the set 1, 2, 3, 4, 5 given by the
following multiplication table.
(Hint: use the following table)
* 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: The operation * is commutative because for every a, b 1,2, 3, 4, 5 , we

have a * b = b * a .
iii. Compute (2 * 3) * (4 * 5).
Ans: Calculating  2 * 3 *  4 * 5 :
Since,

 2 * 3 = 1
 4 * 5 = 1
So,
 2 * 3 *  4 * 5  = 1 * 1
=1
5. Let *' be the binary operation on the set 1, 2, 3, 4, 5 defined by

a * b = H.C.F of a and b . Is the operation *' same as the operation *
defined in Exercise 4 above? Justify your answer.
Ans: The binary operation *' on the set 1, 2, 3, 4, 5 is defined by

a * b = H.C.F of a and b .
Operation table for the operation *' can be given as:
*' 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 * .
6. Let * be the binary operation on N given by a * b = L.C.M of a and b .

Find
i. Calculate 5 * 7 and 20 * 16 .
Ans: Calculating 5 * 7 :
Since, a * b = L.C.M of a and b .

5 * 7 = L.C.M of 5 and 7 .
=35
Calculating 20 * 16 :
Since, a * b = L.C.M of a and b .
20 * 16= L.C.M of 20 and 16 .

=80
ii. Is * commutative?
Ans: Since L.C.M of a and b is equal to L.C.M of b and a for all a, b  N .
So, a * b = b * a .
Therefore, the operation * is commutative.
iii. Is * associative?
Ans: For a, b, c  N ,
a * b * c = ( L.C.M of a and b ) * c = L.C.M of a,b and c .
a *  b * c  = a * ( L.C.M of b and c )  L.C.M of a,b and c .
So,  a * b  * c = a *  b * c  .
Therefore operation * is associative.
iv. Find the identity of * in N .
Ans: The binary operation * on N is defined as L.C.M of a and b .
Now,
L.C.M of a and 1 is equal to L.C.M of 1 and a for all a  N .

So, a * 1 = a = 1 * a for all a  N .
Therefore, 1 is the identity of * in N .
v. Which elements of N are invertible for the operation * ?
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 .
This is only possible when a and b are equal to 1 .
Therefore, 1 is the only invertible element of N with respect to the operation * .
7. Is * defined on the set 1, 2, 3, 4, 5 by a * b = L.C.M of a and b a binary

operation? Justify your answer.
Ans: The operation * on the set A= 1, 2, 3, 4, 5 is defined as a * b = L.C.M of

a and b .
The operation table for * is as follows:
* 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 = 6A
5 * 2 = 2 * 5 = 10  A
3 * 4 = 4 * 3 = 12  A

3 * 5 = 5 * 3 = 15  A
4 * 5 = 5 * 4 = 20  A
Hence, the given operation * is not a binary operation.
8. Let * be the binary operation on N defined by a * b = H.C.F 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 = H.C.F of a and b .
Since, H.C.F of a and b=H.C.F of b and a for all a, b  N .
Therefore, a * b = b * a .
a * b * c = ( H.C.F of a and b ) * c = H.C.F of a,b and c .
a *  b * c  = a * ( H.C.F of b and c ) H.C.F of a,b and c .
So,  a * b  * c = a *  b * c  .
Therefore operation * is associative. a * 1 = a = 1 * a for all a  N
So, e  N will be the identity for the operation * if a * e = a = e * a for all e  N

. But this relation is not true for any e  N .
Therefore, operation * does not have any identity in N .
9. Let * be a binary operation on the set Q of rational numbers. Find which

of the given binary operations are commutative and which are associative.
i. The binary operation * is given by a * b = a - b .
Ans: On, The binary operation * is defined as a * b = a - b on set Q .

1 1
For , Q ,
2 3
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
Hence, the binary operation * is not commutative.
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

2-3
=
12
-1
=
12
And;
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
Hence, the binary operation * is not associative.
ii. a * b = a2 + b2
Ans: On, The binary operation * is defined as a * b = a 2 + b2 on set Q .
For a,b Q ,
a*b=a 2 +b2
=b 2 +a 2
=b*a

Therefore, a*b=b*a .
Hence, the binary operation * is commutative.
For 1,2,3Q ,
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
Ans: The binary operation * is defined as a * b = a + ab on set Q .
For 1,2  Q ,
1*2=1+1×2
=1+2

=3
2*1=2+2×1
=2+2
=4
Therefore, 1 * 2  2 * 1 .
Hence, operation * is not commutative.
For 1,2,3Q ,
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 .

iv. a * b =  a - b 
2
Ans: The binary operation * is defined as a * b =  a - b  on set Q .

2
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,3Q ,
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
=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,

 ba 
a*(b*c) = a* 
 4 
bc
a
= 4
4
abc
=
16
Therefore,  a * b  * c = a *  b * c 
Hence, the binary operation * is associative.
vi. a * b = ab2
Ans: The binary operation * is defined as a * b = ab2 on set Q .
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
=
12
1 1 1 1
Therefore, *  * .
2 3 3 2
Hence, the binary operation * is not commutative.
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
=
2  2304
1
=
4608
1 1 1 1 1 1
Therefore,  *  *  * *  .
 2 3 4 2 3 4
10. Find which of the operations given above has identity.
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 .
Therefore, none of the operations given above has identity.
11. A = N × N and * be the binary operation on A defined by

 a, b  *  c, d  =  a + c, b + d  . Show that * is commutative and
associative. Find the identity element for * on A , if any.
Ans: The binary operation * on A = N × N a is defined by
 a, b  *  c, d  =  a + c, b + d  .
Let  a, b  ,  c, d   A and a, b, c, d  N
 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, b * c, d  * e, f  =  a + c, b + d * e, f 
=  a + c + e, b + d + f 
And,
 a, b *  c, d * e, f  =  a, b *c + e, d + f 

=  a + c + e, b + d + f 
Therefore,  a, b * c, d  * e, f  =  a, b *  c, d * e, f  .
Hence, the binary operation * is associative.
For the binary operation * , e =  e1,e2   A will be an identity element only if

a*e=a=e*a for all a =  a1,a 2   A , that is,
 a +e , a
1 1 2
+ e 2  =  a1 , a 2  =  e1 +a1 , e 2 +a 2  . Which is not true for any element in
A.
Hence the binary operation * does not have any identity element.
12. State whether the following statements are true or false. Justify.
i. For an arbitrary binary operation * on a set N , a * a = aa  N .
Ans: Let us define an binary operation * on N as a * a = a+ba  N
Taking b = a = 3 ,
3*3=3+3=6  3
Therefore the given statement is false.

ii. If * is a commutative binary operation on N , then a*  b*c  =  c*b  *a .
Ans: It is given that if * is a commutative binary operation on N , then

a* b*c  =  c*b *a .
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 .
Hence, the given statement is true.
13. Consider a binary operation * on N defined as a*b=a3 + b3 . Choose the

correct answer.
(A) The binary operation * is both associative and commutative.
(B) The binary operation * is commutative but not associative.
(C) The binary operation * is associative but not commutative.
(D) The binary operation * is neither commutative nor associative.
Ans: The binary operation * is defined as a*b=a 3 + b3 on N .
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
1. Let f: R  R be defined as f  x  = 10x + 7 . Find the function g: R  R

such that gof = fog = I R .

Ans: The given function f: R  R is defined as f  x  = 10x + 7 .
For the function f to be one – one:
f  x  = f  y  , where x, y  R .
 10x + 7 = 10y + 7
x=y
So, the given function f is a one – one function.
For the function f to be onto:
Let y = 10x + 7 , for y  R .
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
So, the given function f is onto.
Therefore, the function f is an invertible function.
y-7
Defining g: R  R as  y  = .
10
Calculating gof :

go  x  =g  f  x  
= 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
Therefore, gof = I R and fog = I R .
2. Let f: W  W be defined as f  n  = n - 1 , if n is odd and f  n  = n + 1 , if

n is even. Show that f is invertible. Find the inverse of f . Here, W is the
set of all whole numbers.
 n-1 if n is odd 
Ans: The function f: W  W is defined as f  n  =  
n+1 if n is even 
For the function to be one – one:
f  n  = f  m

If n is odd and m is even, then we will have n - 1 = m + 1.
 n-m = 2
Which is not possible.
Similarly, the possibility that of n is even and m is odd can also be ignored.
Therefore, both n and m must be either odd or even.
Now, if both n and m are odd,
f  n  = f  m
n - 1 = m - 1
n=m
if both n and m are even,
f  n  = f  m
n + 1 = m + 1
n=m
Therefore the given function f is one – one.
For the function to be onto:
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 .
Hence, the function f is onto.
Therefore, the function f is an invertible function.
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  

= g  n - 1
=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 .
Hence, the function f is invertible and the inverse of f is given by f -1 =g , which

is the same as f .

3. If f: R  R is defined by f  x  = x 2 - 3x + 2 , find f  f  x   .
Ans: The function f: R  R is defined as f  x  = x 2 - 3x + 2 .
Calculating f  f  x   :
f  f  x   = f  x 2 - 3x + 2 
=  x 2 - 3x + 2  - 3  x 2 - 3x+2  +2
2
=  x 4 +9x 2 +4-6x 3 -12x+4x 2  +  -3x 2 +9x-6  +2
= x 4 -6x 3 +10x 2 –3x
4. Show that function f: R  {x  R:-1 < x < 1} defined by

x
f  x = ,x  R is one – one and onto function.
1+|x|
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|
Assuming that x is positive and y is negative:
x y
=
1+x 1+y
 2xy=x-y
Since, x > y  x-y > 0 .

But 2xy is negative.
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.
So, x and y have to be either positive or negative.
Assuming that both x and y are positive:
f(x)=f(y)
x y
 =
1+x 1+y
 x+xy=y+xy
 x=y
Assuming that both x and y are negative:
f(x)=f(y)
x y
 =
1+x 1+y
 x+xy=y+xy
 x=y
Therefore, the function f is one – one.
For onto:
y  R such that -1 < y < 1 .
y
If y is negative, 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
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
Therefore, the function f is onto.
Hence the given function f is both one – one and onto.

5. Show that the function f: R  R given by f  x  = x 3 is injective.
Ans: The given function f: R  R is given as f  x  = x 3 .
f  x  = f  y  where x, y  R .
 x 3 =y3 …… (1)
We need to show that x=y .
Assuming that x  y , then,
 x 3  y3
Since this is a contradiction to (1), therefore, x=y .
Hence, the function f is injective.
6. Give examples of two functions f: N  Z and g: Z  Z such that gof

is injective but g is not injective.
(Hint: Consider f  x  = x and g  x  = x )
Ans: Taking the function f: N  Z as f  x  = x and the function g: Z  Z as

g x = x .
Showing that g is not injective:
 -1 = -1 = 1
1 = 1= 1
Therefore  -1 = g 1 but -1  1.
Therefore the function g is not injective.

Showing that gof is injective:
The function gof: N  Z is defined as
go  x  = g  f  x  
= gx
= x
Taking x, y  N such that gof  x  = gof  y  .
x = y
Since x, y  N , both are positive.

x=y
Therefore the function gof is injective.
7. Given examples of two functions f: N  N and g: N  N such that gof

is onto but f is not onto.
 x-1, if x>1
(Hint: Consider f  x  = x+1 and  x  =  )
 1, if x>1 
Ans: Taking the function f: N  N as f  x  = x+1
 x-1, if x>1
And the function g: N  N by g  x  =  
1, if x>1 
Showing that g is not onto.
Taking an element 1 in co-domain N .
Since this element is not an image of any of the elements in domain N , therefore
g is not onto.

Showing that gof is onto:
The function gof: N  N is defined as go  x  = g  f  x   .
= 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 .
Therefore, the function gof is onto.
8. Given a non-empty set X , consider P  X  which is the set of all subsets of

X . Define the relation R in P  X  as follows:
For subsets A,B in P  X  , ARB if and only if A  B . Is R an equivalence

relation on P  X  ? Justify you answer.
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 .
This does not mean that B  A .
If A = 1, 2 and B = 1, 2, 3 , then it cannot be implied that B is related to A .
If ARB and BRC , then;
A  B and B  C
AC
 ARC

Hence, R is not an equivalence relation as it is not symmetric.
9. Given a non-empty set X , consider the binary operation

*: P  X  × P  X   P  X  given by A*B = A  BA, B in P  X  is the
power set of X . Show that X is the identity element for this operation and
X is the only invertible element in P  X  with respect to the operation * .
Ans: The binary operation *: P  X  × P  X   P  X  is given by

A*B = A  BA, B in P  X  .
A  X = A = X  A for all A  P  X 
 A * X = A = X * A for all A  P  X 
X is the identity element for the given binary operation * .
An element A  P  X  is invertible if there exists B  P  X  such that
A*B=X=B*A [As X is the identity element]
Or
A  B=X=B  A
This is only possible when A = X = B.
Therefore, X is the only invertible element in P  X  with respect to the given

operation * .
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 .

Since the total number of permutations on n symbols 1, 2, 3, ... , n is n , thus
total number of onto maps from {1, 2, 3, ... , n} to itself are 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.
i. The function is given as F =  a, 3  ,  b, 2  ,  c, 1 .
Ans: The function F: S  T is defined as F =  a, 3 ,  b, 2  ,  c, 1 .
 F  a  = 3, F  b  = 2, F  c  = 1
Therefore, F-1:T  S is given by F-1 =  3, a  ,  2, b  , 1, c  .
ii. The function is given as F =  a, 2 ,  b, 1 ,  c, 1 .
Ans: The function F: S  T is defined as F= a, 2 ,  b, 1 ,  c, 1 .
Since F  b  = F  c  = 1 , the function F is not one – one.
Hence, the function F is not invertible so its inverse does not exist.
12. Consider the binary operations *: R × R  R and o: R × R  R

defined as a*b = a-b and aob =a,a,b  R . Show that * is commutative
but not associative, o is associative but not commutative. Further, show
that a,b,c  R,a*  boc  =  a*b  o  a*c  . [If it is so, we say that the
operation * distributes over the operation o ]. Does o distribute over * ?
Justify your answer.
Ans: It is given that *: R × R  R and o: R × R  R is defined as a*b = a-b

and a ob=a,a,b  R

For a,b  R , we have a*b = a-b
And,
b*a = b-a    a-b   a-b
Therefore, a*b= b*a .
For 1,2,3 R ,
1*2*3=  1-2 *3

=1*3
= 1-3
=2
And,
1* 2*3 =1* 2-3 
=1*1
= 1-1
=0
Therefore, 1*2 *3  1* 2*3 .
Hence, the operation * is not associative.
We can observe that, for 1,2,3 R , 1o2=1 and 2o1=2
Therefore, 1o 2  2o1
Hence, the operation o is not commutative.
For a,b, c  R ,

 a ob  oc =a oc=a
And,
a o  b oc  =a ob=a
Therefore,  a ob  oc  a o  b oc  where a,b, c  R .
Operation o is associative.
For a,b, c  R ,
a * b oc  =a * b= a-b
 a*b  o  a*c =  a-b  o  a-c   a-b

Hence, a * b oc  =  a*b  o  a*c  .
So, if 1,2,3 R , then,
1o  2*3 =1o  2-3 
=1o1
=1
1o2 *1o3 =1*1
= 1-1
=0
Therefore, the operation o does not distribute over * .
13. Given a non - empty set X , let *: P  X  × P  X   P  X  be defined as

A*B=(A-B)  (B-A),A,B  P(X) . Show that the empty set  is the
identity for the operation * and all the elements A of P(X) are invertible
with A-1 =A .
(Hint:  A-Φ    Φ-A  =A and  A-A    A-A  =A*A ).
Ans: The function *: P  X  × P  X   P  X  is defined as

A*B=(A-B)  (B-A),A,B  P(X) .
For A  P(X) ,
A*Φ=  A-Φ    Φ-A 
=A  Φ
=A
Φ*A=  Φ-A    A-Φ 
=Φ  A
=A
Therefore, A*Φ=Φ*A for all A  P(X) .
For the given operation * , Φ is the identity element.
For A  P(X) , if there exists B  P(X) such that A*B=Φ=B*A , then element
A  P(X) will be invertible.
For all A  P(X) ,
A*A=  A-A    A-A 
=Φ-Φ
=Φ
Therefore, all the elements A  P(X) are invertible with A-1 =A .
14. Define a binary operation * on the set 0, 1, 2, 3, 4, 5 as

a+b if a+b<6 
a*b=  .
a+b-6 if a+b  6 

Show 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 us take X= 0, 1, 2, 3, 4, 5 .
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 ]
Therefore, a*0=0*a for all a  X .
Hence, 0 is the identity element for the given operation * .
For a  X , if there exists b  X such that a*b=0=b*a , then element a  X will be

invertible. That is,
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
Since, X= 0, 1, 2, 3, 4, 5 and a,b  X . So, a  -b .
Therefore, b=6-a is the inverse of a for all a  X .
15. Let A=-1, 0, 1, 2 ,B=-4, -2, 0, 2 and f,g:A  B be functions defined

1
by f  x  =x 2 -x,x  A and g  x  =2 x- -1,x  A . Are f and g equal?
2

Justify your answer. (Hint: One may note that two function f:A  B
and g:A  B such that f  a  =g  a  a  A , are called equal functions)
Ans: Let A=-1, 0, 1, 2 ,B=-4, -2, 0, 2 and f,g:A  B are defined by

1
f  x  =x 2 -x, x  A and g  x  =2 x- -1,x  A .
2
f  -1 =  -1 -  -1

2
=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 

f 1 = 1 - 1
2
=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 
Therefore, f  a  =g  a  a  A . Hence functions f and g are equal.

16. 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: We are given a set A= 1, 2, 3 .
Let us take the relation R, containing 1, 2 and 1, 3 , as

R=1, 1 ,  2, 2  , 3, 3 , 1, 2  , 1, 3 ,  2, 1, 3, 1 .
As we can see that 1, 1 ,  2, 2  ,  3, 3  R , therefore relation R is reflexive.
Since 1, 2  , 1, 3 ,  2, 1  R , the relation R is symmetric.
The relation Relation R is not transitive because 1, 2  ,  3, 1  R , but  3, 2   R
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.
The correct answer is option ( A ) 1 .
17. Let A=1, 2, 3 Then number of equivalence relations containing  1, 2 

is
(A) 1
(B) 2
(C) 3
(D) 4
Ans: We are given a set A= 1, 2, 3 .
Let us take the relation R , containing 1, 2  as
R=1, 1 ,  2, 2 ,  3, 3 , 1, 2  ,  2, 1 .
Now the pairs left are  2, 3 ,  3, 2  , 1, 3 ,  3, 1
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.
So, only equivalence relation (bigger than R ) is the universal relation.
Therefore, the total number of equivalence relations containing 1, 2  are two.
Hence, the correct answer is (B) 2 .
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 .
Let us take x  (1, 0] .
So,  x  =1 if x=1 and  x  =0 if 0<x<1 .
Now,

fog  x  = f  g  x  
= f  x 
f 1 ,if x=1 

= 
f  0  ,if x   0,1 
1,if x=1 
= 
 0,if x   0,1 
go  x  = g  f  x   =g 1 [as x>0 ]
= 1
=1
Therefore, when x(1,0], fog = 0 and gof = 1, so they do not coincede in (1.0].
19. Number of binary operations on the set {a,b} are
(A) 10
(B) 16
(C) 20
(D) 8
Ans: A binary operation * on {a.b} is a function defined as {a,b}x{a,b}  {a.b}.
That is, * is a function from {(a,a), (a,b), (b,a), (b,b)} {a,b}.

4
Therefore the total number of binary operations on the set {a,b} is 2 =16 .
Hence, the correct answer is (B) 16.

Access of Full Crash Course to Revise
screen Syllabus Course Entire Syllabus
Test Series and Chapter Wise Course to

Assignment help you master One chapter
Notes & Recordings Unlimited In-class

of every class Doubt Solving
Use VPROP & Get Extra 20% OFF
Subscribe Now
https://vdnt.in/VPROPDF
GRADES 6-12 | CBSE | ICSE | JEE | NEET

Download
Vedantu Learning APP
Free LIVE
MasterClasses
Unlimited Access
to Study Materials
Specially Designed
Tests
DOWNLOAD
Best of 2019 Winner THE APP
USER’S CHOICE
APP AWARD 2019
Category
Everyday Essentials
 Thank You
for downloading the PDF
Samajh Aayega toh

Maza Aayega!!
FREE MASTER CLASS SERIES

 For Grades 6-12th targeting JEE, NEET, CBSE, ICSE & many more Register for FREE
 Free 60 Minutes LIVE Interactive classes everyday
Limited Seats!
 Learn from India’s Best Master Teachers

Jab Saara India Vedantu Pe Online Padhega: Scholarship Admission Test

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Jab Saara India Vedantu Pe Online Padhega: Scholarship Admission Test

Uploaded by

Copyright:

Available Formats

PDF download

JAB SAARA INDIA

Scholarship Admission Test

548 268 1 OUT OF 3

Mumbai se Panchkula se Gurugram se Patiala se Maharashtra se Surat se

JEE Adv. NEET

157 Students 171 Students

12TH Boards 10TH Boards

Scholarship Admission Test

1. Determine whether each of the following relations are reflexive,

i. Relation R in the set A = 1, 2, 3...13, 14 defined as

Ans: The given relation is: R = 1, 3 ,  2, 6 , 3, 9  ,  4, 12 

Since 1, 1 ,  2, 2 ... and 14, 14  R .

We conclude that R is not reflexive.

Since 1, 3  R , but  3, 1  R . [since 3 3 -1  0 ]

We conclude that R does not belong to symmetric.

Since 1, 3 and  3, 9   R , but 1, 9  R. 31 -9  0 .

We conclude that R is not transitive.

Therefore, the relation R is not reflexive, symmetric or transitive.

ii. Relation R in the set N of natural numbers defined as

Ans: The given relation is: R = 1, 6 ,  2, 7  ,  3, 8 .

We conclude that R is not reflexive.

Class XII Maths www.vedantu.com 1

We conclude that R does not belong to symmetric.

Therefore R is not transitive.

Hence, the given relation R is not reflexive, symmetric or transitive.

iii. Relation R in the set A = {1, 2, 3, 4, 5, 6} as R= {  x, y  : y is divisible by

Ans: The given relation is R = { x, y  : y is divisible by x}

As we know that any number except 0 is divisible by itself, therefore  x, x   R

We conclude that R is reflexive.

Since  2, 4   R [because 4 is divisible by 2 ], but  4, 2   R [since 2 is not

We conclude that R does not belong to symmetric.

Assuming that  x, y  and  y, z   R , y is divisible by x and z is divisible by y

We conclude that R is transitive.

iv. Relation R in the set Z of all integers defined as R = {  x, y  : x - y} is as

Ans: The given relation is R = { x, y : x - y is an integer }

Class XII Maths www.vedantu.com 2

Hence, we conclude that R is reflexive.

For x, y  Z , if  x, y   R , then x - y is an integer and therefore  y-x  is also an

Therefore, we conclude that  y, x   R and hence R is symmetric.

Assuming that  x, y  and  y, z   R , where x, y, z  Z .

We can say that  x-y  and  y-z  are integers.

Therefore x-z = (x-y) + (y-z) is also an integer, so,  x, z   R

Hence, we conclude that R is transitive.

Therefore the given relation R is reflexive, symmetric, and transitive.

v. Relation R in the set A of human beings in a town at a particular time

a) The relation is: R = {  x, y  : x and y work at the same place }

This implies that  x, y   R .

Hence, we conclude that R is reflexive.

Hence, we conclude that R is symmetric.

Let us assume that  x, y  ,  y, z   R .

Class XII Maths www.vedantu.com 3

Hence, we conclude that R is transitive.

Therefore, the given relation R is reflexive, symmetric and transitive.

b) The relation is: R = {  x, y  : x and y live in the same locality }

Ans: The given relation is R = { x, y : x and y live in the same locality }

Therefore, we conclude that R is reflexive.

Hence, we conclude that R is transitive.

Therefore, the given relation R is reflexive, symmetric and transitive.

c) R = {  x, y  : x is exactly 7 cm taller than y}

Ans: The given relation is: R = { x, y : x is exactly 7 cm taller than y}

Class XII Maths www.vedantu.com 4