Relations

a n d Functions

RELATIONS
Ris a relation from A to B ==> R ~ A x B (A and
Bar e two non -em pty sets).
Dom ain and Range
► Dom ain of R={ aeA ; (a,b) e R, V beB }
► Range of R={ beB ; (a ,b)E R, Vae A}
Tota l Num ber of Relations
►
Let A and B be two non- emp ty finite sets havi
ng n and m elem ents respectively.
Then, total num ber of relations from A to B
= 2nm
TYPES OF RELATIONS

► Reflexive Rel ltio n: A relation Ron a set A

is reflexive if (a, a) ER V a EA.
► Symmetric Relation: A relation Ron a set A
is sym met ric if (a 1, a2) ER==> (a2, a1)ER
V a1, a2 EA.

► Transitive Relati~n: A relation Ron a set A

is tran sitiv e if (ai, a ) ER and (a2, a3) ER
⇒ (ai, a3) E R V ai, a2, a3 E A. 2

► Anti-symmetric Relation: A relation Ron a

set A is calle d an anti-symmetric relation
if (a, b) ER and (b, a) E R ⇒ a= b.
*
If a b, then a may be related to b or b may be
rela ted to a, but neve r both .
► Equivalence Relation : A relation R is an equi
valence rela tion if R is reflexive, symmetric
and transitive.
► Void Relation : A relation R on a set A is calle
d emp ty or void relation, if no element of
A is related to any elem ent of A? i.e., R = <I> c
A x A.
► Universal Relation : A relation R on a set A
is calle d univ ersa l rela tion if each element
of A is related to ·every elem ent of A , i.e., R =A
x A~ '
► Iden tity Rela tion : The relation I A on set A
is iden tity rela tion , if ever y element of AiS
related to itself only.
2 wt.tG- Objective NCERT at your Fingertips

► Inverse Relation : Risa relation on set A, then R- 1 on A is defined as R- 1 = {(b, a) : (a, b) E R}.

COMPOSITION OF RELATIONS
► Let R CA x B, S C B x C be two relations, then composite relation of R and S is SoR c A x C or
SoR = {(a, c) : (a, b) ER, (b, c) E Sl

Points to Remember
► The identity relation is always a reflexive relation but its converse need not to be true.
► Universal relation on a non-void set A is reflexive.
► A relation which is not _symmetric, is not necessarily anti-symmetric.
► Identity relation on a set A is an anti-symmetric relation.
► Intersection of two equivalence relations is also an equivalence relation but for union it is not necessarily
true.
1 1
► (SoRr 1 = R- oS- , known as reversal rule.

FUNCTIONS
► A function f is defined on sets A and B by f: A ➔ B or A ~ B such that all elements of set A are
associated to a unique element in set B.

Domain and Range

► Do~ain of function : Let f: A ➔ B, then A is known as domain off while B is known as co-domain off
► Range of function: Set f(A) = {fix) : x EA} is kpown as range off

TYPES OF FUNCTIONS
► One-one function (Injective function) : A function f : A ➔ B is defined to be one-one if the images of
distinct elements of A under fare distinct in B._-,.-~• .
j B
•
-\----l--+- Yi.
Xz---i----l.,__-+--Yz ·

► Onto function (Surjective function): Let/: A ➔ B..If every element in B has at least one pre-image in A,
then/ is said to be an onto function or surjective function.

> Many one function : Let f : A ➔ B. If two or more than two elements of set A have the same image in B,
then/is said to be many-one.
f

X2--1- . - -
X3--+---i.,__-+-Y2
X4 Y.
Mathematics I Relations and Functions
3

Into function: Letf: A ➔ B. If there exists an element in B having no pre-image in A, thenfis said to be
an into function.

Xi'- t---1---+- -
X3----+----<-- -+--J3

--f---1---+ -y4
Ys
► Bijective function : If a function is both one-one and onto, then it is called bijective.
or
A function f: A ➔ B is bijective, if
(a) fis one-one, i.e.,J(x) =J(y) ⇒ x =y V x,y EA
(b) fis onto i.e., Vy EB, 3 x eA such thatf(x) =y
► Identity function: Identity function IA on a non-empty set A defined by IA: A ➔ A, IA(x) = x, V x EA.
This is clearly a one-one function with domain A and range A.

COMPOSI TION OF FUNCTION S AND INVERTIBLE FUNCTION

► Composition of functions : Letf: A ➔ B and g: B ➔ C be two functions
of non-empty sets A, B, C, then gof : A ➔ C is called compositio n of
J and g defined as gof (x) = g{/\x)} V x EA.
gof
► Inverse function : Inverse of a function f : A ➔ B defined byf- 1 : B ➔ A
:. f-l(y) = X ¢:> j(x) =y
Points to Remember
► The number of functions from a finite set A into set B = [n(B)][n(A))
► There may exist some elements in set B which are not the images of any element in set A.

► If x1 * x2 ⇒ J(x 1) *fix2), for every xi, x2 E domain, thenfis one-one.

► IfJ(x1) =fix2) ⇒ x1 = x2, for every xi, x2 E domain, thenfis one-one.
► If the range of the function equals to the co-domain of the function, then the function is onto.
► A function f is invertible if and only iff is one-one onto.
► fog'¢ gof,fo(goh) = (fog)oh.
► Iff: A ➔ B, thenfoIA = IB of= j.

BINARY OPERATIONS
► A binary operation * on the set A is a function * : A x A ➔ A. We denote * (a, b) by a * b.
► A binary operation * on the set A is called commutativ e, if a * b = b * a for every a, b E A.
► A binary operation* : Ax A ➔ A is said to be associative if (a* b) * c =a* (b * c), for every a, b, c, EA.
► Given a binary operation * : A x A ➔ A, an element e EA, if it exists, is called identity for the operation *, if
a * e = a = e * a, V a E A.
► Given a binary operation * : A x A ➔ A, with the identity element e in A, an element a EA, is said to be
invertible with respect to the operation *, if there exists an element b in A such that a * b = e = b * a and b is
called the inverse of a and is denoted by a- 1.
 CORNER
A ssessment is complementary part of the learning process. It gives you a total insight whether
learning outcomes have been achieved or not. After going through the corresponding
the
NCERT
Textbook chapter, attempt these questions in exam like environment. Give yourself four
marks for
correct answer and deduct one mark for wrong answer. A table is given at the end, that will
help you
plan your next step.

All the Best! 6

9. Forreal number sxandy , wewrite xRy (=> x - y + ✓ 2

I. If (1 , 3), (2, 5) and (3, 3) are three elemen ts of A x B is an irration al number. Then, the relation R is
and the total numbe r of elemen ts in A x B is 6, then (a) Reflexive (b) Symme tric
the remain ing elemen ts of A x B are (c) Tr~siti ve (d) None of these
(a) (1, 5), (2, 3), (3, 5) (b) (5, 1), (3, 2), (5, 3) l O. Let L denote the set ofall straight lines in a plane. Let a
(c) (1, 5), (2, 3), (5, 3) (d) None of these relation R be defined by aRl3 (=> a ..L 13, a, 13 EL. Then,
2. If R = {(x, y) : x, y E J, ,?- + y2 ~ 4} is a relation in I, R is
then domain of R is (a) Reflexive only (b) Symme tric only
(a) {O, 1, 2} (b) {- 2, - 1, O} (c) Transiti ve only (d) None of these
(c) {-2, -1, 0, 1, 2} (d) None of these l I . Let S be the set of all real number s. Then, the relation
3. If A= {1, 2, 3}, B = {l, 4, 6, 9} and Risa relation from R = {(a, b) : 1 +ab > O} on Sis
A to B defined by 'x is greater than y'. The range of R (a) Reflexive and symme tric but not transitiv e
is (b) Reflexiv e and transitiv e but not symme tric
(a) {1, 4, 6, 9} (c) Symme tric and transitiv e but not reflexive
(b) {4, 6, 9}
(c) {1} (d) Reflexive, transitiv e and symme tric
(d) None of these
Direction (4 - 5) : Let R be a relation on N defined by x + 2y =8. 12. Let R be a relation on the set N be defined by
4. The domain of R is {(x, y) : x,y EN, 2x + y = 41}. Then, R is
(a) Reflexive (b) Symme tric
(a) {2, 4, 8} (b) {2, 4, 6, 8}
(c) Transiti ve (d) None of these
(c) {2, 4, 6} (d) {l , 2, 3, 4}
13. Let R be the relation on the set of all real number s
5. The range of R is
defined by aRb iff la - bl~ 1. Then, R is
(a) {2, 4, 6} (b) {l, 2, 3}
(a) Reflexive and symme tric
(c) {l, 2, 3, 4, 6} (d) None of these
(b) Symme tric only
6. Let R be a relation on N defined by (c) Transiti ve only
R= {(l +x, 1 + x2) : x~5, x EN}. (d) Anti-sy mmetri c only
Which of the followin g is false ?
R
(a) = {(2, 2), (3, 5), (4, 10), (5, 17), (6, 25)} 14 . If R and R' are symme tric relation s (not disjoint ) on
(b) Domain of R = {2, 3, 4, 5, 6} a set A, then the relation R n R' is
(c) Range of R = {2, 5, 10, 17, 26} (a) . Reflexive (b) Symme tric
(c) Transiti ve (d) None of these
(d) None of these
7. The relation R = {(l, 1), (2, 2) (3, 3), (1, 2), (2, 3), (1, 3)} 15. Let A= {l, 2, 3, 4} and R be a relation in A given by
on set A = { 1, 2, 3} is R = {(l, 1), (2, 2), (3, 3), (4, 4), (1, 2), (2, 1), (3, l)}.
.(a) Reflexive but not symme tric Then, R is
(b) Reflexive but not transitiv e (a) Reflexive (b) Transitive
(c) Symme tric and transiti ve (c) An equivalence relation (d) None of these
(d) Neither symme tric nor transitiv e • Which one of the followin g relation s on R is an
8. Let p = {(x, y): ,?- + y2 = 1, x, y ER}. Then &,.,_is equival ence relation ?
(a) Reflexive (b) Symmetric (a) aR1b (=> lal = lbl (b) aR2b (=>a~ b
(c) Transiti ve (d) Anti-sr nmetri c (c) aR3 b (=> a divides b (d) aR,ib (=> a < b
 5
Mathematics I Relations and Functions

l - . Let R and S be two non-void relations on a set A.

Which of the following statement s is false? 26. The domai n of the function
(a) Rand S are transitive => Ru Sis transitive 1
(b) R and S are transitive => R n S ls transitive f(x)=- === ===
✓{sinx} + {sin(7t + x )}
(c) Rand Sare symmetri c =>Ru Sis symmetri c
(d) Rand Sare reflexive => Ru Sis reflexive where {-} denotes fractional part, is
(a) (0, 7t] (b) (2n+l)n /2,nEZ
18. Let R be a relation on the set N of natural numbers (c) (O, n) (d) None of these
denoted by nRm <=> 11 is a factor of rn (i. e. n I m).
Then, R is 27. The range of the function
(a) Reflexive and symmetri c f(x) = ✓(1-cosx)J(l-cosx) ✓O-cosx) ....00 is
(b) Transitive and symmetri c
(a) (0, l] (b) (0, I) (c) [0, 2] (d) (0, 2)
(c) Equivalen ce
(d) Reflexive, transitive but not symmetri c 28. The functionf (x) = .fj sin 2x - cos 2x + 4 is one-
19. Let S = {l, 2, 3, 4, 5} and let A = S x S. Define the one in the interval
relation Ron A as follows: (a, b) R (c, d) iff ad= cb.
(a) [-~,~] (b) [-~,~]
Then, R is
(b) Symmetri c only
(a) Reflexive only
(c) Transitive only (d) Equivalence relation (c) [-~,i] (d) [-1t, n]

20. Let R be the relation "is congruen t to" on the set of

29. Let A = {I, 2, 3} and B = {2, 4, 6, 8}.
all triangles in a plane is
Consider the rule f: A ➔ B,f(x) = 2x r/ x EA. The
(a) Reflexive (b) Symmetri c
domain, co-domai n and range off respectively are
(c) Symmetri c and reflexive
(a) {I, 2, 3}, {2, 4, 6}, {2, 4, 6, 8}
(d) Equivalen ce
(b) {l, 2, 3}, {2, 4, 6, 8}, {2, 4, 6}
21. Let n be a fixed positive integer. Let a relation R be (c) {2, 4, 6, 8}, {2, 4, 6, 7}, {1, 2, 3}
defined in I (the set of all integers) as follows: aRb iff (d) {2, 4, 6}, {2, 4, 6, 8}, {I, 2, 3}
nl(a - b), that is, iff a - bis divisible by n. Then, the
30. Consider the real-value d function satisfying
relation R is
(b) Symmetri c only 2f(sinx) +j(cosx) = x. Then, which of the following
(a) Reflexive only
(c) Transitive only is not true?
(d) An equivalen ce relation (a) Domain off(x) is [-1, 1]
2
22. Total number of equivalence relations defined in the (b) Range of f(x) is [- ; , ; ]
set S = {a, b, c} is
(a) 5 (b) 3! (c) 23 (d) 33 (c) f(x) is one-one (d) None of these

23. Let R be an equivalence relation on ·a finite set A 31. The functionf : R ➔ R defined byf(x) = 6x + 61xl is
having n elements. Then, the number of ordered (a) One-one and onto (b) Many-one and onto
pairs in R is (c) One-one and into (d) Many-one and into
(a) Less than n
32. f: N ➔ Nwheref( x) = x - (-ll, thenfis
(b) Greater than or equal to n
(a) One-one and into (b) Many-one and into
(c) Less than or equal ton
(d) None of these (c) One-one and onto (d) Many-one and onto

24. The relation R is defined on the set of natural 33. Afunction ffromthes etofnatur alnumber stointege rs
1
numbers as {(a, b): a= 2b}. Then, R- is given by n-l when n is odd
(a) {(2, 1), (4, 2), (6, 3),...} 2 is
is defined by f(n) = _ _n '
(b) {(l, 2), (2, 4), (3, 6),...} [
1 when n is even
(c) R- is not defined (d) None of these 2'
(a) one-one but not onto
25. If Risa relation from a set A to the set Band Sis a
(b) onto but not one-one
relation from B to C, then the relation SoR
(a) is from C to A (b) is from A to C (c) one-one and onto both
(c) does not exist (d) None of these (d) neither one-one nor onto
►

6 W\,-t;G- Objective NCERT at your Fingertips

:it Let X = {-1, 0, IL/.= {0, 2} and a functionf: X ➔ y {a) one-one (b) Many-one
defined by y = 2x , 1s (c) Odd (d) Even
(a) one-one onto (b) one-one into
16. The smallest integer functionf(x) = [x] is
1

(c) many-one onto (d) many-one into (b) Many-one

(a) One-one
elxl_e-x (c) Both {a) & (b) (d) None of these
35 _ Letf: R ➔ Rbeafunctiondefinedby f(x) x x, 47. The signum function,!: R ➔ R is given by
then.f{x) is e +e-
1, if x> 0
(a) one-one onto (b) one-one but not onto
(c) onto but not one-one (d) None of these j(x)= 0, if x=0 is
{
J6. Let X = {0, 1, 2, 3} and Y = {-1, 0, 1, 4, 9} and a -1, if X < 0
2 (b) Onto
functionf: X ➔ Y defined by y = x , is (a) One-one
(b) one-one into (c) Many-one (d) None of these
(a) one-one onto
(c) ~any-one onto (d) many-one into 48. The function/: R ➔ R defined by j(x) = 3 - 4x is
2 (a) Onto (b) Not onto
37. Letg(x) = x - 4x - 5, then
(a). g is one-o~e on R (b) g is not one-one on R (c) Not one-one (d) None of these
(c) g is bijective on R (d) None of these 49. Set A has three elements and set B has four elements.
The number of injections that can be defined from
38. Let A= R -{3}, B = R-{l}. Letf: A ➔ B be defined
AtoBis
x-2
by f(x)=- . Then, (a) 144 (b) 12 (c) 24 (d) 64
. x-3
(a) /is bijective (b) fis one-one but not onto SO. The number of bijective functions from set A to
(c) fis onto but not one-one itself when A contains 106 elements is
106
(a) 106 (b) (106) 2 (c) 106! (d) 2
(d) None of these

when N is the set of natural numbers is

(a) one-one and onto (b) onto but not one-one
2
39. The mappingf: N ➔ N given byj(n) = 1 + n , n EN
· ·~ntt1:MMll811
51. If fix) = (ax2 + b)3, then the function g such that
(c) one-one but not onto (d) neither one-one nor onto
J(g(x))= g(J(x)) is given by
3
~O. The functionf: R ➔ R given by fix)= x -1 is 1
(a) a one-one function (b) an onto function (a) g(x)=(b-:1/3) (b) g(x) = 2 3
(d) neitherone-onenoro nto (ax + b)
(c) a bijection

41. Let/: [0, oo) ➔ [0, 2) be defined by f(x)=-,

then/is
2x
l+x
(c) g(x) = (ax'+ b) 113 (d) g(x) = ( x":- b1"
52. Two functions are defined as under
(a) one-one but not onto (b) onto but not one-one
(c) both one-one and onto (d) neitherone-onenoro nto J(x) =
x+l, x$;l
and g(x) =
{x 2
, -l$;x<2
{ 2x+l, l<x:5;2 x+2, 2$;x:5;3
42. If N be the set of all natural numbers, consider
then (fog)(x) equals
f :N ➔ N such thatf(x) = 2x, V x E N, thenfis
(a) one-one onto (b) one-one into (a) {x 2
+ 1, Ix Is; 1 (b) {x 2
+ 1, Ix I$ l
(c) many-one onto (d) None of these 2x + 1, 1 < x s; ✓
2
2 2x + 1, 1 s; x < ✓
2
2
43 - Let A= {x: -1::;; x ::;; l} andf: A ➔ A is a function
x2 +1, lxl>l
defined by fix)= x lxl thenf is (c) ~ (d) None of these
{ 2x2 + 1, Ix I~ v2
(a) a bijection
(b) injection but not surjection 53. Iff : R ➔ R, g: R ➔ R and h : R ➔ R is such that
j(x) =x , g(x) =tan x and h(x) =log x, then the value
2
(c) surjection but not injection
(d) neither injection nor surjection
3 of [ho(gof)] (x), if x = ✓n will be
-1-1. Let/: R ➔ R be a function defined by j(x) = x + 4, 2
then/ is (a) 0 (b) 1 (c) -1 (d) 10
(a) injective . (b) surjective 54. Iff: R ➔ R and g: R ➔ R defined by j(x) = 2x + 3
(c) bijective (d) none of these 2
and g(x) = x + 7, then the value of x for which
45
· !he functionf: A ➔ B defined by j(x) = 4x + 7, x ER j(g(x)) = 25 is
IS (a) ±1 (b) ±2 (c) ±3 (d) ±4
 -
Mathematics I Relations and Functions 7
::>.:- Let f and g be functions from R to R defined as
3x+2
2 64. If J(x) =- - , then u:,I\( ).
vo1 , x ts
7x +x - 8, x S I { Ix I, x < - 3 Sx-3
f(x)= 4x+5,l<xS7 andg(x) = o, -3Sx< 2 (a) x (b) -x (c) f(x) (d) -f(x)
{
Sx + 3, x >7 x2 + 4, x 2: 2 65. If f(x) = (ax2 - b) 3, then the function g such that
Then, f{g(x)} = glfix)) is given by
(a) (fog) (-3) = 8 (b) (fog) (9) = 683
b- xl/3 )112 l
(c) (gof) (O) = - 8 (d) (goj) (6) = 427 (a) g(x) = ( - - (b) g(x) = 2 3
a (ax +b)
56. Let g : R ➔ R be given by g(x) = 3 + 4x. If l(x)
= gogo....og(x) andg''(x) =A+ Bx, then A and Bare . 113
(xl/3 + b y12
(c) g(x)=(ax2+b) (d) g(x)= a )
(a) 2 11 + 1 -1,211 + 1 (b) 4 11 -1,411
1
(c) 3 11, 3 11 + l (d) None of these 66. Iff: [1 , oo) ➔ [2, 00) is given by J(x)=x+-, then
57. Letthefunctionsf,g,haredefinedfromRtoRsuchthat f- 1(x) equals x

j{x) = 2- - 1, g(x) = ✓x 2 + l and

(a)
x+ ✓x2 -4 (b)
X

0, if X <0 2 l+x2
h(x) = . , then ho(fog)(x) is defined by
{ x, if x>O x-✓x 2 -4
(c) - - - (d) l+'J'x~ -4
ri--
(a) X (b) 2- 2
(c) 0 (d) None of these 67. Letf(x) = x2- x + 1, x ~.!.. , then the solution of the
2
58. Iff: R ➔ R is given by equation f(x) =J-1(x) is
-1, when x is rational (a) x = 1 (b) x =2
f(x)= { 1, w h en x 1s
· rrrat10n
· · al, l
(c) X =- (d) None of these
2
then (!of) (1 - .Ji) is equal to 68. Which one of the following function is not
(a) 1 (b) -1 (c) ✓3 (d) 0 invertible?
3 (a) f: R ➔ R,f(x) = 3x + 1
l+x) 3x+x
59 . Given f(x)=log ( - and g(x)= , then (b) f: R ➔ [O, oo),f(x) = 2-
1-x 1+3x2
fog(x) equals + +
(c) f: R ➔ R, 1
j(x)=
(a) -j{x) (b) 3/(x) 3X
(c) [ftx)] 3 (d) None of these (d) None of these
. lOx-10-x.
60. Let j{x) = -ax- , x,;: -1. Then value of the constant a 69. The inverse of the function y =- - - - 1s
lOx +10-x
x+l
such thatf(f(x)) =xis
(a) log1o(2 - x) (b) .!..1og1o(l+x)
(a) ✓ 2 (b) -✓ 2 (c) 1 (d) -1 2 1-x
x-1
61. Let f(x) = - , then f(f(x)) is 1
x+l (c) -log 10 (2x-l) (d) .!.log(~)
1 1 1 2 4 2-x
1
(a) - (b) - - (c) - (d)
X X x+l x-1 70. Consider f: R+ ➔ (4, 00) given byf (x) = x 2 + 4. lffix)
+
is invertible, then find the inverse off (x), where R
62. If f(x)=I-;, then 1(1(;)}s is the set of all non-negative real numbers.

1 1 X 1 (a) ✓y-4 (b) .Jx+4 (c) .Jx-4 (d) {y+4

(a) - (b) - (c) - (d)
X l+x x-1 x-1

63. If f: R ➔ R, g: R ➔ R and h : R ➔ R are such that

f(x) = x2, g(x) =tan x and h(x) =log x, then the value
of (go(foh)) (x), if x = 1 will be
(a) O (b) 1 (c) -1 (d) 7t
8 WutG- Objective NCERT at your Fingertips

_, Consider the function fin A= R - { 1} defined as

79 If the binary operation -+ on the set of integers Z. is
defined by a * b = a + Jb2 , the n find the value of
4x + 3 . Find f - 1.
f(x)=-- · 8 * 3.
· 6x-4
(a) 32 (b) 40 (c) 36 (cl) 35
3+4x
(a) (b) 6x - 4 HO. Let * be the binary operation on N gjven by
6x-4 3+4x r, * b = HCF(a, b) whe re, ,1, b E N. Find the value
(c) 3-4x (d) 9+2x of 22 * 4.
6x-4 6x - 4 (a) 1 (b) 2 (c) 3 (d) 4

-, . lffis an invertible function defined as /(x) = 3 x; 4

, HI . Consider the binary operation * on Q defined by
l
thenF 1(x) is
Sx+4 3x+2
a* b = a + 12b + ab for a, b E Q. Find 2 *
3·
(a) Sx + 3 (b) Sx + 4 (c) - - (d) - - (a) 20/3 (b) 4 (c) 18 (d) 16/3
3 3
82. Consider a binary operation * ,.
-~. lff: R ➔ R define 3x?+-
. d b y f (x ) = - 5 1s
. an mverti
. 'bl e on the set {1, 2, 3, 4, 5} given
l 2 3 4 5
l l 1 1 1 l
function, then find f - 1. - by the multiplication table.
2 1 2 1 2 l
Compute (2 * 3) * (4 * 5).
3 1 1 3 1 1
(a) 2x-5 (b) x-5 (a) 1 (b) 2 4 1 2 1 4 1
3 3
(c) 3 (d) 4 5 1 1 1 1 5
(c) (Sx - 2) / 3 (d) (x - 2) / 3
83. If the binary operation * is defined on the set Q+ of
7:-. Letf: R ➔ R, g: R ➔ R be t\vo functions such that
.fix)= 2x - 3, g(x) = x 3 + 5. The function (fogr 1(x)
all positive rational numbers by a * b =-ab.. Then,
4

r (¾ * ½) is equal to
is equal to

x:7 3
3*

(a) ( (b) (x-~ r3 (a) -

3 (b) -
5
(c) -
3 (d) 2_
160 160 10 40
(c) (x;2J3 (d) ( x;7)1/3 84. If a binary operation* is defined by a* b = a2 + b2 + ab+ 1,
then (2 * 3) * 2 is equal to
· BINARY·OPERATIONS (a) 20 (b) 40 (c) 400 .(d) 445
85. If a * b denote the bigger among a and b and if
i 6. Consider the binary operation * on the set {l, 2, 3,
a· b =(a* b) + 3, then 4 ·7 =
4, 5} defined by a* b = min {a, b}. Write operation
(a) 14 (b) 31 (c) 10 (d) 8
table of*
.. 1 2 3 4 5 .. I 2 3 4 5 86. The number of binary operations that can be defined
1 1 I I I I I 5 4 3 2 1 on a set of 2 elements is
(a) 2 I 2 2 3 2 2 1 2 2 2 2 (a) 8 (b) 4 (c) 16 (d) 64
(b)
3 I 2 3 3 2 3 I 2 3 3 3
87. Consider the following statements.
4 I 2 3 3 4 4 I 2 3 4 4
5 I 2 3 4 5 5 I 2 3 4 5
(i) * defined by a * b = a+ b is a binary operation on Z
.. I 2 3 4 5 .. I 2 3 4 5
2
I I I I I I I I I 1 I 1 (ii) * defined by a* b = a+ b is a binary operation on Q
(c) 2 I 2 2 2 2 2 2 2 2 2 1 2
(d)
3 I 2 3 3 3 3 3 2 3 3 I Which of the following option is true?
4
5
I
I
2
2
3 4
3 • s ' 4
5 5 2 .3.
4 2 3 4
4
l
l
(a) (i) only
(c) Both (i) & (ii)
(b) (ii) only
' (d) Neither (i) nor (ii)
... 7· Let • be a g1aary operation on set of integers I, defined 88. Let * be a binary operatio n on Q, defined by
by a• b ~ + b - '3, then find the value of 3 * 4.
(a) 2 (b) 4 (c) 7 (d) 6 a * b = 3ab . Then * is
7 5
~- If * is a binary operation on set of integers I defined
(a) Commutative (b) Associative
by a • b = 3a + 4b - 2, then find the value of 4 * 5. (c) Both (a) and (b) (d) None of these
(a) 35 (b) 30 (c) 25 (d) 29
Mathematics I Relations and Functions
9
89. A binary operatio n * on the set {0, 1, 2, 3, 4, 5} is (a) not associative (b) not commutative
defined as
(c) commut ative (d) both (a) and (b)
a*b= {a+ b, if a+ b < 6 9 5. The binary operatio n * defined on set R, given by
a + b - 6, if a + l, ;?: 6
Find the identity element.
a * b = a + b for all a, b ER is
2
(a) 0 (b) 1 (c) 2 (d) 3 (a) commut ative (b) associative
90. Conside r the binary operatio ns*: Rx R ➔ Rand (c) Both (a) and (b) (d) None of these
o: Rx R ➔ R defined as a * b = la - bl and aob = a. 96. Let A = N x N and * be the binary operation on A
Which of the following is true? defined by (a, b) * (c, d) =(a+ c, b + d) . Then* is
(a) * is commut ative as well as associative (a) commut ative (b) associative
(b) o is commut ative as well as associative (c) Both (a) and (b) (d) None of these
(c) * is commut ative and o is associative
97 . Find the identity element in the set I' of all positive
(d) * is associative and o is commut ative
' integers defined by a * b = a + b for all a, b EI'. ·
91. Let* be a binary operatio n on set Q of rational (a) 1 (b) 2 (c) 3 (d) 0
number s defined as ~ * b = ab . Write the identity 98. Let* be a binary operatio n on set Q- {1} defined by
for~ 5
a * b = a + b - ab; a, b E Q - {1}
(a) 5 (b) 3 (c) 1 (d) 6 Then * is
92. On Q+, all positive rational numbers , defined by (a) Commu tative (b) Associative
ab (c) Both (a) and (b) (d) None of these
a*b =4 . Find the identity element.
99. The binary operatio n * defined on N by
(a) 2 (b) 5 (c) 4 (d) 1 a * b = a + b + ab for all a, b EN is
93. On Q - {1} such that a * b = a + b - ab. Find the (a) commut ative only (b) associative only
identity element . (c) both commut ative and associative
(a) 0 (b) 3 (c) 4 (d) 2 (d) none of these
94. For binary operatio n* defined on R - {1} such that 100. The number of commut ative binary operations that
a can be defined on a set of 2 element s is
a*b = -- is
b+l (a) 8 (b) 6 (c) 4 (d) 2

Check your score! If your score is

r~ £_10
EXCELLENT ! - Move on to the next chapter. You mastered this chapter. Concepts are on your
fingertips.
[ 90-81 % ] VERY GOOD ! - l!llfl~ r this chapter.
[§%l GOOD! after 1Odays

[70T1%_ ] MEDIOCRE !
I ~ 0°";.""l NOT SATISFACTORY!
 OT HIGHER ORDER THINKING SKILLS

J. Match the follow ing. (i) (ii) (iii) (iv)

Column I Colum n II (a) F F T F
(b) T F F F
(x - 7)3], (p) .Jx- 6-3
(i) Iff(x) =1 [4
-
(c) F T F F
thenf (x) = 2
(d) T T T F

(ii) Let/: 2, 3 ➔ [O, 4) (q) sm

[ n 2n] X -2) +-
. -1 ( - 7C
Fill in the blanks .
- 4.
2 6
be a functi on define d as (i) Letf: R ➔ R such thatf{ x- f(y)} = f{f(y)} + xf(y)
f(_x) = ✓ 3sinx-cosx+ 2. + f(x)- l\ix, yE R. Then theval ueofl{ f(16)} 1 is
1
Toen ,f (x) is given by p .
(r) 7 + (4 - x) 113 (ii) Iff = {(1, 2), (3, 5), (4, 1)} andg = {(2, 3), (5, 1),
(iii) Toe invers e of
2
f(x) = 4x + 12x + 15 is I (1, 3)}, theng of = _Q_ .

(a) (i) ➔ (p), (ii) ➔ (r), (iii) ➔ (q) (iii) Iff : R ➔ R be define d by f(x)= ~ • then
(b) (i) ➔ (r), (ii) ➔ (p), (iii) ➔ (q) (fofoj)(x) =_!L_ . l+x
(c) (i) ➔ (q), (ii) ➔ (r), (iii) ➔ (p) p Q R
/ (d) (i) ➔ (r), (ii) ➔ (q), (iii) ➔ (p) X
(a) 126 (1, 2), (2, 1), (1, 3)
2. Let The the set of all triang les in a plane and a relatio n
Ron T be define d by xRy <=>xi s simila r toy i.e.,
✓x 2 +3
1
R = {(x, y); x is simila r to y}. Show that R ~s an (1, 4), (3, 1), (4, 3)
equivalence relatio n on T. Consi qer three right
(b) 128
✓3x 2
+1
angled triang les : x with sides 3, 4, 5; y with sides x2
5, 12, 13 and z with sides 6, 8, 10; -which triang les (c) 125 (-2,5) ,(5,2) , (1, 5)
among x, y and z are relate d? ✓x 2 +3
(a) x and y 1 (b) y and z X
(d) 127 (1, 3), (3, 1), (4, 3)
(c) xand z (d) Both (a) and (b) ✓3x 2 +1
3 s. Whic h of the follow ing statem ents is/are true?
- State T for true and F for false.
Let A = Q x Q, where Q is the set ofrati onal numb ers,
(i) Let R = {(3, 1), (1, 3), (3, 3)} be a relatio n define d
on the set A = {l, 2, 3}. Then R is symm etric,
transitive but not reflex ive. and* bea binary operation on A define d by(a? b) * (c, d)
(ii) If A ={O, 1} and N be the set of natura l numb ers.
= (ac, b + ad) for all (a, b), (c, d) E A, then
Then, the mapp ing f: N ➔ A define d by Statement-I : The identi ty eleme nt of* in A is (0, 1).
j(2n - 1) = 0,f(2n ) = 1, Vne N , is onto. Statement-II: Invers e of eleme nts of A exists.
(a) Only Statem ent-I
(iii)The relatio n R on the set A = {l, 2, 3} define d
as R = {(l, 1), (1, 2), (2, 1), (3, 3)} is reflexive, (b) Only Statem ent-II

symm etric and transi tive. (c) Both Statem ent-I and Statem ent-II
(iv)A binary opera tion on a set has alway s the (d)_Neith er Statem ent-I nor Statem ent-II _ __
_ _ _ _ __ _ _ _ _ __
identit y eleme nt. _ __ _ _ _ _ _ _ __j__ _
 CE EXE MPLAR PROBLEMS

.1. Let T be the set of all triangles in the Euclidean (a) 720 (b) 120
plane, and let a relation R on T be defined as aRb if (c) 0 (d) none of these
a is congruen t to b V a, b E T. Then R is
(a) reflexive but not transitive 9. Let A = {1, 2, 3, .... n} and B = {a, b}. Then the number
(b) transitive but not symmetric of surjections from A into B is
(c) equivalence (a) np2 (b) 2n-2
(d) None of these (c) 2n - 1 (d) none of these
]I Consider the non-empt y set consisting of children 1
in a family and a relation R defined as aRb if a is 10. Let/: R ➔ R be defined by f(x) =- v' xe R. Then
.lS X
brother of b. Then R is !
(a) symmetri c but not transitive (a) one-one (b) onto
(b) transitive but not symmetri c (c) bijective (d) /is not de.fined
(c) neither symmetri c nor transitive 11. Let f : R ➔ R be defined by f
(x) = 3x2 - 5 and
( d) both symmetri c and transitive
g : R ➔ Rbyg(x) = _ x _ _Thengof (x)is
3. The maximum number of equivalence relations on x2 +1
the set A = {1, 2, 3} are
2
(a) 1 (b) 2 (a) 3x -s (b) 3x 2 -s
(c) 3 (d) s 9x4 - 30x2 +26 9x 4 -6x2 +26
4. If a relation R on the set {l, 2, 3} be defined by
R = {(l, 2)}, then R is 3x2 3x2
(c) (d)
(a) reflexive (b) transitive x4 +2.x2·- 4 9x4 +30x2 - 2
(c) symmetric (d) None of these
12. Which of the following functions from Z into Z are
5. Let us define a relation R in Ras aRb if a;?: 'b. Then R bijective?
is (a) f(x) = x 3 (b) f(x) =x+2
(a)~_an_equivalence relation (c) ,f(x) = 2x·+ 1 (d) j(x) = x2 + 1
(b ) reflexive, transitive but' not symmetric
(c) symmetri c, transitive but not reflexive 13. Let/: R ➔ R be the function defined by
(d) neither transitive nor reflexive but symmetric f(x) = x 3 + 5. Thenf-1 (x ) is
1 1
6. Let A= {l, 2, 3} and consider the relation'
(a) (x+S) 3 (b) (x-5) 3
R = {(l, 1), (2, 2), (3, 3), ,(1, 2), (2, 3), (1, 3)}.
Then Ris 1
(a) reflexive but not symmetric' (c) (5 - x)3 (d) 5 - x
(b) reflexive but not transitive
14. Let/: A ➔ B andg: B ➔ Che the bijective functions.
(c) symmetri c and transitive
(d) neither symmetri c, nor transitive Then (goff 1 is

?,,,t:, The identity element for the binary operation * (a)f- 1 og - 1 (b) f og
(c) g- 1 of- 1 (d) g of
ab
defined on Q - {0} as a * b = V a, b E Q - {0} is
2 15. Letf : R - 3} ➔ R be defined by f(x) = 3x+20 ·
(a) 1 (b) o {5
Then
I (c) 2 (d) None of these
8. If the set A contains 5 elements and the set B contains (a) f - l (x) =f (x ) (b) F 1 (x ) =- f (x)

~l
6 elements, then the number of one-one and onto
(d) J-1 (x) =_!_ J (x)
mappings from A to B is 19
12 W\.-tG- Objective NCERT at your Fingertips
16. Letf: [0, I] ➔ [0, l] be defined by i (a) 1 (b) o
:
(x) = { x, if x is rational . i 7
f 'f . .
1 - x, 1 x 1s irrational
. TI1en (Jo/) x
·
1s j (c)
2
(d) None of these

(a) constant (b) 1 + x ! 19. Let/: R ➔ R be defined by

(c) x (d) None of these 2x :x >3
2
·17. Let/: (2 00) ➔ R be the function defined by j(x) = x : l<x~3
f(x) = x2- 4x + 5, then the range of/is { 3x : x ::;1
(a) R (b) (1, oo)
Thenf(-1) + j(2) +/(4) is
(c) (4, 00) (d) [5, oo)
(a) 9 (b) 14
18. Let/: N ➔ R be the function defined by (c) 5 (d) None of these
2x-1 20. Let/: R ➔ R be given by f(x) = tan x. Then/-1 (1) is
f (x) = - - and g : Q ➔ R be another function
2
(a) 7t (b) {n7t+2:;neZ}
defined by g (x) = x + 2. Then (go/) (~) is · 4 4
(c) does not exist (d) None of these
 ASSERTION
& CORNER
REASON
D irectio ns: In the following questio ns, a statement of assertion (Statem ent-I) is
followed
by a stateme nt ofreaso n (Statem ent-II). Mark the correct choice as:
(a) If b oth Statement-I and Stateme nt-II are true and Stateme nt-II is the correct
explanation
of Stateme nt-I.
(b) If both Statement-I and Statement-II are true but Stateme nt-II is
not the correct
.explana tion of Stateme nt-I.
(c) If Stateme nt-I is true but Statem ent-II is false.
(d) If Statement-I is false and Stateme nt-II is l:!ue.

1. Statem ent-I : The relation Rina set 6. Statement-I: Iff(x) is odd functio n andg(x ) is even
A= {1, 2, 3, 4} defined by R = {(x,y): 3x- y = O} have
functio n, thenj(x ) + g(x) is neither even nor odd.
the domai n= {l, 2, 3, 4} and Range = { 3, 6, 9, 12}.
Statem ent-II : Domai n & Range of the relation (R) , Statement-II :j(-x) = {f(x) ' if f(x)ise ven
is respect ively the set of all first & second entries of \ -f(x) , if f(x)iso dd
the distinc t ordered pair of the relation . ' 7• Statement-I :LetA = {-1, 1, 2, 3} andB = {1,4, 9}, where
2. Statement-I : Let L be the set of all lines in a plane and f : A ➔ B given by j(x) = x2, then f is a many-one
R be the relation s in L defined as R = {(Li, L ): L is functio n.
2 1
perpen dicular to L2}. This relation is not equival ence Statement-II : If x 1 =t:- x2 => f(x1) * f(x2), for every
relation . x 1, x 2 E domain , thenfis one-on e or else many-one.
Statem ent-II: A relation is said to be an equival ence
8. Statement-I : Iff : R ➔ R and g : R ➔ R be two
relation if it is reflexive, symme tric and transiti ve.
mappin gs such thatj(x ) = sin x and g(x) = x2, then
3. Statem ent-I : If the relation R defined in A = {1, 2, 3} fog:;t:gof
by aRb, if la2 -b2I :s; 5, then R- 1 = R
Statement-II: (fog)x =j(x)g(x) = (goj)x
Statem ent-II : For above relation , domain
R- 1 = Range of R. 9. Statement-I:

4. Statem ent-I : A functio n y = j(x) defined by Iff(x) = sin2x + sin2 (x+; ) + cosx · cos(x+ ~)
x2 - coC 1y = n then domain ofj(x) = R.
Statem ent-II : coC 1y E (O, n). and g ( ¼) = 1, then gof (x) is a constant function.
5. Statem ent-I : A functio n f: R ➔ R satisfies the
equati onf(x) -f(y)= x-y, V x,yeRa ndf(3) =2, then Statement-II: gof (x) =j(x) x g(x).
f(xy) = xy - l. 10. Statement-I : f: N ➔ Y be a functio n defined as
Statem ent-II: f(x) = 1(: ),vx e R,x:;t:O and
f(x) = 4x + 3, where y = {ye N : y = 4x + 3 for some
x EN} is invertib le.
7 x 2 +x+l Statement-II : If a functio n is one-on e and onto,
f(2)= 3 if f(x)= x2-x+ l·
then it is a invertib le functio n.
14 'M-t G- Objective NCERT at your Fingertips

I. (a) 2. (c)
: :: a

3. (c)
:i•:••
4. (c)
~= fll~oq
5. (b)
,m~
6. (a) 7. (a) 8. (b) 9. (a) 10.
":J
(b)
11. (a) 12. (d) 13. (a) 14. (b) 15. (a) 16. (a) 17. (a) 18. (d) 19. (d) 20. (d)
21. (d) 22. (a) 23. (b) 24. (b) 25. (b) 26. (d) 27. (c) 28. (c) 29. (b) 30. (d)
31. (d) 32. (c) 33. (c) 34. (c) 35. (d) 36. (b) 37. (b) 38. (a) 39. (c) 40. (c)
41. (a) 42. (b) 43. (a) 44. (c) 45. (a) 46. (b) 47. (c) 48. (a) 49. (c) 50. (c)
51. (d) 52. (a) 53. (a) 54. (b) 55. (b). 56. (b) 57. (b) 58. (b) 59. (b) 60. (d)
61. (b) 62. (c) 63. (a) 64. (a) 65. (d) 66. (a) 67. (a) 68. (d) 69. (b) 70. (c)
71. (b) 72. (a) 73. (c) 74. (a) 75. (d) 76. (c) 77. (c) 78. (b) 79. (d) 80. (b)

.....
81. (a) 82. (a) 83. (a) 84. (d) 85. (c) 86. (c) 87. (b) 88. (c) 89. (a) 90. (c)
91. (a) 92. (c) 93. (a) 94. (d) 95. (a) 96. (c) 97. (d) 98. (c) 99. (c) 100. (d)

C
1. (d) 2. (c) 3. (c) 4. (d)
~~~~
5. (b)
• ~:: ::
1. (c) 2. (b) 3. (d) 4. (b) 5. (b) 6. (a) 7. (c) 8. (c) 9. (b) 10. (d)
11. (a) 12. (b) 13. (b) 14. (a) 15. (a) 16. (c) 17. (b) 18. (d) 19. (a) 20. (b)

1. (a) 2. (a) 3. (b) 4. (d) 5. (b) 6. (a) 7. (a) 8. (c) 9. (c) 10. (a)

is an irrational n umber => xRx for all x. So, R is reflexive.

&&= *Wm@Mi!a Symmetric : R is not symmetric, because ✓ 2 RI but
1. (a): A = {l, 2,3}, B = {3,5}
1;(✓ 2.
A x B = {(I, 3), (1, 5), (2, 3), (2, 5), (3, 3), (3, 5)}
Transitive : R is not transitive also, because ✓2 R l and
2. (c) : Given ,R = {(x,y) : x,yE J, .x2-+/s;4} 1R2 ✓ 2 but ✓ 2;( 2 ✓ 2.
= {(0, 0), (0, - 1), (0, 1), (0, - 2) ... (-2, 0)}
Domain of R = {x : (x, y) E .R} = {- 2, - 1, 0, 1, 2} 10. (b): Given, aR~<:=>a ..L B : . a ..L~ <:=>~ .l a=>~Ra
Hence, R is symmetric.
3. (c): Here, R = {(2, 1), (3, l)} :. Range of R = {l }
11. (a): Reflexive : As 1 +a · a= 1 + a2 > 0, a ES.
4. (c) : Given,R={(x,y) : x + 2y = 8,x,y E N} (a, a) ER :. R is reflexive.
R = {(2, 3), (4, 2), (6, l)} Symmetric : (a, b) ER => 1 +ab> 0
Domain of R = {x: (x, y) E R} = {2, 4, 6} => 1 + ba > 0 => (b, a) ER. :. R is symmetric.
5. (b): Range of R = {y : (x,y)E R} = {l, 2, 3} Transitive : (a, b) E Rand (b, c) E R need not imply (a, c) ER.
Hence, R is not transitive.
6. (a): R = {(2, 2), (3, 5), (4, 10), (5, 17), (6, 26)}
Domain of R = {x: (x, y) E R} = {2, 3, 4, 5, 6} 12. (d ): R = {(x,y): x,y EN, 2x + y = 41}
and range of R = {y : (x,y) ER} = {2, 5, 10, 17, 26} , Reflexive : ( 1, 1) e R as 2 · 1 + 1 =3 ;t: 41. So, R is not reflexive.
Symmetric: (1 , 39) ER but (39, 1) e R. So R is not symmetric.
7. (a) : Reflexive : (1 , 1), (2, 2), (3, 3) E R, R is reflexive
Transitive : (20, 1) ER and (1, 39) ER. But (20, 39)e:R, so
Symmetric : (1 , 2) E R but (2, 1) e: R, R is not symmetric.
R is not transitive.
Transitive : (1 , 2) ER and (2, 3) E R => (1, 3) E R, R is
transitive. 13. (a) : Reflexive : la- al =0 < 1 : . aRa 'r;/ a ER
:. R is reflexive. -)
8. (b) : The relation is not reflexive and transitive but it
Symmetric : aRb => la- bl s; 1 => lb- al s; 1 => bRa
is symmetric, because
: . R is symm etric.
x2+/ = l => /+.x2- =l
Anti-symmetric : 1 R and .!. !
R 1 but ;t: 1 !
9. (a) : Reflexive : For any x ER, we have x-x+ ✓ 2 = ✓2 2 2 2
-q
·--1 I

rI
1 Mathematics I Relations and Functions 15
11 I; .·. R is not anti-symmetric. b - a = (-k) n where -k EI and so bRa.
t.
,I
Transitive: lR2 and 2R3 but l,R3 [·: II - 31 = 2 > l] · :. R is symmetric.
:. R is not transitive. Transitive : Let aRb and bRc. Then, by definition of R, we
II ! . I.
I 14. (b) : Given R and R' are not disjoint, so there is have, a - b = kin and b- c = k2n, where ki, k2 E I.
atleast one ordered pair, say, (a, b) E Rn R'. Then it follows that
i' . . => (a, b) ER and (a, b) ER'. a - c = (a - b) + (b - c) =kin+ k2n = (ki + k2)n, where
I
As R and R' are symmetric relations, we get ki + k2 E I and so aRc. :. R is transitive.
(b, a) E Rand (b, a) E R' => (b, a) E Rn R' Hence, R is an equivalence relation.
.I:Ii Hence, R n R' is symmetric. 22. (a): The smallest equivalence relation is the identity
15. (a): Reflexive: (1, I), (2, 2), (3, 3), (4, 4) ER; relation Ri = {(a, a), (b, b), (c, c)}
i· I Then, two ordered pairs of two distinct elements can be
R is reflexive.
I//'I
I.. 16. (a): (i) Reflexive: a ER, aRia => lal = lal
added to give three more equivalence relations
R2 = {(a, a), (b, b), (c, c), (a, b), (b, a)}
(ii) Symmetric : a, b ER
,.J aRib => lal = lbl => lbl = lal => bRia
Similarly R3 and R4.
Finally, the largest equivalence relation, that is the
I
(iii) Transitive : a, b, c ER
I universal relation
aRib=> lal=lbl,bRic => lbl=lcl . So,lal=lcl => aR1c Rs = {(a, a), (b, b), (c, c), (a, b), (b, a), (a, c), (c, a),
=> Riis an equivalence relation on R. (b, c), (c, b)}.
17. (a): Let A = {l, 2, 3}, -and let R = {(1, 1),(1, 2)}, 23. (b) : As R is an equivalence relation on set A.
S = {(2, 2), (2, 3)} be transitive relation on A. Hence, R has atleast n ordered pairs.
Then, Ru S = {(l, 1), (1, 2), (2, 2), (2, 3)}. 24. (b): R = {(2, 1), (4, 2), (6, 3) ...}
Ru Sis not transitive, since (1, 2) E Ru Sand So, R- 1 = {(l, 2), (2, 4), (3, 6), ....}
(2, 3) E Ru S but (1, 3) i: Ru S.
25. (b): Given, R ~Ax Band S ~Bx C, we have
18. (d): Reflexive : n I n for all n EN=> R is reflexive. SoR~Ax C
Symmetric : 2 I 6 but 6 I 2 => R is not symmetric. SoR is a relation from A to C.
Transitive : Let nRm and mRp => n I m and m IP
=> n Ip => nRp. So, R is transitive. 1
26. (d): j(x)=-;=======
19. (d): Given that S = {l, 2, 3, 4, 5} and A= S x S ✓{sinx} + {sin(1t + x)}
(i) Reflexive: ab= ba ·⇒ (a, b) R (a, b) 'r;/ a, b ES. 1
=---;:::======
(ii) Symmetric: (a, b) R (c, d) => ad= cb => cb = ad ✓{sinx} +{(-sinx)}
! => (c, d) R (a, b) 'r;f a, b, c, d ES. O, sin x is integer
I (iii) Transitive: (a, b) R (c, d) and (c, d) R (e,f) Now, {sinx} + {-sinx} = { . . .
1, smx 1s not mteger
.I => ad = cb and cf= ed => adcf = cbed
=> ~d (af) = cd (be) => af = eb For fix) to be defined, {sinx} + {-sinx} * 0
=> (a, b) R (e,j) Va, b, c, d, e,f ES. => sinx * integer => sinx-:;:. ± 1, 0
Hence, R is an equivalence relation. n1t
=> x:t,-
1 20. (d) : te(s denote tpe set of all triangles in a plane. Let
R be the relation on S defined by (d1, d 2) E R => triangle Hence, do~ain is R
. -{n1t2 ' n 1} .
E
r d1 :d2, ,
I
(i) Let any triang~e d E S, we have 27. (c) : Given, f (x) = ✓1
(1---co-s-x)~✓;=(l=-=co=s=x)=.j=;:(l=-=,=os=x)=...00
=
d = d => (d, d) E R V d E S => R is reflexive on S.
( (ii) Let d1, .12 E S, such that (d1, d2) E R, then = (1- cosx)112 (1- cosx)1'4 (1- cosx)118 ....... ,oo
d1 :d2 => d2:d1 => (d2,d1) ER=> Rissymmetric 1- 1 1 1/2
(iii) Again, let d1, d2, d3 E S such that (d1, d2) E Rand -+-+-+ ........ 00 11/2
=(1-cosx) 2 4 8 =(1-cosx) - =1-cosx
(d2, d3) E R :: di= d2 = A3 :. (d1, d3) E R
=> Range ofj{x) is [O, 2].
=> R is transitive.
R is an equivalence relation.
28. (c) : fix)= 2 sin(2x-~ )+4
21. (d) : Reflexive : Since for any integer a, we have a - a = 0
is divisible by n. Hence, aRa Va EI.
is
.·. R Retlex,ive. .
. .
sm x 1s one-one m - . [ 7t ,27t]
Symmetric : Let ,aRb. Then, by definition of R,
2
a - b = nk, where k EI.
:. - ; S2x-;,; ~ ~ xe,[-;.;]
t
 16 ~tG- Objective NCERT at your Fingertips
29, (b): Given,ftx) = 2x, V x EA
0, x~0
Value of function at x = I,ftl) = 2(1) = 2
value of function at x = 2,ft2) = 2(2) = 4 f(x) = ex -e-x'
{ x>O
value of function at x = 3,ft3) = 2(3) = 6 ex +e-x
Domain off= {l, 2, 3) => J(x) is many one.
Co-domain off= {2, 4, 6, 8} e2x -1 2
Range of/= {2, 4, 6} Forx>O, J(x)=-- =l---
e2x +l e2x +l
30. (d): Given, 2J{sinx) +ficosx) = x ... (i) f(x) E (-oo, oo), Range off(x) E [O, 1)
1t => J(x) is into. So,J(x) is many one into.
Replace x by
2- x, w_e have
36. (b): y(0) = 0, y(I) = 1, y(2) = 4, y(3) = 9. No two
2/(cosx)+ f(sinx)= 1t -x ...(ii) different values of x (where x EX) gives same image. Also
2 -1 is element of set Y, which does not have its pre-image
Eliminatingftcosx) from (i) and (ii), we have in set X. So, function is one-one into.
1t
f(sinx ) =x-- => f( x ) =sm 7t
. -1 x-- 37. (b) : Letg(x1) =g(x2)
6 6 => x 12 -4x1 -5=x22 -4x2 -5
Then, domamofJtx) is [-1, l] => xf-x~ =4(x1 -x2 )
Ranoeis 1t 7t 1t 7t] => (xi .- x2Hx1 + x2 - 4) = 0
_..,_ __ - - - or
0 [ 2 6'2 6 Either X1 = X2 or X1 + X2 = 4
Also,ftx) is ohe-one. Either x1 = x2 or xi = 4 - x2
31. (d) : 6x > 0, 61xl > 0 for all x ER. :. There are two values of x1, for which g(x1) = g(x2),
So, f is into: For different values of x, 6x and 6Jxl are :. g(x) is not one-one V x E R
different positive numbers. Clearly,/ is many-one. 38. (a) : Let x and y be two arbitrary elements in A.

x - 1, x is even Then,Jtx) = f(y) => x-2 = y-2

32. (c) : f(x)= . , x-3 y-3
{ x+l, xis odd => xy-3x-2y+6 =xy-3y-2x+ 6 => x=y, Vx,yEA
which is clearly one-one and onto. So,f is an injective mapping.
Again, let y be an arbitrary element in B, then j{x) = y
n-l, when n is odd x-2 3y-2
33. (c): Given that, f(n)= t
{ --, when n is even
=> --=y => x=--
x-3 y-1
2 3 2
andf: N ➔ I, where N is the set of natural numbers and Clearly, Vy EB, x = y- EA, thus of all y e B, there
y-1
I is the set of integers.
3y-2 -2
Let x, y EN and both are even.
Then,ftx) = fly) => - =-
X y
=> x = Y
exists x EA such that f(x)= t(Jy-
y-1
2
)= 3y-2
y-l =y
2 2 -3
Again, x, y EN and both are odd. y-1
Thenfix)=fty) => x-l=y-1 => x=y Thus, every element in the co-domain B has its
2 2 pre-image in A, so f is a surjective. Hence, f: A ➔ B is
So, mapping is one-one. bijective.
Since, each negative integer is an image of even natural 39. (c) : Since,J(n) = 1 + ,i2
number and positive integer is an image of odd natural
number. So, mapping is onto. Hence, mapping is one-one
nf
For one-one, 1+ =1+ ~
2 2
and onto. => n1 -rii=O =>n1=n2 (·:n 1 +n2i:O)
34. (c) : We have, y = 2x4 :. fin) is one-one.
:. y(-1) =y(l) =2, y(0) =0 (many-one onto) Clearly,J(n) is not onto.
Here, we see that for two different values of x, we will get 40. (c) : Given,J(x) = x3 - 1. Let x 1, x2E R.
is
a same image and no element of y left, which do not Now,f(x1) = f{x2) => xt - 1 = x~ - 1 => x 1 = x2
have pre-image. So, function is many-one onto. :. J(x) is one-one. Also, it is onto.
elxl _e-x Hence, it is a bijection.
35 · (d): f: R ➔ R such that f(x) = - .-- 2x
ex +e-x 41. (a): We have,y = -
x+l
I
I
~
 Mathematics I Relations and Functions
17
⇒ 2x = yx + y ⇒ x = _y_ I 4p - 41
=4x3x2x l =24.
2-y i 3- (4-3)1
Now,xE [0,oo) ⇒ 0:5y<2
so. (c) : The total number of bijections from a set
⇒ Range offt.x) = [O, 2)
I containing n elements to itself is n!
Since range c co-domain
⇒ fis into. Clearly,fis one-one also.
I Hence, required number= (106)!
i 5 1. (d): y= fix)= (ax2 + b) 3 => ax2 + b = y113
42. (b) : Let x 1, x2 EN, then fl.x 1) = Jtx2)
⇒ X1 = x2, So,ft.x) is one-one. i yl/3 -b ( 1/3 b )1/2
I => x2 = a => x = y a -

r
= 1-1(y)
Let y = 2x ⇒ x = l Ii: N . Thus,/ is into.
2
Hence,ft.x) is one-one into.

x
2
x>o
I Since, J(g(x)) =g(l(x)) : . We have, g(x) =( xv:-b
43. (a): f(x)=xlxl= '
{ -x2 , x<O
-
I {g(x) + 1, g(x) :5 I
l 52.(a) : (fog) (x) = f(g(x)) = 2g(x) + 1, l < g(x) :5 2
The graph shows fix) is y i Now, g(x) :5 I
one- one, as any straight line y=x2 ' 2
! (i) x :51,-l:5x<2 ⇒ lxl:51,-l:5x<2 =>lxl:51
parallel to x-axis cuts only at ! (ii) x+2:51,2:5x:53= >x:5-l,2:5x:53 => x=~
one point. x j Now, consider 1 < g(x) :5 2
Here, range offt.x) E [-1, l]. i (iii)" 1 < x2 :5 2, -1 :5 X < 2
Thus range = co-domain.
! => XE[-✓2,-l)u(I, ✓2],-l:5x<2 => l<x:5 ✓2
Hence,.f{x) is onto.
Therefore fix) is one-one and onto, i.e, bijective.
! (iv) l<x+2:52,2:5x: 53=>-l<x:50,2: 5x:53
! => x=q>
44. (c) : Given fl.x) = x 3 + 4. Let X1, X2 ER
Xi
Now,f(x1) =f (x2) ⇒ xf + 4 = + 4, xf =xf ⇒ x1 =x2
{x
i! So (fog)(x) = f(g(x)) = 2 + 1, Ix I:5 1 r::
:. f (x) is one-one. Also it is onto. i 2x
2
+ 1, 1 < x :5 ..; 2
Hence it is a bijection. : 53. (a)-: [ho(goj)](x) = ho[g(ftx))]
45. (a): We have,.f{x) = 4x + 7, x ER ;! = h[g(x2)~=h[tanx2]=h [tan 1t] =h[l]=logl=O
Let x1, X2 E R, such that fl.xi) = ftx2) 4
+
⇒ 4x1 + 7 = 4x2 7 => 4x1 = 4x2 => X1 = X2 \ 54. (b): j{g(x)) = .f{x2 + 7) = 2(x2 + 7) + 3 = 25 (given)
So, f is one- one. ! => 2x2=8 => x=±2
A f B i
46. (b ): We have, [1.4] = [1.6] = 2 : 55. (b): Wehaveg(-3)=0
: 2
Here, two elements in A, 1.4 and l.4-+--1....._ j => fig(-3)) = .f{O) = 7(0) + 0 - 8 = - 8
1.6 have the same image i.e., 2 in B. i Now,g(9) = 9 + 4 = 85
2

Thus,.f{x) = [x] is a many-one i => j{g(9)) = /(85) = 8 X 85 + 3 = 683

function. ! Also,.f{O) = 7(02) + 0 - 8 = - 8
47. (c) : We have,fil) = fi2) =fi3) = 1 R i => g(f{O)) = g(-8) = l-81 = 8
.f{O) = 0 .
R i Also,.f{6) = 4 x 6 + 5 = 29
j{-1) = j{-2) = f(-3) = -1 1=t.==-~~ i => g(ft6)) = g(29) = (29)2 + 4 = 845
Hence, function f ~s not ~ -4---- i 56. (b): Sinceg(x) = 3 + 4x
one-one, so signum function is
many-one function.
-2
3
-I-:t::::~:?~
:. i_(x) = (gog) (x) = g~x)} = g(3 + 4x) = 3 + 4 (3 + 4x)
or ;?(x) = 15 + 42x = (4 - 1) + 42x
Now /(x) = (gogog)x = g{j(x)}
48. (a) : Let y ER be any real number, such that f(.x) = y 3
= g(l5 + 42x) = 3 + 4 (15 + 42x) = 63 + 43x = (43 - 1) + 4 x
:. y= 3-4x Similarly, we getg"(x) = (4n - 1) + 4nx
3-y
=> 4x=3-y => x=--
4 57. (b) : ho(fog)(x)=hoJ(✓x 2 +I)
3- y
So, for any real number y ER, there exists - - E R such =h{(✓x2 +1)2 -l}=h{x 2}=x2
4
58. (b): (fof)(l- ✓ 3)= /[/(1- ✓3)]= /(1)=-l
that f ( - - =3-4 - -
3 - y) (3-y) =3-3+ y= y
4 4 3
3x+x
Hence, f is onto. l+ - -
3 1+3x2
49. (c) : Since 3 < 4, injective functions from A to Bare 59. (b): /[g(x)]=/[ x+x:]=log
3
defined and the total number of such functions is 1+3x 3x+x
l-- -
1+3x2

~
18 m.tG- Objective NCERT at your Fingertips
3 1
l+x)
==> /(g(x))=log ( - ' =3log (l+x) Hence, the inverse of y is .!..1og 10 ( + x ) .
- ' =3/(x) 2
1-x 1-x a(!!::_) 70. (c): Given that/(x) = x2 + 4
1-x

ax rif(x) x+l Let y = x2 + 4 ⇒ x2 = y - 4 ⇒ x = ✓ y - 4

(d) : fix) = -~- => ft.fix)) = - - -· a.x
60. x+l f(x)+l - +l
:. f- 1 (y) = ✓Y-4 ⇒ f- 1 (x) = ✓x-4
= a2 x =x if a =-1. x +1
(a+l)x+l x-l 2x-7 4y+7
71. (b): Let y= - - ⇒ x= - -
x-1) ~ - l -2 -1 4 2
6 1. (b) : j{.f{x))=J( x+l = x-1 = -2 = J -l(y)= 4y+7 ⇒ f-l(x)= 4x+ 7
. - +l X X
x+l 2 2
4x+3
72. (a) : Let y = - - ⇒ 6xy - 4y = 4x + 3
6x-4
⇒ x = 3+4y :. f-I(x) = 3+4x
1 x 6y-4 6x-4
= /(1-x)=l- 1-x = x-l 3x-4
73. (c): Lety=-- ⇒ Sy= 3x-4
63. (a): (go(Joh)) (x) = goj{h(x)) = goftlog }) S'
= g((logx)2) = (tan(logx)2) = tan(log 1) = 0 ⇒ x = Sy:4 ⇒ 1-l(x)= ~x:4
64. (a): (Jof)(x)=f(J(x)) =JG:~:)
3x+5 2y-5
74. (a): Let y= - - ⇒ 2y=3x+5 ⇒ x =--
3 (3x+2) 2 2 3
Sx-3 + · .:._ 9x+6+10x-6 19x
=~------,-- - ---~=- =x rl( ) 2y-5 f-l( X ) =2x-5
s(3x+2)_ - 15x+l0-15x+9 19 J y =-- ⇒ --
3 . 3 3
Sx-3
75. (d): (fog)x = f(x 3 +·s) = 2(x3 + 5) - 3 = 2x3 + 7
65. (d ) : Refer to Answer 51.
1
66. (a): Lety=J(x)=x+ - ⇒ x2-xy+l=O Let y = <J.og)x = 2x3 + 7 ⇒ X --(y-2 7 )1/3
X

⇒
y±,Jy2-4
x=---- ⇒- (fog)-_1<x)=_( x;7r3
2 .. l 2 3 4 5
·· yE[2,oo) ⇒ xE[l,oo) · . 76. (c): Given binary operation
l l l l l 1
is a* b. = min {a, b} defined on
x+✓x
2 l
2
-4
2 2 2 2
the set {l, 2, 3, 4, 5}. .
Hence, f -1(x ) = - - -- 3 1 2 3 3 3
2 The operation tabl~ for operation 4 1 2 3 4 4
67. (a): Lety=x2-x+l * is given. 5 1 2 3 4 5

1± ✓1-4(1-y) 1 77. (c) : Given binary operation is a * b = 2a + b - 3

⇒ x=--'----- X ;?::- On putting a = 3 and b = 4, we get
2 2 3 * 4 = 2(3) + 4 - 3 = 6 + 4 - 3 = 7
x=.!..+✓y-~
2 4
⇒ f- 1 (x)=.!..+✓x-~
2 4
78. (b) : Given that, a * b = 3a + 4b - 2

Now, x 2 -x+l=-+
1
2
x--
4
R On putting a = 4 and b = 5, we get
4 * 5 = 3(4) + 4(5) - 2 = 12 + 20 - 2 = 30
79. (d): Given that, a* b =a+ 3b 2, Va, b E Z
⇒ x = 1 (By checking the given possibilities) On putting a = 8 and b = 3, we have
68. (d) : All functions are one-one and onto in tqej.r 8 * 3 ·= 8 + 3.32 = 8 + 27 = 35 1

11

domain. Hence all are invertible. ,I

80 . .(b): Given binary operation is a * b = HCF (a, b),
102x -1
. where a, b EN
69. (b) : Since, y = - - ⇒ yl02x + y = 102x - 1 · 22 * 4 = HCF (22, 4) = 2
102x + 1
102x = 1+ Y 1+ Y 81. (a ) : We have, a* b = a+ 12 b + ab V q, b E Q
~ l 2x log 10 10 = log10 -
-y .
~ 1
x=.!..log 10 ( +y)
1-y

( ·: logaa = l)
~~-~~Tt(4~ = ~O
2 1- y 82. (a) : Weliiave'/(~ *-3) = 11 and (4~-SJ = 1
I
£a
 -
Mathematics I Relations and Functions
19
Now, (2 * 3) * (4 * 5) = 1 * 1 = 1. (ii) Associativity:
' I
a* (b * c) =a* I b - c I =I a - I b - c II
83. (a) : Given that a* b = ab Va, b E Q+
(a* b) * c =Ia - bl* c = Ila - bl - cl
4 :. a* (b * c) :/:(a* b) * c Va, b, c E R.

:. 3*( .!.* .!.)= 3*{ lxt} =3• 2_

5 2 4 40
3

4
J xfot2_
160
Hence, * is not associative.
Next we check commutativity and associativity on
operation 'o'. ·
(i) Commutativity : aob = a, V a, b E R
binary

84. (d) : Given bina rl operation is a* b = a2 + b2 +ab+

1 and, boa = b, V a, b E R
(2 * 3) * 2 = {(2) + (3) 2 + (2) (3) + 1} ~- 2
= (4 + 9 + 6 + 1) * 2 =20 * 2 Clearly, aob t: boa, Va, b E R. So, 'o' is not commutativ
e.
(ii) Associativity: ao (hoc)= aob = a
= (20)2 + (2)2 + 20 X 2 + 1
= 400 + 4 + 40 + 1 = 445 Now, (aob) oc = aoc = a
ao (boc) = (aob) oc, Va, b, c, E R. So, o is associative.
85. (c): We have, a* b = Bigger among a and
b .
and a· b =(a* b) + 3 . ab
91. (a) : Given binary operation 1s a * b = .
4·7 = (4 * 7) + 3 = 7 + 3 = 10 {·: 7 is greater
than 4}
Let e be an identity element of* on Q.
5
86. (c): The number of binary operations
on a set ae
2 a*e =at laE Q ⇒ -=a ⇒ e=5
consisting of n elements = n"
5
Required no. of binary oper ation s= 222 = 16 . . .
92. (c) : Given b mary operation 1s a* b = -ab
87. (b) 4
Let e be an identity element. Then, for all a E Q+
3ab
88. (c) : Given binary operation is a* b = - a * e = a ⇒ ae =a ⇒ e = 4 E Q+
, V a, b E Q
5 4
(i) Commutative: To show that *.is commutativ
e, we 93. (a): Given binary-operation is a* .b =a+ b-
show that a *_b = b.* a, V a, b E Q ab
Let e be an identity element.
3ab 3ba
Now ,a*b = -= -= b* a Then, for all a E Q - {l}, a * e = a
5 5 ⇒ a+ e - ae = a ⇒ e (1 - a) = 0
a * b = b * a, V a, b E Q ⇒ e = 0 E Q- {1}
Hence, * is commutative.
a.
(ii) Associative : To show that* is associative
, we show 94. (d): Com mut ativ e:a* b =b+ l andb *a= b
a+l
c)
that a* (b * =(a* b) * c, Va, b,,CE Q
a * b f:: b * a ⇒ * is not commutative.
Associative :
3a (3bc )
Now, a* (b * c) =a* e:c ) = 9
/ - ;:c a ) (~) a
(a* b)*c =( b+l *C= c+l = (b+l )(c+ l)
3 b)
and (a* b) * c = ( : * c=
3
3 ( ab
\
}c) =9abc and a * (b * c) =a* ( -
b ) a -a(c+l)
=( ) = b + c+1
25 c+l ±_ +l
Clearly, a* (b * c) =(a* b) * c, Va, b, c E Q c+l
Hence * is associative. So,( a*b )*c: ta*( b *c).
• 1 02 3 4 5 Hence, * is not associative.
89. (a) : From the table, we note that o b 1 2 3 4 5
a*0 =0* a=a , 1 1 2 3 4 5 0 a+b b+a
95. (a) : Commutative: a*b =-- =-- = b*a
ti a E {0, 1, 2, 3, 4, 5} 2 2 3 4 5 0 1
3 3 4 5 0 1 2
2 2
Hence, 0 is the identity for Hence, * is commutative.
4 4 5 i) 1 2 3 Associative :
operation. 5 5 0 1 2 3 4 ff
90. (c): Given that, *: Rx R ➔ R, and o: Rx
R➔ R
such that a * b = la - bl and aob = a, V a, b E R
=
(i) Commutativity: a * b la - bl, V a, b E R (give
n)
and b *a= lb - al, Va, lJ e ,R
⇒ b *a= I - (a - b) I= la-=bl •
a * b = b * a, V a, b E .R. So, •* is commutative.

l
20 m.tG- Objective NCERT at your Fingertips
(a* b) * c -:t- a* (b * c). Hence,* is not associative. 2. (c) : (i) Every triangle is similar to itself.
96. (c) : Let (a, b), (c, d), (e,f) EA= N x Nbe arbitrary xis similar to x, V x E T. i.e., xRx, V x E T
elements, then So R is reflexive on T.
(a, b) * (c, d) =(a+ c, b + d)= (e + a, d + b) = (c, d) * (a, b) (ii) Let xRy =>xis similar toy => y is similar to x.
and ((a, b) * (c, d)) * (e, f) =(a+ c, b + d) * (e,f) => yRx :. R is symmetric on T.
=((a+ c) + e, (b + d) + f) =(a+ (e + e), b + (d + f)) (iii) Let xRy and yRz =>xis similar toy and y is similar to z
= (a, b) * (c + e, d + f) = (a, b) ~- ((e, d) * (e,f)) => x is similar to z => xRz.
Hence, * is commutative as well as associative. :. R is transitive on T.
Thus R is an equivalence relation on T.
97. (d): Let e be the identity element exist in the set of
Now, since sides of triangles x and y are not proportional
all positive integers w.r.t. * on Y.
therefore x .Ry. But the sides of triangles x and z are
Then, a * e = a\:J a E I" => a +. e = a => e = 0
proportional, therefore x R z. Also y )( z.
98. (c): Commuta tive: Let a, b E Q- {l}
3. (c) : (i) False
a * b = a + b - ab = b + a - ba = b * a
Given that, R = {(3, 1), (1, 3), (3, 3)} be defined on the set II
=> a * b = b * a. Hence * is commutative. I
A= {l, 2, 3}.
Associative: Let a, b, e E Q- {l}
·: (2( 2) e R. Therefore, R is not reflexive.
(a,. b) * e =(a+ b- ab)* e =(a+ b- ab)+ e- (a+ b - ab)e
-->;' / (3, 1) E R, (1, 3) E R. Hence, R is symmetric.
= a + b - ab + c - ae - be + abc
Since, (1, 3) ER, (3, 1) ER but (1, 1) e R
a,. (b * c) =a* (b + e - be)= a+ (b + e - be) - a(b + c - be)
So, R is not transitive.
= a + b + e - be - ab - ae + abe = (a * b) * e
(ii) True
Hence * is associative.
Given, A= {O, l}
99. (c): Commuta tive: Since, f (2n -1) = 0, f (2n) = 1, V n e N
a*·b = a + b + ab = b + a + ba = b * a So, A = Range.
Hence, * is commutative. Hence, the mappingf : N ➔ A is onto.
Associative: (a* b) * e =(a+ b +ab)* e (iii) False
= a + b + ab + e + ac + be + abe Given, R = {(l, 1), (1, 2), (2, 1), (3, 3)}
= a + b + c + be + ab + ae + abe Since, (2, 2) e R
=a+ (b + e + be) + a (b + e + be) Therefore, R is not reflexive.
=a* (b + e + be) =a* (b * e) (iv) False
Hence, * is associative. '+' is a binary operation on the set Nbut it has no identity
element.
100. (d): Required no. of operation s= (2 )2(2- 1)12 = 2
4. (d): (i) Putting x = f(y) = 0, then
j{O) =f{O) + 0 + j{O)- 1 => j(O) = 1
Putting x = j(y) we get,J(O) = J(x) + x2 + J(x) - 1
l. (d): (i) Given, j(x) = [4 - (x- 7)3]
x2
Consider, y = [4 - (x - 7) 3] => (x - 7)3 = 4 - y => j(x) = 1- -
⇒ (x-7)=( 4-y) 113 => x=7+(4 -y) 113 2256
⇒ f 1(x) = 7 + (4 - x) 113 f{l6) = 1 -
2 = 1 - 128 = -127 => lfil6)1 = 127

(ii) fix) = ✓3 sin x - cos x + 2 = 2 sin ( x - ~) + 2 (ii) Given, J= {(l, 2), (3, 5), (4, l)} and
g = {(2, 3), (5, 1), (1, 3)}
Since,f(x) is one one and onto,f is invertible.
Now, goj{l) =g{f{l)} = g(2) = 3
Now.JoF 1(x)=x => 2sin(f- 1(x)-~)+ 2=x goj{3) = g{/{3)} =g(5) = 1
goj{4) = g{/{4)} = g(l) = 3
⇒ 1
sin(J- (x)-~) =1-l
Hence,gof = {(l, 3), (3, 1), (4, 3)}
(iii) Given, f(x) = Q
⇒ 1
r\x)=si n- (1-1)+ ~
l+x 2
Now, (Jofof)(x) = .tlf(f(x)}]
( ·: l(x/2 - 01::; 1 V x e [O, 4))
(iii) Let fix) = y => 4x2 + 12x + 15 = y X

⇒ (2x+3) 2 +6=y => 2x+3= ✓Y-6 11 Ii'

⇒ X= ~ - 3 => rl(x)= ~ - 3 I I\
I
2 2
 Mathematics I Relations and Functions
21
X Similarly R3 and R4.
2 Finally the largest equivalence relation, that is the
=f ( X )- J1 + 2x X

I II
Jl + 2x 2
- x =- ,hx + 1
1+- -
2 2
universal relation.
Rs = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (1, 3), (3, l)
1+2x2 (2, 3), (3, 2)} '
4. (b)
5. (b): Statement-I : Let (c, cl) e A be the identity
element, then 5. (b): Given aRb, a~ b
(a, b) * (c, d) = (a, b) for all (a, b) E A (i) Now a~ a is true for all real no. :. R is reflexive.
⇒ (ac, b + ad) = (a, b) ⇒ ac = a and b +ad= b (ii) Let (a, b)e R, a~ b
⇒ c = 1 (provided a* O) and ad= O⇒ c =1, d =O(a* O) Now a ~ b but does not imply b ~ a.
Also (1, O) * (a, b) = (1 • a, 0 + 1 • b) = (a, b). (b, a)e R : . R is not symmetric.
If a= 0, then (O, b) * (1, O) = (0 · 1, b + O. O) = (0, b) (iii) Let (a, b)e Rand (b, c)e R ⇒ a~ band b ~ c
and (1, O) * (O, b) = (1 · 0, 0 + 1 · b) = (0, b). :. a~ c ⇒ (a, c)e R :. R is transitive.
Thus, the element (1, O) is such that 6. (a ) : (1, 1), (2, 2), (3, 3)e R
(1, 0) * (a, b) = (a, b) = (a, b) * (1, 0) for all (a, b) e A R is reflexive but it is not symmetric.
⇒ (1 , 0) is the identity element of given binary operation
*on A.
ab
7. (c) : a * b = -
Statement-II : Consider any element (a, b) e A . Let 2
(c, d) e A be its inverse then Let e be an identity element of* on Q - {O}.
(a, b) * (c, d) = (1, 0) ⇒ (ac, b + ad) = (1-, 0) a* e = a Va e Q - {O}
ae
⇒ ac = 1 and b + ad= O ⇒ - =a ⇒ e=2
2
1 . b
⇒ c=a (proVIdeda*O) and d=-a· 8. (c) : As A contains 5 elements.
For any one-one onto mappingf: A ➔ B,j(A) also
Also (.!_, -~)*(a, b) =(.!_.a,-~+.!_ -
a a a a a
b) = (1:O). contains 5 elements but B contains 6 elements.
:. f(A) :;;B.
Thus, (a, b) is invertible, provided a,;:. 0 and the inverse of So, no one-one mapping from A to B can be onto.
(a, b) is(.!_,-~). 9. (b ): Iff: A ➔ Bis a function, thef(l) can be chosen
· a a
in two ways,f (2) can be chosen in two ways, . .. ,f(n) can
be chosen in two ways.
Hence,f can be chosen in 2 x 2 x ... x 2 = 2" ways
j,,1' I
In total there are 2" functions possible. Out of these two
~ 1,, r'
I. (c) : (i) We know that every triangle is congruent to
functionsf1 andh, defined asf 1(i) =a V i = 1, 2, ... , n and
1,
itself.
(T1, T1)ER for all T1E T. Thus, R is reflexive. h (i) = b Vi= 1, 2, .. . , n are not surjective as range of/ 1 is
(ii) Let (T1, T2)E R ⇒ Ti is congruent to T2• {a}:;; B andh is {b} c1; B.
⇒ T2 is congruent to Ti , :. (T2, T1)eR Hence, the nwnber of surjections from A to B is 2" - 2.
Thus, R is symmetric. 10. (d ): Since, .!.. is not defined for x = 0
(iii) Let (T1, T2)E Rand (T2, T3)E R. X
⇒ Ti is congruent to T2 and T2 is congruent to T 3. :. f : R ➔ R can not be defined.
Ti is congruent to T3 ⇒ (Ti, T3)ER. 11. ·(a): gof{x) = g(t{x)) = g(3x2 - 5)
Thus, R is transitive. 3x2 -5 3x2 ..'.. 5
:. R is an equivalence relation. =----
(3x2 -5)2 +1 - 9x 4 ·-30x2 +26
2. (b) : Given aRb ⇒ a is brother of b. 3
But b }.{ a [ ·: b may or may not be brother of a] 12. (b ): f{x) = x c~ot be onto as range of
R is not symmetric. f = { ..., -27, -8, -1, o, 1, 8, 27, .. . }* Z
Let aRb and bRc
⇒ a is brother of b and b is brother of c.
a is brother of c ⇒ (a, c)e R. : . R is transitive.
~,= {...,
f{x) = 2x + 1 is also not onto as
-3, -1, 1, 3, ... } * Z
f(x) = x2 + 1 is not one-one as f{x) =f{-x) = x2 + l
And f{x) = x + 2 is one-one as f(x 1) = f{x2 ) ⇒ xi = X2
3. (d) : The smallest equivalence relation is the identity and it is onto also [ ·: Rt= Z}
relation R 1 = {~1, 1),.(2, 2), (3, 3)} Hence,f{x) = (x + 2) is bijective.
Then, two ordered pairs of two distinct elements can be 3
13. (b ): f{x) = x3 +5 ⇒ y=x3 +5 => x =y - 5
added to give three more equivalence relations.
R2 = {(l, 1), (2, 2), (3, 3), (1, 2), (2, I)} ⇒ x= (y - 5)1/3 .•. 1-\x) =- (x- - 5)1/3
22 m.-eG- Objective fKERT at your Fingertips
14. (a) : Let fix)= y and g(y) = z Statement-I and II are true but Statement-II is not the
1
Then,gofix) = g(f{x)) = g(y) = z ⇒ (goJr (z) = X correct explanation of Statement-I.
1 1
Now,fix)=y,g (y)=z ⇒ f - (y)=xandg- (z)=y 4.
1
(cl): Given, x2 - coC y = n
⇒ x -n=coC y ⇒ o<x2-n< n ⇒ n<x2<2n
(rlog- l)z = f - l(g- l(z)) = f-l(y) = X 2 1

(go/fl= (f-log-1) rr,)u(✓ rr,,&)

==> XE (-&,- ✓
3x+2 2+3y ⇒ Statement-I is false ,but statement-II is true.
15. (a ) : Let fix) = y = - - ⇒ X=--
5x- 3 Sy-3 5. (b)
:. 1 - 1(x)= 2+3x =fix) 6. (a) : ·: j(x) is odd ⇒ f(-x) = -f (x)
Sx-3 and g(x) is even ⇒ g(-x) = g(x) II
16. (c): Case-I : When xe rational Let F(x) = f (x) + g(x)
we have fix)= x ⇒ fofix) = fij{x)) =fix)= x :. F(-x) =f(-x) + g(-x) = - j(x) + g(x) ct ±F(x)
Case-II: xE irrational :. F(x) is neither even nor odd.
We have fix)= 1 - x Hence, Statement-I is true.
⇒ fofix) = f(ftx)) = fil - x) = 1 - (1 - x) = x. Statement-II is also true and is the correct explanation of
2 Statement-I.
17. (b): l{x)=x -4x+5
2 2 7. (a): Heref(-1) = l,f(l) = 1,
Let y = x - 4x + 5, y = (x - 2) + 1
⇒ (x-2) 2 =y-l==>~-2 = ✓Y-1 ==>x= ✓Y-l +2 /(2) = 4,f(3) = 9
Two elements 1 and· -1 have the
Forrangey-1 ~Oand ✓Y-1 +2~2i.e.,x~ 2
2
same image 1 e B.
Range is (1, =). ,.. So,f is a many-one function.
Statement-I and II are true and
· 18 . (d) : gof(x)=g(f(x) )=g(2x-1)= 2x -l + 2 ~ 2x+3 Statement-II is the correct explanation of Statement-I.
2 2 2 2
8. (c): Since, (fog)x = .flg(x)} =. f(x? ) = sin .x2
3) 2x2+3 and (gof)x = g{f(x)} = g(sin x) = sin- x
gof( = ~ =3 ⇒ fogctgof
2
19. (a): Forfi-1) = 3(-1) = -3 9. (c) : gof(x) = g(f(x))
fi2) = (2)2 = 4,f(4) = 2(4) = 8
: . .f{-l)+f(2)+ f(4)=-3+4+ 8=9
=g[sin2 x+sin2 (x+; )+cosx·cos(x+~ )]

✓3 J)l
~ x = tan- 1y
20. (b) : Let fix)= y = tan.x
:. f- 1(x) = tan- 1(x)
=g
{· (12(:nx+2;sx
2
sm x+
F 1(1) = tan- 1(1) = {mt+: ;n E z} cos X 2cos X - 2 sm X 1
-ASSERTION & REASON CORNER · .
2
1. (a): R = {(x, y) : y = 3x, x E A}
= g({sin2 x+¼cos x )= g(S/4) = 1
R = {(l, 3), (2, 6), (3, 9), (4, 12)} Hence, gof(x) is a constant function.
Domain of the relation = {1, 2, 3, 4} 10. (a) : Since y = {y E N: y = 4x + 3 for some x E N}
and Range of the relation= {3, 6, 9, 12}. :. y = {7, 11, . .. oo}
2. (a) y-3
Let y = 4x + 3 ⇒ x = --
3. (b) : Statement-I : 4
R = {(l, 1), (1, 2), (2, 1), (2, 2), (2, 3), (3, 2), (3, 3)} j,-3
Inverse off (x) is g(y) = - -
R- 1 = {(y, x) : (x,y)ER} 4
= {(l, 1), (2, 1), (1, 2), (2, 2), (3, 2), (2, 3), (3, 3)} = R Hence, Statement-I is true.
1
Statement-II: Domain of R" = {l, 2, 3} Statement-II is also true and is the correct explanation of
Range of R = {l, 2, 3} Statement-I.
 ED uCA POIMT

EDUCATED POINT
May Be This Channel Will You Help in Education

Educated poi [email protected] SEARCH ON

WEB n - a @O
Educated poi nt.blogspot .com