Relation & Function

Ordered Pair Properties of Cartesian Product

Two elements a and b listed in a particular order, (i) For any three sets A , B and C, we have
is called ordered pair and it is denoted by ( a, b), (a) A × ( B ∪ C ) = ( A × B) ∪ ( A × C )
where ‘a’ is the first element and ‘b’ is the second (b) A × ( B ∩ C ) = ( A × B) ∩ ( A × C )
element. (c) A × ( B − C ) = ( A × B) − ( A × C )
It is evident from the definition that (ii) If A and B are two non-empty sets, then
( a, b) ≠ ( b, a) ⇔ a ≠ b A × B= B× A ⇔A = B
Also, if ( a, b) = ( c, d ), then a = c and b = d . (iii) If A ⊆ B, then A × A ⊆ ( A × B) ∩ ( B × A )
(iv) If A ⊆ B, then A × C ⊆ B × C, for any set C
Cartesian Product of (v) If A ⊆ B and C ⊆ D, then A × C ⊆ B × D
Two Sets (vi) For any sets A , B, C and D,
Let A and B be any two non-empty sets. The set ( A × B) ∩ (C × D) = ( A ∩ C ) × ( B ∩ D)
of all ordered pairs ( a, b) such that a ∈ A and b ∈ B (vii) For any sets A and B,
is called the Cartesian product of the sets A and B ( A × B) ∩ ( B × A ) = ( A ∩ B) × ( B ∩ A )
and is denoted by A × B. (viii) For any three sets A , B and C,
Thus, A × B = {( a, b) : a ∈ A and b ∈ B} (a) A × ( B′ ∪ C ′ )′ = ( A × B) ∩ ( A × C )
Note • A = φ or B = φ, then we define A × B = φ. (b) A × ( B′ ∩ C ′ )′ = ( A × B) ∪ ( A × C )
• If A has n elements and B has m elements, then
(ix) Let A and B be two non-empty sets having n elements in
A × B has mn elements. common, then A × B and B × A have n 2 elements in
• If A ≠ B, then A × B ≠ B × A. common.
14 NDA/NA Pathfinder

EXAMPLE 1. Let A and B be two sets such that A × B

consists of 6 elements. If three elements of A × B are
Codomain of a Relation
(1, 4), (2, 6) and (3, 6), then If R is a relation from set A to the set B, then the set B
is called the codomain of the relation R. The range of
a. ( A × B) = (B × A) b. ( A × B) ≠ (B × A)
relation is always a subset of its codomain
c. A × B = {(1, 4), (1, 6), ( 2, 4)} d. None of these
EXAMPLE 2. If R is a relation from set A = {2, 4, 5} to
Sol. b. Since, (1, 4), (2, 6) and (3, 6) are elements of A × B, set B = {1, 2, 3, 4, 6, 8} defined by xRy ⇔ x divides y,
it follows that 1, 2, 3 are elements of A and 4, 6 are then the domain and the range of R are
elements of B. It is given that A × B has 6 elements. a. Dom ( R) = { 2}, Range ( R) = { 2, 4 , 6 }
So, A = {1, 2, 3} and B = {4, 6} b. Dom ( R) = { 2, 4 }, Range ( R) = { 2, 4 , 6 , 8 }
c. Dom ( R) = { 4 }, Range ( R) = { 2, 4 , 6 }
Hence, A × B = {1, 2, 3} × {4, 6}
d. None of the above
= {(1, 4), (1, 6), ( 2, 4), ( 2, 6), ( 3, 4), ( 3, 6)} Sol. b. As set A = {2, 4, 5} is related to set B = {1, 2, 3, 4, 6, 8}
and B × A = {4, 6} × {1, 2, 3} through a relation defined as xRy ⇔ x divides y.
Thus, clearly we have, 2R 2, 2R 4, 2R6, 2R8, 4R 4 and 4R8
= {( 4, 1), ( 4, 2), ( 4, 3), (6, 1), (6, 2), (6, 3)}
∴ R = {( 2, 2), ( 2, 4), ( 2, 6), ( 2, 8), ( 4, 4), ( 4, 8)}
Now, as we know, domain is the first component of the
RELATION ordered pair. Thus, Domain (R) = {2, 4} and range is the
second components of ordered pair.
Relation is a definite manner or pattern which show
Thus, Range (R) = {2, 4, 6, 8}
how a set belongs to another one. Let A and B be two
non-empty sets, then a relation R from A to B is a
subset of A × B. Thus, R is a relation from A to B ⇔ Inverse Relation
R ⊆ A × B. If R is a relation from a non-void set A to a Let A and B be non-void sets and R be the relation
non-void set B and ( a, b) ∈ R, then we write aRb which from a set A to a set B. Then, the inverse of R, denoted
is read as ‘a is related to b’ by the relation R. If by R−1 , is a relation from B to A and is defined by
( a, b) ∉ R, then we write aRb and say that ‘a is not R−1 = {( b, a) : ( a, b) ∈ R}
related to b’ by the relation R.
Clearly, ( a, b) ∈ R ⇔ ( b, a) ∈ R−1
Note If A and B are two non-empty sets consisting of p and q
elements respectively, then total number of relations from A
Also, Domain ( R−1 ) = Range ( R)
to B is 2 pq .
and Range ( R−1 ) = Domain ( R)

Domain of a Relation EXAMPLE 3. Let N be the set of natural numbers and

Let R be a relation from a set A to a set B. Then, the set let R = {(a, b):a ∈ N, b ∈ N and 2a + b = 10 }. Then, find
of all first components of the ordered pair belonging to i. Dom ( R) ii. Range ( R) iii. R −1 iv. Dom ( R −1) v. Range ( R −1)
R is called the domain of R. Sol. Clearly R ⊆ N × N. So, R is a binary relation on A.
Thus, Domain ( R) = { a : ( a, b) ∈ R} ∴ R = {(1, 8), ( 2, 6), ( 3, 4), ( 4, 2)}
It is evident from the definition that the domain of a (i) Dom (R) = {1, 2, 3, 4} (ii) Range (R) = {8, 6, 4, 2}
relation from A to B is a subset of A. (iii) R −1 = {(8, 1), (6, 2), ( 4, 3), ( 2, 4)}
e.g. If A = {1, 3, 5, 7}, B = { 2, 4, 6, 8, 10} (iv) Dom (R −1) = {8, 6, 4, 2} (v) Range (R −1) = {1, 2, 3, 4}
and R = {(1, 8), ( 3, 6), (5, 2), (1, 4)} be a relation from A to B.
Then, dom ( R) = {1, 3, 5} Types of Relations
1. Void relation Let A be a set. Then, φ ⊆ A × A and φ
Range of a Relation is a null set, so it is a relation on A. This relation is
If R is a relation from a set A to a set B, then the set of called the void or empty relation on set A.
all second components of the ordered pair of R is called 2. Universal relation Let A be a set. Then,
the range of R. A × A ⊆ A × A , so it is a relation on A. This relation
Thus, Range ( R) = { b : ( a, b) ∈ R} the range of relation is called the universal relation on set A.
from A to B is a subset of B. e.g. If A = { x, y}, then the universal relation on A is
the set {( x, x), ( x, y), ( y, x), ( y, y)}
e.g. If A = { a, b, c}, B = {d , e, f , g, h} and
Note The void and the universal relations on a set A are
R = {( a, d ), ( b, e ), ( c, f )}, then range of R = {d , e, f }
respectively the smallest and the largest relations on set A.
MATHEMATICS Relations and Functions 15

3. Identity relation Let A be a set. Then, the relation Let R be an equivalence relation on the set A. For each
I A = {( a, a) : a ∈ A } on A is called the identity relation a ∈ A, the equivalence class of a ‘denoted by [a]’ is
on A. defined as the set of all those points of A which are
e.g. If A = {1, 4, 5}, then identity relation, related to a under the relation R.
I A = {(1, 1), ( 4, 4), (5, 5)} Thus, [ a] = { x ∈ A : xRa}
In other words, a relation I A on A is called the Any two equivalence classes are either equal or disjoint
identity relation, if every element of A is related to and hence equivalence relation partitions the set A.
itself only.
4. Reflexive relation A relation R on a set A is said to EXAMPLE 4. Let A be the set of all real numbers.
be reflexive, if every element of A is related to itself. Then, the relation R = {(a, b): 1 + ab > 0 } on A is
Thus, R is reflexive ⇔ ( a, a) ∈ R , ∀ a ∈ A. a. reflexive and symmetric but not transitive
b. reflexive and transitive but not symmetric
A relation R on a set A is not reflexive if there exists
c. symmetric, transitive but not reflexive
an element a ∈ R, such that ( a, a) ∉ R.
d. None of the above
e.g. Let A = {1, 2, 3} be a set. Then
Sol. a. Given, R = {( a, b) : 1+ ab > 0}
R = {(1, 1), ( 2, 2), ( 3, 3), (1, 3)} is a reflexive relation on
A. But R1 = {(1, 1), ( 3, 3), (1, 3), ( 2,1)} not a reflexive Reflexivity As 1+ a ⋅ a = 1+ a2 > 0 for all a ∈ A
relation on A. ∴ ( a, a) ∈ R is reflexive.
Symmetric ( a, b) ∈ R ⇒ 1+ ab > 0 ⇒ 1+ ba > 0 ⇒ ( b, a) ∈ R
5. Symmetric relation A relation R on a set A is said
Thus, R is symmetric.
to be symmetric relation,
Transitivity ( a, b) ∈ R and ( b, c) ∈ R need not imply
iff ( a, b) ∈ R ⇒ ( b, a) ∈ R , ∀ a, b ∈ A ( a, c) ∈ R.
i.e. aRb ⇒ bRa, ∀ a, b ∈ A Hence, R is not transitive.
e.g. Let A = { a, b, c, d } be a set, then
R = {( a, c ), ( a, d ), (d , a), ( c, a), ( b, b)} is a symmetric
Properties of Relation
(i) If any set has n elements, then total number of
relation. 2
reflexive relation is 2n − n .
6. Transitive relation Let A be any set. A relation R (ii) The universal relation on a non-empty set is always
on A is said to be a transitive relation, reflexive, symmetric and transitive.
iff ( a, b) ∈ R and ( b, c ) ∈ R ⇒ ( a, c ) ∈ R, ∀ a, b, c ∈ A (iii) The identity relation on a non-empty set is always
i.e. aRb and bRc ⇒ aRc, ∀ a, b, c ∈ A reflexive, symmetric and transitive.
(iv) The identity relation on a non-empty set is always
e.g. If a relation R is defined by xRy ⇒ x is less than
anti-symmetric.
y for any x, y, z ∈ N, then R is transitive relation.
(v) If R and S are two equivalence relations on set A,
7. Anti-symmetric relation Let A be any set. A
then R ∩ S is also an equivalence relation on A.
relation R on set A is said to be an anti-symmetric
(vi) The inverse of an equivalence relation is an
relation,
equivalence relation.
iff ( a, b) ∈ R and ( b, a) ∈ R ⇒ a = b, ∀ a, b ∈ A
e.g. Let R be a relation on the set of natural numbers Composition of Relations
defined by xRy ⇔ x ′ divides y ′ for all x, y ∈ N, then If R ⊆ A × B and S ⊆ B × C are two relations. Then,
R is anti-symmetric relation. compositions of the relations R and S denoted by
8. Equivalence relation and equivalence classes A SoR ⊆ A × C and is defined by ( a, c ) ∈ SoR if and only if
relation R on a set A is said to be an equivalence there is an element b ∈ B such that ( a, b) ∈ R and ( b, c ) ∈ S.
relation on A, iff
e.g. Let A = {1, 2, 3}, B = { a, b, c, d }, C = {α, β, γ }
(i) It is reflexive, i.e. ( a, a) ∈ R, ∀ a ∈ A
R ⊆ A × B = {(1, a), (1, c ), ( 2, d )}
(ii) It is symmetric, i.e. ( a, b) ∈ R
S ⊆ B × C = {( a, α ), ( a, γ ), ( a, β )}
⇒ ( b, a) ∈ R, ∀ a, b ∈ A
Then, SoR ⊆ A × C = {(1, α ), (1, γ ), (1, β )}
(iii) It is transitive, i.e. ( a, b) ∈ R and ( b, c ) ∈ R
Note Remember that SoR ≠ RoS
⇒ ( a, c ) ∈ R , ∀ a, b, c ∈ A
Also, (SoR )−1 = R −1oS −1 is the reversal rule.
16 NDA/NA Pathfinder

EXAMPLE 5. If R is a relation from A = {1, 2, 3, 4} to EXAMPLE 6. Find the domain and range of the
B = {1, 3, 5}, i.e. (a, b) ∈ R ⇔ a < b, then RoR −1 is function f (x) =
x
.
a. {(1, 3), (1, 5), ( 2, 3), ( 2, 5), ( 3, 5), ( 4 , 5)} 1 + x2
b. {( 3, 1), ( 5, 1), ( 3, 2), ( 5, 2), ( 5, 3), ( 5, 4)}  1 1  1 1
a. R,  − ,  b. R − { 0 }, − ,
 2 2  2 2 
c. {( 3, 3), ( 3, 5), ( 5, 3), ( 5, 5)} d. {( 3, 3), ( 3, 4), ( 4 , 5)}
 1 1
c. R, − , − { 0 } d. None of these
Sol. c. We have, R = {(1, 3), (1, 5), ( 2, 3), ( 2, 5), ( 3, 5), ( 4, 5)}  2 2 
⇒ R −1 = {( 3, 1), ( 5, 1), ( 3, 2), ( 5, 2), ( 5, 3), ( 5, 4)} x
Sol. c. Let y = f ( x) = ⇒ 1 + x2 ≠ 0, ∀ x ∈ R
Hence, RoR −1 = {( 3, 3), ( 3, 5), ( 5, 3), ( 5, 5)} 1 + x2
So, y is defined for all real numbers.
FUNCTION ∴ Domain ( f ) = R
A function ‘ f ’ from a set to another set is a rule or Also, y=
x
method which associates every element of first set to a 1 + x2
unique element of second set. ⇒ y + x2 y = x
OR
⇒ x y − x+ y =0
2
If A and B are two non-empty sets, then function f is a
relation such that for every element x ∈ A their exist a 1± 1 − 4y 2
∴ x=
unique element y ∈ B, written as y = f ( x) = B. 2y
A function is also termed as ‘map’ or ‘mapping’. If an Since, x ∈R, we have y ≠ 0 and 1 − 4y 2 ≥ 0
element x ∈ A is associated to an element y ∈ B, then y is
Now, 1 − 4y 2 ≥ 0
called ‘image of x’ or the value of function f at x. If for 1 1 1
any value of x, there are more than one value of f ( x), ⇒ y2 ≤ ⇒ − ≤ y ≤
4 2 2
then f ( x) is not a function but a relation. It is denoted 1 1
∴ − ≤y≤ and y ≠ 0
by f : A → B or f : A  f
→ B which is read as “ f is a 2 2
∴ Range ( f ) = − ,  − {0}
function of A to B’’. 1 1
 2 2
Domain of a Function
If f : A → B is a function, then the set A is called the Types of Functions
domain of the function f and B is called the co-domain
1. One-one function (Injection) A mapping
of f. Thus, domain is the all possible values of x for
f : A → B is said to be one-one or one-to-one, if
which f ( x) exists.
different elements in A have different f-images in B.
Range of a Function A f B
Let f be a mapping from A to B, i.e. f : A → B. Each a a
element of A has a unique image and each element of B b b
g
need not appear as the image of an element in A. We c
d
define the range of f to consist of those elements in B
which appear as the image of atleast one element in A. i.e. f ( x1 ) = f ( x 2 )
Hence, range of a function of f : A → B, denoted by f ( A ). ⇒ x1 = x 2 , ∀ x1 , x 2 ∈ A
Thus, f ( A ) = { f ( x) : x ∈ A } ⇒ f ( A ) ⊆ B 2. Many-one function A mapping f : A → B is said
⇒ Range is the subset of codomain. to be many-one, if two (or more than two) distinct
elements in A have the same f-image in B.
e.g. Let A = { a, b, c, d } and B = {α, β, γ }
i.e. f ( x1 ) = f ( x 2 ) ⇒ x1 ≠ x 2 , ∀ x1 , x 2 ∈ A
f
A B f
a α A B
b β a a
c b b
γ g
d c
d d
Domain = { a, b, c, d } = A ; Codomain = {α, β, γ } = B
Range = {β, γ }
MATHEMATICS Relations and Functions 17

3. Into function If the mapping f : A → B is such 8. Many-one-into function If the mapping f : A → B

that there is atleast one element in B which is not the is such that there is at least one element in B which is
f-image of any element in A, then f is a mapping of A not the image of any element in A and B has more
‘into’ B. element to A, then it is called many one into function.
f
A f B
A B
a a a a
b b b b
c g c g
d d

4. Onto function (Surjection) If the mapping

 x , x ∈θ x, x ∉ θ
f : A → B is such that each element in B is the f-image EXAMPLE 7. If g(x) =  and f (x) = 
of atleast one element in A, then f is a mapping of 0 , x ∉ θ 0, x ∈θ
A ‘onto’ B. then (f − g) will be
f a. one-one onto b. one-one into
A B
a a c. many-one onto d. many-one into
b b x − 0 , x ∉ θ
g Sol. a. Let h( x) = f ( x) − g( x) = 
0 − x , x ∈ θ
c
d d
 x , x ∉θ
i.e. h( x) =  ⇒ h ( x) is one-one and onto.
5. One-one-onto function (Bijective) If the mapping − x , x ∈ θ
f : A → B is such that each element in the co-domain
B is mapped to by exactly one element of the domain Some Important Functions
A i.e. the function is both one-one and onto function There are following some important functions come under
well as onto function, then it is called bijective this chapter.
functions. 1. Constant function A function f : R → R defined by
f
A B f ( x) = c, ∀ x ∈ R that assigns the same value to every
a a member of its domain, where c is a constant, is called
b b a constant function. The domain and range of this
g
function are R and { c }, respectively.
c
2. Identity function A function f : R → R defined by
6. One-one-into function If the mapping f : A → B f ( x) = x, ∀ x ∈ R
is such that different elements in A have different is called identity function. Here, domain and range
f-images in B and one or more than one element in both are equal to R.
the codomain B is not an image of any element in the 3. Reciprocal function The function defined by
domain A, then it is called one-one into function. 1
f ( x) = , ∀ x ∈ R, x ≠ 0
f x
A B
a a
is called reciprocal function. The domain and range
b b of this function are equal to R − {0}.
g
c d
4. Rational function When any function is written as
the ratio of two algebraic expressions, it is called a
7. Many-one-onto function If the mapping f : A → B rational function.
is such that two or more than two elements in A x 2 − 3x + 5
e.g. f ( x) = 3
have the same image in B and B has the less element x − 2x 2 + x − 1
to A, then it is called many one onto function.
5. Absolute or modulus function
f Y
A B A function defined by f(x
)= x
)=
a a  x, if x ≥ 0 −x f (x
b f ( x) = | x | = 
 − x, if x < 0
b
c
X′ O X
Y′
18 NDA/NA Pathfinder

is called absolute or modulus function. Domain 10. Trigonometric function The function involving
and range of absolute function are respectively R and circular functions of variable angles are known as
[0, ∞ ). trigonometric function.
Properties of modulus function
Function Domain Range
(i) | x | ≤ a ⇔ − a ≤ x ≤ a (ii) | x | ≥ a ⇔ x ≤ − a or
sin x R [−1, 1]
x≥ a
cos x R [−1, 1]
(iii) | x ± y | ≤ | x | + | y | (iv) | x ± y | > || x | − | y | |
π
6. Greatest integer function (Floor function) The tanx R − (2 n + 1) : n ∈ I

R
 2 
function f ( x) = [ x] is called the greatest integer
cot x R − {nπ : n ∈ I} R
function and means greatest integer less than or
π
equal to x i.e. [ x] ≤ x. sec x R − (2 n + 1) : n ∈ I (−∞,−1] ∪ [1, ∞ )
e.g. [ 3.12] = 3, [ −3.12] = − 4, [ −3] = − 3, [ 3] = 3,  2 
Its domain is R and range is I. cosec x R − {nπ : n ∈ I } (−∞,−1] ∪ [1, ∞ )
Y
11. Inverse trigonometric function The function
3 involving inverse trigonometric ratios are known as
2 inverse trigonometric functions.
1
Function Domain Range
X′ −3 −2 −1 1 2 3 X − π , π 
−1 sin−1 x [−1, 1]  2 2 
−2
−3 cos −1 x [−1, 1] [0, π ]
− π, π
Y′ tan−1 x R 
 2 2

Properties of greatest integer function
cot −1 x R (0, π )
(i) [ x + n] = [ x] + n, where x ∈ R and n ∈ I
π
 − [ x], if x ∈ I sec −1 x (−∞,−1] ∪ [1, ∞ ) [0, π ] −  
(ii) [ − x] =  2 
 − [ x] − 1, if x ∉ I  − π , π  − {0}
cosec −1 x (−∞,−1] ∪ [1, ∞ )  2 2 
0 , if x ∈ I
(iii) [ x] + [ − x] = 
 −1, if x ∉ I 12. Periodic function If a function f ( x) satisfies the
(iv) n 1 ≤ [ x] ≤ n2 ⇒ n 1 ≤ x < n2 + 1 condition f ( x + T ) = f ( x), ∀ x ∈ X , where T is the
7. Smallest integer function For any real number x, smallest positive real number for which the equality
we use the symbol [ x] to denote the smallest holds, then f ( x) is called a periodic function and T is
integer function greater than or equal to x.
called the period of the periodic function.
e.g. [9.7 ] = 10, [ − 5.78] = − 5
e.g. sin x is a periodic function with period 2π.
This is also known as ceiling function.
[Qsin x = sin ( 2π + x)]
8. Exponential function Let a ( ≠ 1) be a positive real 13. Signum function The function defined by
number. Then the function f : R → R defined by  −1, x < 0
| x| 
f ( x) = a x is called the exponential function. f ( x) = =  0, x = 0 is called the signum function.
x 
Domain of f = R  1, x > 0
Y
Range of f = (0, ∞ ) y=1
1
9. Logarithmic function Let a ( ≠ 1) be a positive real x>0

number. Then the function f : (0, ∞ ) → R defined by X′ O X

f ( x) = log a x is called the logarithmic function. y=−1
−1
Domain of f = (0, ∞ ) x<0
Y′
Range of f = R Domain = R, Range = { −1, 0, 1}
MATHEMATICS Relations and Functions 19

EXAMPLE 8. The domain of the function

1 Properties of Function
f (x ) = is (i) If A and B have n and m distinct elements
[x ] − [x ] − 6
2
respectively, then the number of mappings from A
a. ( −∞ , −2) ∪ [ 4 , ∞) b. ( −∞ , − 2] ∪ [ 4 , ∞) to B is equal to mn .
c. ( −∞ , − 2) ∪ ( 4 , ∞) d. None of these (ii) If A and B have n equal number of distinct
Sol. a. f ( x) is defined, if [ x ]2 − [ x ] − 6 > 0 elements, then the number of bijective functions
⇒ ([ x ] − 3]([ x ] + 2) > 0, [ x ] < −2 or [ x ] > 3 from A to B is equal to n!. But if A and B don’t
But [ x ] < −2 ⇒ [ x ] = −3, − 4, − 5, ...
have equal number of elements, then number of
bijective functions from A to B is 0.
Also, [ x ] > 3 ⇒ [ x ] = 4, 5, 6,...
∴ x≥4 (iii) The number of one-one functions that can be
Domain of f = ( −∞ ,−2) ∪ [ 4, ∞) defined from a finite set A into a finite set B is
n (B)
Pn (A ) , if n ( B) ≥ n ( A ) and 0 otherwise.
Inverse Function (iv) If A and B have n equal number of distinct
Let f : A → B be a one-one onto (bijection) mapping. elements, then number of onto functions from A to
Then, the mapping, f −1 : B → A, which associates to each B is equal to 2n − 2 .
element b ∈ B the element a ∈ A, such that f ( a) = b, is
called the inverse mapping of the mapping f : A → B.
Composition of Functions
A B
f Let A, B and C be three non-empty sets.
–1
Let f : A → B and g : B → C be two mappings or
a = f (b) b = f (a)
functions. Then, the composite of the functions f and
–1 g denoted by ( gof ), is a mapping of A → C, given by
f
( gof ) : A → C
Method to Find Inverse of Function such that ( gof ) ( x) = g { f ( x)}, ∀ x ∈ A
A B C
Let f : A → B be a bijective function. f g
(1) Put f ( x) = y.
x y = f(x) z = g{f(x)}
(2) Solve the equation y = f ( x) to obtain x is terms of y.
Interchange x and y to obtain the inverse of f.
gof
EXAMPLE 9. The inverse of the function gof exists iff the range of f is a subset of domain of g.
10 x − 10 − x Similarly, fog exists iff range of g is a subset of
y= x + 1 is
10 + 10 − x domain of y.
 x  1  x 
a. y = log10  b. y = log10  1+x
EXAMPLE 10. If f (x) = log
 
 2 − x 2  2 − x  and
1−x
1  x 
c. y = log10   d. None of these (3x + x 3 )
2  1− x g(x) = , then what is f [fg(x)] equal to?
1 + 3x 2
10x − 10−x 10x − 10− x
Sol. b. y = −x + 1 ⇒ y − 1 = a. −f ( x) b. 3[f ( x)] c. [f ( x)]3 d. − 3[f ( x)]
10 + 10
x
10x + 10− x
1+ x  ( 3x + x 3)
Using componendo and dividendo Sol. b. Given, f ( x) = log   and g( x) =
y − 1+ 1 102x − 1+ 102x + 1  1− x  1+ 3x 2
=
y − 1− 1 102x − 1− 102x − 1  1+ g( x)   1+ 3x 2 + 3x + x 3 
Now, f [ g( x)] = log   = log  
y 2(102x ) y  1− g( x)   1+ 3x 2 − 3x − x 3 
= = 102x
y−2 −2 2 − y
1+ x  3
 y  1  y  −1 = log  
2x = log10   ⇒ x = log10   = f ( y)  1− x 
 2 − y 2  2 − y
1+ x 
Hence, the inverse of the given functions is = 3log  
 1− x 
y = log10 
1 x 

2  2 − x = 3[ f ( x)]
20 NDA/NA Pathfinder

PRACTICE EXERCISE
1. If A = { 1, 2, 5, 6} and B = { 1, 2, 3}, then what is 12. The function f( x ) = log( x + x 2 + 1 ) is
( A × B) ∩ ( B × A) equal to? (a) an even function (b) an odd function
(a) {(1, 1), (2, 1), (6, 1), (3, 2 )} (b) {(1, 1), (1, 2 ), (2, 1), (2, 2 )} (c) periodic function (d) None of these
(c) {(1, 1), (2, 2 )} (d) {(1, 1), (1, 2 ), (2, 5), (2, 6)}
13. If A = { a , b, c} and R = {( a , a ),( a , b),( b, c),( b, b),( c, c),
2. Which one of the following is correct? ( c, a )} is a binary relation on A, then which one
(a) A × (B − C ) = ( A − B) × ( A − C ) of the following is correct?
(b) A × (B − C ) = ( A × B) − ( A × C ) (a) R is reflexive and symmetric, but not transitive
(c) A ∩ (B ∪ C ) = ( A ∩ B) ∪ C (b) R is reflexive and transitive, but not symmetric
(d) A ∪ (B ∩ C ) = ( A ∪ B) ∩ C (c) R is reflexive, but neither symmetric nor transitive
3. Let R = { x| x ∈ N , x is a multiple of 3 and x ≤ 100} (d) R is reflexive, symmetric and transitive
S = { x| x ∈ N , x is a multiple of 5 and x ≤ 100}. 14. The values of b and c for which the identity
What is the number of elements in f ( x + 1) − f ( x ) = 8x + 3 is satisfied, where
( R × S ) ∩ (S × R )? f ( x ) = bx 2 + cx + d , are
(a) 36 (b) 33 (c) 20 (d) 6 (a) b = 2, c = 1 (b) b = 4, c = − 1
4. If φ ( x ) = a , then [φ ( p)] is equal to
x 3 (c) b = − 1, c = 4 (d) None of these

(a) φ (3p) (ax + a− x )

(b) 3φ ( p) (c) 6φ ( p) (d) 2φ ( p) 15. If the function f ( x ) = (where, a > 2),
2
5. If f ( x ) = x 2 − x −2 , then f   is equal to
1
then f ( x + y ) + f ( x − y ) is equal to
 x f( x ) f( y)
1 (a) 2 f(x) ⋅ f( y) (b) f(x) ⋅ f( y) (c) (d)
(a) f(x) (b) − f(x) (c) (d) [f(x)]2 f( y) f( x )
f(x)
16. Let f be a function with domain [− 3, 5] and let
1+ x f (x) ⋅ f (x2 )
6. If f ( x ) = , then is equal to g( x ) =|3x + 4|, then the domain of fog ( x ) is
1− x 1 + [ f ( x )]2
(a)  − 3,  (b)  − 3, 
1 1
1 1 1 1  3  3 
(a) (b) (c) (d)
4 6 8 2
(c)  − 3, 
1
(d) None of these
 3
7. Which one of the following functions, f : R → R is
injective? αx
17. Let f( x ) = , x ≠ −1. Then, for what value of α
(a) f(x) = | x|, ∀ x ∈ R (b) f(x) = x , ∀ x ∈ R
2
x+1
(c) f(x) = 11, ∀ x ∈ R (d) f(x) = − x, ∀ x ∈ R is f [ f ( x )] = x?
(a) 2 (b) − 2
8. The domain of the function f ( x ) = x − 1 + 6 − x
(c) 1 (d) −1
is
(a) [1, ∞ ) (b) (− ∞, 6) 18. The inverse of the function f ( x ) = loga ( x + x 2 + 1 )
(c) [1, 6] (d) None of these (where, a < 0, a ≠ 1) is
1 x
9. The period of the function f( x ) =|sin x| +|cos x| is (a) ( a − a− x ) (b) not defined for all x
2
(a) π / 2 (b) π (c) 2 π (d) π / 4 (c) defined for x > 0 (d) None of these
10. The domain of the function 19. If f( x ) = 3x + 10 and g( x ) = x 2 − 1, then ( fog)−1 is
1
f( x ) = + ( x + 2) is equal to
log10(1 − x ) x − 7
1/ 2
x + 7
1/ 2
x−
1/ 2
x + 3
1/ 2
(a)  (b)  (c) 
3
   (d) 
(a) ] − 3, − 2.5 [ ∪ ] − 2.5, − 2 [ (b) [−2,0 [ ∪ ] 01
,[  3   3   7   7 
(c) ] 0,1[ (d) None of these
1 20. Let f ( x ) = ( − 1)[ x ] (where [⋅] denotes the greatest
11. The range of the function f( x ) = is integer function), then
( 2 − sin 3x )
(a) range of f is {− 1, 1} (b) f is an even function
(a)  , 1  (b)  , 1 (c)  , 1  (d) 1,
1 1 1 1
 3   3   3   (c) f is an odd function (d) f is one-one function
3 
MATHEMATICS Relations and Functions 21

21. The function f : R → R defined by f ( x ) = 4x + 4|x| is 29. If g( x ) = loge x 2, then range of the function g[ f ( x )]
(a) one-one and into (b) many-one and into is
(a)  − ∞, loge
11
(b) loge , ∞ 
(c) one-one and onto (d) many-one and onto 11
 3   3 
22. If f ( x ) satisfies the relation 2 f ( x ) + f (1 − x ) = x 2
(c)  − loge , loge 
11 11
(d) None of these
 3 
for all real x, then f ( x ) is 3
x 2 + 2x − 1 x 2 + 2x − 1
(a) (b)
6 3 Directions (Q. Nos. 30-31) The following functions
x 2 + 4x − 1 x 2 + 4x − 1 are defined for the set of variables x1, x2, K, xn
(c) (d)
3 6
 xi + j , if i + j ≤ n2
23. For real numbers x and y, define a relation R, f ( xi , xj ) =  and g ( xi , xj ) = xm
xi + j − n , if i + j > n
2
xRy if only if x − y + 2 is an irrational number.
where, m is the remainder when i × j is divided by n.
Then the relation R is
(a) reflexive (b) symmetric 30. Find the value of f [ f ( x2 , x3 ), f ( x5 , x6 )], if n = 3.
(c) transitive (d) an equivalence relation
(a) x5 (b) x10 (c) x13 (d) x8
24. Let A = {2, 3, 4, 5, …, 16, 17 18} and ‘*’ be the 31. Find the value of g [g( x2 , x3 ), g( x7 , x8 )], if n = 5.
equivalence relation on A × A defined by
( a , b) * ( c, d ) if ad = bc. Then, the number of (a) x1 (b) x2 (c) x5 (d) All of these
ordered pairs of the equivalence class of ( 3, 2) is
[x ]
(a) 5 (b) 6 (c) 7 (d) 8 Directions (Q. Nos. 32-33) Consider f ( x ) = and
x
25. Consider the following with regard to a relation g( x ) = | x | , where [⋅] denotes the greatest integer
R on a set of real numbers defined by xRy if and function.
only if 3x + 4 y = 5
1 2 3 32. What is the value of fog( −2 / 3) − gof ( −2 / 3)?
I. 0 R 1 II. 1 R III. R
2 3 4 (a) 1 (b) −1 (c) 0 (d) 2
Which of the above statement(s) is/are correct? 33. What is the value of fof ( −7 / 4) + gog ( −1)?
(a) I and II (b) I and III (c) II and III (d) I, II and III 1 1
−x
(a) 0 (b) −1 (c) (d) −
26. The function f : R → R is defined by f ( x ) = 3 4 8
I. f is one-one function.
II. f is onto function.
III. f is a decreasing function.
Which of the above statement(s) is/are correct? 34. If f ( xy ) = f ( x ) f ( y ), then f ( t ) may be of the form
e 2012 I
(a) I and II (b) II and III (c) I and III (d) All of these
(a) t + k (b) ct + k (c) t k + c (d) t k

27. The domain of the given function where k is a constant

f ( x ) = log2 sin x is
35. Let A = { x ∈ W, the set of whole numbers and
π 2π
I. (4n + 1) II. (4n + 1) x < 3}, B = { x ∈ N , the set of natural numbers and
3 3 2 ≤ x < 4} and C = { 3, 4}, then how many elements
π
III. (4n + 1) where n ∈ N . will ( A ∪ B) × C contain?
2 (a) 6 (b) 8 (c) 10 (d) 12
Choose the correct option using the code given 36. Let P = {1, 2, 3} and a relation on set P is given
by the set R = {(1, 2), (1, 3), (2, 1) (1, 1) (2, 2),
below.
(a) Only I (b) Only II (3, 3), (2, 3)}. Then, R is
(c) Only III (d) I and II (a) reflexive, transitive but not symmetric
(b) symmetric, transitive but not reflexive
Directions (Q. Nos. 28-29) Consider the function (c) symmetric, reflexive but not transitive
f ( x ) = 3x 2 − 4x + 5 . (d) None of the above
37. The relation ‘has the same father as’ over the set
28. The domain of function f ( x ) is of children is
(d)  , ∞ 
2 (a) only reflexive (b) only symmetric
(a) R (b) (− ∞, 1) (c) (1, ∞ )
3  (c) only transitive (d) an equivalence relation
22 NDA/NA Pathfinder

x+5 49. If f be a function from the set of natural

38. If f : R → R be a function whose inverse is ,
3 numbers to the set of even natural numbers
then what is the value of f( ) x ? given by f( x ) = 2x. Then, f is
(a) f (x) = 3x + 5 (b) f (x) = 3x − 5 (a) one-one but not onto (b) onto but not one-one
(c) f (x) = 5x − 3 (d) Does not exist (c) Both one-one and onto (d) Neither one-one nor onto
39. If A = { x ∈ R|x ≥ 0} and a function f : A → A is 50. Let X be the set of all citizens of India. Elements
defined by f( x ) = x 2, then which one of the x, y in X are said to be related, if the difference
following is correct? of their age is 5 yr. Which one of the following is
(a) The functions does not have inverse correct?
(b) f is its own inverse (a) The relation is an equivalence relation on X
(c) The functions has an inverse but is not its own inverse (b) The relation is symmetric but neither reflexive nor
transitive
(d) None of the above
(c) The relation is reflexive but neither symmetric nor
40. Consider the following statements transitive
I. If f (x) = x3 and g ( y) = y3 , then f = g. (d) None of the above
II. Identity function is not always a bijection. 51. Let S denote set of all integers. Define a relation
Which of the above statement(s) is/are correct? R on S as ‘aRb if ab ≥ 0, where a , b ∈ S . Then, R
is
(a) Only I (b) Only II e 2012 II
(a) reflexive but neither symmetric nor transitive relation
(c) Both I and II (d) Neither I nor II
(b) reflexive, symmetric but not transitive relation
41. If A = { x , y }, B = { 2, 3} , C = { 3, 4}, then what is the (c) an equivalence relation
number of elements in A × ( B ∪ C )? e 2013 I (d) symmetric but neither reflexive nor transitive relation
(a) 2 (b) 4 (c) 6 (d) 8
52. Consider the following relations from A to B,
42. If A is a relation on a set R, then which one of where
the following is correct?
A = {u, v, w, x, y, z} and B = {p, q, r, s}.
(a) R ⊆ A (b) A ⊆ R (c) A ⊆ (R × R ) (d) R ⊆ ( A × A)
I. {(u, p), (v, p), (w, p), (x, q), (y, q), (z, q)}
43. Let N be the set of natural numbers and II. {(u, p), (v, q), (w, r), (z, s)}
f : N → N be a function given by f ( x ) = x + 1 for
III. {(u, (v, r), (w, q), (u, p), (v, q), (z, q)}
x ∈ N . Which one of the following is correct?
s),
e 2013 I IV. {(u, q), (v, p), (w, s), (x, r), (y, q), (z, s)}
(a) f is one-one and onto (b) f is one-one but not onto Which of the above relations are not functions?
(c) f is only onto (d) f is neither one-one nor onto e 2014 I
(a) I and II (b) I and IV (c) II and III (d) III and IV
44. What is the range of the function
|x| 53. Let N denote the set of all non-negative integers
f(x) = ,x ≠ 0?
x and Z denote the set of all integers. The function
(a) Set of all real numbers (b) Set of all integers f : Z → N given by f( x ) =| x | is e 2014 I
(c) {−1, 1} (d) {−1 , 0, 1} (a) one-one but not onto (b) onto but not one-one
(c) Both one-one and onto (d) Neither one-one nor onto
45. If A = { 1, 2}, B = { 2, 3} and C = { 3, 4}, then what is
the cardinality of ( A × B) ∩ ( A × C )? e 2013 II 54. A and B are two sets having 3 elements in
(a) 8 (b) 6 (c) 2 (d) 1 common. If n( A) = 5 and n( B) = 4, then what is
n( A × B) equal to?
46. If A is a finite set having n elements, then the (a) 0 (b) 9 (c) 15 (d) 20
number of relations which can be defined in A is
55. If f ( x ) = ax + b and g( x ) = cx + d such that
e 2013 II
(a) 2 n
(b) n2
(c) 2 n2
(d) nn f [g( x )] = g[ f ( x )], then which one of the following
is correct?
47. Let A = { a , b, c, d } and B = { x , y , z }. What is the (a) f(c ) = g (a) (b) f(a) = g (c ) (c) f(c ) = g (d ) (d) f(d ) = g (b )
number of elements in A × B ? e 2013 II 56. The function f : N → N , N being the set of
(a) 6 (b) 7 natural numbers, defined by f ( x ) = 2x + 3 is
(c) 12 (d) 64 e 2014 II
48. The relation R in the set Z of integers given by (a) injective and surjective
R = {( a , b) : a − b is divisible by 5} is e 2013 II (b) injective but not surjective
(a) reflexive (b) reflexive but not symmetric (c) not injective but surjective
(c) symmetric and transitive (d) an equivalence relation (d) neither injective nor surjective
MATHEMATICS Relations and Functions 23

57. The relation S is defined on the set of integers Z 65. Consider the following functions
as xSy, if integer x divides integer y. Then I. f (x) = x3 , x ∈ R
(a) S is an equivalence relation II. f (x) = sin x, 0 < x < 2π
(b) S is only reflexive and symmetric
III. f (x) = ex , x ∈ R
(c) S is only reflexive and transitive
(d) S is only symmetric and transitive Which of the above functions have inverse defined
on their ranges?
(a) I and II (b) II and III
Directions (Q. Nos. 58-60) Read the following
(c) I and III (d) I, II and III
information carefully and answer these questions
given below. 66. Let Z be the set of integers and aRb, where a,
x −1 b ∈ Z if and only if ( a − b) is divisible by 5.
Consider the function f ( x ) = .
x +1 Consider the following statements
f(x) + 1
58. What is + x equal to? I. The relation R partitions Z into five equivalent
f(x) − 1 classes.
(a) 0 (b) 1 (c) 2x (d) 4x II. Any two equivalent classes are either equal or
disjoint.
59. What is f ( 2x ) equal to?
Which of the above statement(s) is/are correct?
f( x ) + 1 f( x ) + 1 3f(x ) + 1 f( x ) + 3
(a) (b) (c) (d) e 2015 I
f( x ) + 3 3f(x ) + 1 f( x ) + 3 3f(x ) + 1
(a) Only I (b) Only II
60. What is f [ f ( x )] equal to? (c) Both I and II (d) Neither I nor II
(b) −x 1
(a) x 67. The domain of the function f ( x ) = is
1 |x|– x
(c) − (d) None of these
x e 2015 II
61. Let A = { x , y , z } and B = { p, q , r , s}, what is the (a) [0, ∞ ) (b) (− ∞, 0) (c) [1, ∞ ) (d) (− ∞, 0]
number of distinct relations from B to A? e 2015 I 68. If f : R → R , g : R → R are two functions given by
(a) 4096 (b) 4094 (c) 128 (d) 126 f ( x ) = 2x − 3 and g( x ) = x3 + 5, then ( fog)−1( x ) is
62. Let X be the set of all persons living in a city. equal to
Persons x, y in X are said to be related as x < y, x + 7
1/ 3
x − 7
1/ 3

if y is atleast 5 yr older than x. Which one of the (a)   (b)  

 3   2 
following is correct? 1/ 3 1/ 3
(c)  x −  (d)  x + 
7 7
(a) The relation is an equivalence relation on X
 2  2
(b) The relation is transitive but neither reflexive nor
symmetric 69. Let X be the set of all persons living in Delhi.
(c) The relation is reflexive but neither transitive nor The persons a and b in X are said to be related,
symmetric if the difference in their ages is atmost 5 yr. The
(d) The relation is symmetric but neither transitive nor relation is
reflexive (a) an equivalence relation
x (b) reflexive and transitive but not symmetric
63. For each non-zero real number x, let f ( x ) = .
|x| (c) symmetric and transitive but not reflexive
The range of f is (d) reflexive and symmetric but not transitive
(a) a null set 1
(b) a set consisting of only one element 70. If g( x ) = and f ( x ) = x , x ≠ 0, then which one of
f(x)
(c) a set consisting of two elements
the following is correct?
(d) a set consisting of infinitely many elements
(a) f(f(f(g (g (f(x )))))) = g (g (f(g (f(x )))))
 1 + x 3x + x3 (b) f(f(g (g (g (f(x )))))) = g (g (f(g (f(x )))))
64. If f ( x ) = loge   , g( x ) = and
 1 − x 1 + 3x 2 (c) f(g (f(g (g (f(g (x ))))))) = g (g (f(g (f(x )))))
 e − 1 (d) f(f(f(g (g (f(x )))))) = f(f(f(g (f(x )))))
gof ( t ) = g ( f ( t )), then what is gof   equal to?
 e + 1
71. f ( xy ) = f ( x ) + f ( y ) is true for all
(a) 2 (b) 1
1 (a) polynomial functions f (b) trigonometric functions f
(c) 0 (d)
2 (c) exponential functions f (d) logarithmic functions f
24 NDA/NA Pathfinder

72. Consider the following statements 76. Let R be a relation on the set N of natural
Statement I The function f : R → R such that numbers defined by ‘nRm ⇔ n is a factor of m’.
Then, which one of the following is correct?
f ( x ) = x3 for all x ∈ R is one-one.
e 2016 I
Statement II f ( a ) = f ( b) ⇒ a = b for all a , b ∈ R , if (a) R is reflexive, symmetric but not transitive
the function f is one-one. (b) R is transitive, symmetric but not reflexive
(c) R is reflexive, transitive but not symmetric
Which one of the following is correct in respect of
(d) R is an equivalence relation
the above statements?
(a) Both the statements are true and Statement II is the Directions (Q. Nos. 77-78) Let f ( x ) be the greatest
correct explanation of Statement I integer function and g( x ) be the modulus function.
(b) Both the statements are true and Statement II is not e 2016 I
the correct explanation of Statement I
77. What is ( gof )  −  − ( fog )  −  equal to?
5 5
(c) Statement I is true but Statement II is false
 3  3
(d) Statement I is false but Statement II is true
(a) −1 (b) 0
73. Suppose there is a relation * between the (c) 1 (d) 2
positive numbers x and y given by x * y if and
only if x ≤ y 2. Then which one of the following is 78. What is ( fof )  −  + ( gog ) ( −2) equal to?
9
correct?  5
(a) * is reflexive but not transitive and symmetric (a) −1 (b) 0
(b) * is transitive but not reflexive and symmetric (c) 1 (d) 2
(c) * is symmetric and reflexive but not transitive
(d) * is symmetric but not reflexive and transitive Directions (Q. Nos. 79-80) Consider the function
x −x  27( x 2/3 − x )
74. If f ( x1 ) − f ( x2 ) = f  1 2  for x1 , x2 ∈ ( −1, 1), then f (x ) = .
 1 − x1x2  4
what is f ( x ) equal to? 79. How many solutions does the function f ( x ) = 1
1− x  2 + x 
(a) ln   (b) ln   have?
1 + x   1− x  (a) One (b) Two
1− x  1 + x  (c) Three (d) Four
(c) tan−1   (d) tan−1  
1 + x  1− x 
80. How many solutions does the function f ( x ) = − 1
x2 have?
75. What is the range of the function y =
1 + x2 (a) One (b) Two
(c) Three (d) Four
where x ∈ R ?
(a) [0, 1) (b) [0, 1] (c) (0, 1) (d) (0, 1]

ANSWERS
1 b 2 b 3 a 4 a 5 b 6 d 7 d 8 c 9 a 10 b
11 b 12 b 13 c 14 b 15 a 16 b 17 d 18 a 19 a 20 a
21 a 22 b 23 a 24 b 25 c 26 c 27 c 28 a 29 b 30 b
31 a 32 c 33 d 34 d 35 b 36 a 37 d 38 b 39 c 40 a
41 c 42 c 43 b 44 c 45 c 46 c 47 c 48 d 49 c 50 b
51 c 52 c 53 b 54 d 55 d 56 b 57 c 58 a 59 c 60 c
61 a 62 b 63 c 64 b 65 c 66 c 67 b 68 b 69 d 70 b
71 d 72 a 73 a 74 a 75 a 76 c 77 c 78 b 79 b 80 a
MATHEMATICS Relations and Functions 25

HINTS AND SOLUTIONS

1. (b) Given, A = { 1, 2, 5, 6} ( 2 y − 1) y − 7
1/2
⇒ sin 3x = ⇒ x =  
and B = { 1, 2, 3} y  3 
A × B = {( 1, 1), (1, 2), (1, 3), (2, 1), Since, −1 ≤ sin 3x ≤ 1 x − 7
1/2
(2, 2), (2, 3), (5, 1), (5, 2), (5, 3), ( 2 y − 1) So, ( fog )−1 =  
We have, −1 ≤ ≤1 …(i)  3 
(6, 1), (6, 2), ( 6, 3)} y
B × A = {( 1, 1), (1, 2), (1, 5), (1, 6), Since, y > 0 multiplying the inequality 20. (a) f ( x ) = ( −1)[x ] = { −1, 1}, since [ x ] ∈Z
(2, 1), (2, 2), (2, 5), (2, 6), (3, 1), (3, 2), Eq. (i) by y, we obtain 21. (a) Since, for different values of x, 4x
(3, 5), (3, 6)}
− y ≤ 2 y − 1 ≤ y or 1 ≤ 3 y and y ≤ 1 and 4|x| are different positive numbers.
∴ ( A × B) ∩ ( B × A)
1
⇒ ≤ y≤1 ∴ f is one-one.
= {( 1, 1), (1, 2), (2, 1), ( 2, 2)}
3 Also, f is not onto as its range is (0, ∞)
2. (b)
12. (b) f ( − x ) = log[ − x + 1+ x2 ] and it is subset of its codomain R.
3. (a) Q R = {3, 6, 9, 12, 15, K , 99}
f ( x ) + f ( − x ) = log[ x + 1+ x2 ] 22. (b) Given, 2 f ( x ) + f ( 1 − x ) = x 2 …(i)
and S = {5, 10, 15, K , 95, 100}
Now, ( R × S ) ∩ ( S × R) Replacing x by ( 1 − x ), we get
+ log[ − x + 1+ x2 ]
2 f ( 1 − x ) + f ( x ) = ( 1 − x )2
= ( R ∩ S ) × ( S ∩ R)
= log [ 1 + x 2 − x 2 ] = log 1 = 0 ⇒ 2 f ( 1 − x ) + f ( x ) = 1 + x 2 − 2x …(ii)
= { 15, 30, 45, 60, 75, 90}
× { 15, 30, 45, 60, 75, 90} ∴ f ( −x ) = − f ( x ) Multiplying Eq. (i) by 2 and subtracting
∴ Number of elements in So, f ( x ) is an odd function of x. Eq. (ii) from Eq. (i), we get
( R × S ) ∩ ( S × R) = 6 × 6 = 36 13. (c) 3 f ( x ) = x 2 + 2x − 1
14. (b) f ( x + 1) − f ( x ) = 8 x + 3 x 2 + 2x − 1
4. (a) ⇒ f (x ) =
3
1
5. (b) f ( x ) = x − 2
2 ⇒ b [( x + 1)2 − x 2 ] + c [ x + 1 − x ]
23. (a) Clearly x R x as x − x + 2 = 2 is
x +( d − d ) = 8 x + 3 an irrational number.
2
∴ f   =   − ∴ 2bx + ( b + c ) = 8 x + 3
1 1 1
x x Thus, R is reflexive. Also, ( 2 , 1) ∈ R as
1/ x2 On comparing, 2 − 1 + 2 = 2 2 − 1 is an irrational
1
= 2 − x 2 = − f (x ) 2b = 8, b + c = 3 number but ( 1, 2 ) ∉R as
x ⇒ b = 4, c = − 1 1 − 2 + 2 = 1 is a rational number.
1+ x2 (1+ x 2 ) So, R is not symmetric. Since, 1R2 and
6. (d) f ( x ) =
2
= 15. (a) 2R 2, but 1 is not related to 2.
1− x 2
(1 + x ) (1 − x )
16. (b) fog( x ) = f [ g( x )] = f (|3x + 4|) So, R is not transitive.
f (x )⋅ f (x 2 ) Since, the domain of f is [ − 3, 5].
Now, 24. (b) The number of ordered pairs in the
1 + [ f ( x )]2 ∴ − 3 ≤ |3x + 4| ≤ 5 equivalence class of (3, 2) is the number
(1+ x ) (1+ x )
2
⇒ |3x + 4| ≤ 5 of ordered pairs ( a , b ) satisfying
× a 3
( 1 − x ) ( 1 + x )( 1 − x ) ⇒ − 5 ≤ 3x + 4 ≤ 5 ( a , b ) * (3, 2) i.e. 2a = 3b ⇒ =
= b 2
( 1 + x )2 1
1+ ⇒ − 9 ≤ 3x ≤ 1 ⇒ − 3 ≤ x ≤ Clearly, such ordered pairs are
( 1 − x )2 3
(3, 2), (6, 4), (9, 6), (12, 8), (15, 10) and
(1+ x 2 ) ∴ Domain of fog is  − 3, .
1
( 1 − x )2  3 
(18, 12)
= ∴ Number of ordered pairs = 6
( 1 − x )2 + ( 1 + x )2 17. (d)
( 1 − x )2 25. (c) The relation is defined as xRy, iff
18. (a) Let f ( x ) = y , then
1+ x2 (1+ x 2 ) 1 3x + 4 y = 5
= = = a =x+
y
x +1 2

If we take, ( x , y ) =  1, 
2 + 2x 2
2 (1+ x 2 ) 2 1
−y 1 x − x2 + 1  2
⇒a = =
x + x2 + 1 −1
and  ,  , then these pairs are
7. (d) 8. (c) 2 3
π  3 4
9. (a) f  x +  = |cos x | + |− sin x | 1
∴ a y − a − y = 2x ⇒ x = ( a y − a − y )
 2 2 satisfied by the given relation.
= |cos x | + |sin x | = f ( x ) −1 1 x −x 1 1
∴ f (x ) = (a − a ) 1R ⇔ 3⋅ 1 + 4⋅ = 5
10. (b) For f ( x ) to be defined, 2 2 2
x + 2≥ 0 ⇒ x ≥ − 2 2 3 2 3
19. (a) f ( x ) = 3x + 10 and g( x ) = x 2 − 1 and R ⇔ ⋅3 + 4⋅ = 5
and 1 − x > 0 and 1 − x ≠ 1 3 4 3 4
∴ fog = f [ g( x )] = 3[ g( x )] + 10
⇒ x < 1 and x ≠ 0 But 0 R 1 ∉R as
∴ x ∈ [ − 2, 0 [ ∪ ] 0, 1 [ = 3( x 2 − 1) + 10 = 3x 2 + 7 0 R 1 ⇔ 0 × 1+ 4 × 1 = 4 ≠ 5
y−7
11. (b) We have, 2 y − y sin 3x = 1 Let 3x 2 + 7 = y ⇒ x 2 = 26. (c) Since, f : R→ R such that
3
26 NDA/NA Pathfinder

f ( x ) = 3− x = f ( g( −2 / 3)) − g( f ( −2 / 3)) of same father and q and r be the

−2 2   [ −2 / 3 ]  children of same father.
Let y and y be two elements of f ( x )
1 2 = f  ×  − g 
such that y = y  3 3  −2 / 3  So, p and r are the children of same
1 2 father. Hence, R is transitive.
−x −x
⇒3 =3 ⇒ x =x = f  −  − g  
1 2 4 3
 9  2
1 2
Since, R have all three properties such
Since, if two images are equal, then their that reflexive, symmetry and transitive, so
elements are equal, therefore it is [ −4 / 9 ] 3 3 9 9
= − × = − =0 R is an equivalence relation.
one-one function. −4 / 9 2 2 4 4 x +5
Since, f ( x ) is positive for every value of 38. (b) f − 1 ( x ) =
33. (d) fof  −  + gog( −1)
7 3
x, therefore f ( x ) in into.  4 −1 y+5
On differentiating w.r.t. x, we get ⇒ f ( y) = ...(i)
dy = f ( f ( −7 / 4)) + g( g( −1)) 3
= − 3− x log3 < 0, for every value of x.  [ −7 / 4 ] 
dx = f  + g( −1 × 1) Q y = f (x ) ⇒ x = f − 1( y )
 −7 / 4  y+5
∴ It is decreasing function. ∴ x = ⇒ 3x = y + 5
−2 
∴ Statements I and III are true. = f  8
 + g( −1) = f   + ( −1) 3
 −7 / 4   7
27. (c) for f ( x ) to be real log (sin x ) ≥ 0 ⇒ y = 3x − 5 ⇒ f ( x ) = 3x − 5
2 [8 / 7] 7 1
⇒ sin x ≥ 20 ⇒ sin x = 1 = −1= −1= − 39. (c) Given, A = { x ∈ R|x ≥ 0}
π 8/7 8 8
⇒ x = ( 4n + 1) , n ∈ N f : A → A, f ( x ) = x 2
2 34. (d) Given that, f ( xy ) = f ( x ) f ( y )
Y
28. (a) f ( x ) is defined, if 3x 2 − 4x + 5 ≥ 0 From option (d), we take f ( t ) = t k y = x2

3 x 2 − x +  ≥ 0
4 5 Then, f ( xy ) = ( xy )k = ( x k ) ( y )k
⇒
 3 3  = f (x ) ⋅ f ( y) X′ X
 2
11
3  x −  +
2 O
⇒ ≥ 0 35. (b) Given, A = { 0, 1, 2}, B = {2, 3}
 3  9

C = {3, 4}
Which is true for all real x. Y′
∴ A ∪ B = { 0, 1, 2, 3}
∴ Domain ( f ) = ( − ∞ , ∞ ) = R From adjoining figure, f ( x ) is one-one
∴( A ∪ B ) × C = { 0, 1, 2, 3} × {3, 4} and onto, so its inverse exists.
29. (b) g[ f ( x )] = log e ( 3x 2 − 4x + 5 )2
= {(0, 3), (0, 4), (1, 3), (1, 4), (2, 3), Let f (x) = y
= log e (3x 2 − 4x + 5) −1
(2, 4), (3, 3), (3, 4)} ∴x 2 = y ⇒ x = y ⇒ f (x ) = x
Let y = log e (3x 2 − 4x + 5) So, required number of elements So, f is not its own inverse.
⇒ e y = 3x 2 − 4x + 5 containing by ( A ∪ B ) × C is 8.
⇒ 3 x 2 − 4 x + (5 − e y ) = 0 40. (a) I. Given, f ( x ) = x 3 and g( y ) = y 3
36. (a) Given, relation is
Since, both the functions are identical.
For x to be real, discriminant ≥ 0 R = {( 1, 2), ( 1, 3), ( 2, 1), ( 1, 1), ( 2, 2), ∴ f = g
∴ 16 − 12(5 − e y ) ≥ 0 (3, 3), ( 2, 3)} II. We know that, an identity function
⇒ 12e y ≥ 44 and P = { 1, 2, 3} f ( x ) = y = x is always one-one and onto
11 11 function, i.e. bijective function.
⇒ ey ≥ ⇒ y ≥ log e Reflexive In R, 1R 1, 2R 2 and 3R3, Y
3 3 where 1, 2, 3 ∈ P.
y=x
 11 
∴ Range of f = log e , ∞  So, R is reflexive.
 3 
Symmetry In R , 1R3 ⇒ / 3R1 and 2 R3 X′ X
⇒ O
30. (b) f ( x , x ) = x =x [Q 2 + 3 < 32 ] / 3 R2
2 3 2+3 5
and f ( x , x ) = x So, R is not symmetric.
5 6 5 + 6− 3
=x [Q 5 + 6 > 32 ] Transitive In R, 1R2 and 2R3 ⇒ 1R 3 Y′
8

∴ f [ f ( x , x ), f ( x , x )] = f ( x , x ) So, R is transitive. Hence, only Statement I is true.

2 3 5 6 5 8
Thus, R is reflexive, transitive but not 41. (c) Given that,
=x
5 + 8− 3 symmetric. A = { x , y }, B = { 2, 3}, C = {3, 4}
=x
[Q 5 + 8 > 32 ]
10 37. (d) R = {x : x is a set of all children of a ∴ B ∪ C = { 2, 3} ∪ {3, 4} = { 2, 3, 4}
2 ×3
31. (a) g( x , x ) = x Q → m = 1 same father} and A × ( B ∪ C ) = { x , y } × { 2, 3, 4}
1  
2 3
 5
Reflexive Let p be the children of same = {( x , 2),( x ,3),( x , 4),( y , 2),( y ,3),( y , 4)}
7 ×8
and g( x , x ) = x Q → m = 1 father. Hence, pRp is a reflexive.
∴ Number of elements in A × ( B ∪ C )
1 
7 8
 5 Symmetry Let p and q be the children i.e. n{ A × ( B ∪ C )} = 6
∴ g [ g( x , x ), g( x , x )] of same father.
2 3 7 8 42. (c) If R is a non-empty set, then a
1× 1
= g( x , x ) Q → m = 1 So, q and p are the children of same relation A from R to R is a subset of
1 1   father. Hence, R is symmetric.
5 R × R , i.e. A ⊆ ( R × R)
=x
1
Transitive Let p and q be the children
32. (c) fog( −2 / 3) − gof ( −2 / 3) 43. (b) Given that, f : N → N
MATHEMATICS Relations and Functions 27

and f ( x ) = x + 1, for x ∈ N , Considering f ( x ) and f ( x ) (I) u (II) u p

1 2 p
if x , x ∈N , then f ( x ) = f ( x ) Such that f (x ) = f (x ) v v
1 2 1 2 1 2 w q w q
⇒ x + 1= x + 1 ⇒ x = x ⇒ 2x = 2x ⇒ x = x x r x r
1 2 1 2 1 2 1 2 y
y
i.e. f ( x ) is one-one. So, f is one-one. z s z s
Range of f ( x ) ∈ N − { 1} For onto Let y = f ( x) (function) (not function)
y
∴ Range ⊆ Codomain Then, y = 2x ⇒ x = (III) u p (IV) u
2 p
v v
So, f ( x ) is into function. q q
∴ x ∈ N for every y ∈ A w w
Hence, f is one-one but not onto. x r x r
[every element of codomain has y y
|x | z s s
44. (c) Given function, f ( x ) = , x ≠ 0 pre-image in domain] z
x (not function) (function)
So, f is onto.
Redefine the given function,
Hence, f is both one-one and onto. 53. (b) Given that, f : Z → N
 x , x > 0  1, x > 0
 and f ( x ) = |x |
f ( x ) =  −xx = 50. (b) Given that,
−1, x < 0 Graph of f ( x ) =|x |
 , x<0  X = {Set of all citizens of India}
 x Y
∴ Range of f ( x ) = { −1, 1} and R = {(x , y ) : x , y ∈ X , |x − y | = 5}
y =| x |
45. (c) Given that, A = { 1, 2 }, B = { 2, 3} Reflexive |x − x | = 0 ≠ 5
and C = {3,4} ∴ xRx ∉ R
Now, ( A × B ) = { 1, 2 } × { 2, 3} So, R is not reflexive. X′ X
O
= {( 1, 2),( 1, 3), ( 2, 2),( 2, 3)} Symmetric Again, xR y
and ( A × C ) = { 1, 2 } × {3, 4} ⇒ x − y =5
= {( 1, 3), ( 1, 4), ( 2, 3), ( 2, 4)} ⇒ | y − x |= 5 ⇒ yRx Y′
∴( A × B ) ∩ ( A × C ) = {( 1, 3), ( 2, 3)} So, R is symmetric. We see that, if we draw a parallel line
So, the cardinality of Transitive Let x , y , z ∈ X along X-axis. It cuts the curve into more
( A × B ) ∩ ( A × C ) is 2. than one point. So, function f ( x ) = |x | is
Then, xRy ⇒ |x − y| = 5
not one-one.
46. (c) and yRz ⇒ | y − z| = 5 Since, f ( x ) = |x | is always
47. (c) Here, n ( A ) = 4 and n ( B ) = 3 But |x − z| ≠ 5 non-negative.
∴ n ( A × B ) = n ( A) × n ( B) So, R is not transitive. ∴ Range of f = Set of non-negative
integers = Codomain of f
= 4 × 3 = 12 Hence, the relation is symmetric but
⇒ f ( x ) is onto.
neither reflexive nor transitive.
48. (d) Given, R = {( a , b ): a − b is Thus, f ( x ) = |x | is onto but not
divisible by 5} 51. (c) Given that, S = Set of all integers. one-one.
Reflexive ( a − a ) is divisible by 5 for and R = {(a, b), a, b ∈ S and ab ≥ 0}
54. (d)
all a ∈ Z . So, R is reflexive. Reflexive a R a
55. (d) We have, f ( x ) = ax + b
Symmetric Let ( a , b ) ∈ R ⇒ ( a − b ) is ⇒ a ⋅ a = a 2 ≥ 0, ∀a ∈ S and g( x ) = cx + d
divisible by 5. So, R is reflexive. f [ g( x )] = a( cx + d ) + b
⇒( b − a ) is divisible by 5 ⇒ b − a ∈ R Symmetric a R b ⇒ ab ≥ 0, ∀ a , b ∈ S = acx + ad + b
So, R is symmetric. ⇒ b ⋅ a ≥ 0 ⇒ bRa and g [ f ( x )] = c ( ax + b ) + d
Transitive Let ( a , b ) ∈ R and (b, c) ∈R = acx + bc + d
So, R is symmetric.
Q f [ g( x )] = g [ f ( x )]
⇒( a − b ) and ( b − c ) are both divisible Transitive If aR b ⇒ ab ≥ 0
by 5. ⇒ ad + b = bc + d ⇒ f ( d ) = g( b )
and b R c ⇒ b c ≥ 0, ∀ a , b , c ∈ S
⇒ a − b + b − c is divisible by 5. 56. (b) We have, f : N → N
Then, ac ≥ 0 ⇒ aR c f ( x ) = 2x + 3 ⇒ f ′( x ) = 2 > 0
⇒ ( a − c ) is divisible by 5.
So, R is also transitive. So, f ( x ) is increasing, ∀x ∈ N .
⇒ ( a , c) ∈ R Hence, f ( x ) is injective.
Hence, R is an equivalence relation.
So, R is transitive. Let f (x ) = y
52. (c) Given that, A = {u, v, w, x, y, z}
Thus, R is reflexive, symmetric and ⇒ y = 2x + 3
transitive. and B = {p , q , r , s } y −3
We know that, a mapping f : x → y is ⇒ x =
Hence, R is an equivalence relation. 2
said to be a function, if each element in 1
49. (c) Let A = {Set of even natural the set x has its image in set y. It is also Let y=4 ⇒ x =
number} 2
possible that there are few elements in
Given, f : N → A and f ( x) = 2x set y which are not the image of any i.e. y ∈ N but x ∉ N
element in set x. Every element in set x Hence, f ( x ) is not surjective.
For one-one Let x , x ∈ R
1 2 should have one and only one image.
28 NDA/NA Pathfinder

57. (c) The relation S is defined on the set of 62. (b) We have, X = Set of all persons III. We have, f ( x ) = e x , x ∈ R
integers Z and xSy, if integer x divides living in a city ⇒ f ′( x ) = e x > 0
integer y. Let R be a relation on X , define as So, f is increasing function.
Reflexive Since, every integer divides x < y , if y is atleast 5 yr older than x. ⇒ f is one-one.
itself.
Since, x cannot be less than x itself, so R Hence, f is invertible on its range.
∴ Integer x divides integer x ⇒ xSx
is not reflexive. Now, let xRy, then
Hence, S is reflexive. 66. (c) We have, aRb, where a , b ∈ Z,
x < y , i.e. y is atleast 5 yr older than x.
Symmetric Let x , y ∈ z such that xSy if ( a − b ) is divisible by 5.
Thus, x is smaller than y. Hence, R is
i.e. integer x divides integer y. not symmetric. Thus, ( a − b ) = 0, 5, 10, 15, K
But this does not implies that integer y So, Statement I is true, since the relation
Now, let xRy and yRz, then x < y and
divides integer x. R partitions Z into five equivalent
y < z, clearly x < z.
Thus, S is not symmetric. classes, which are, 0, 1, 2, 3, 4.
Hence, R is transitive.
Transitive Let x , y , z ∈ Z such that x Also, any two equivalent classes are either
xSy and ySz 63. (c) We have, f ( x ) = , for x =/ 0 disjoint or equal.
|x |
⇒ Integer x divides integer y and Hence, both the statements are true.
integer y divides integer z.  x , if x > 0 1
67. (b) Given, f ( x ) =
⇒ Integer x divides integer z. i.e. f ( x ) =  x |x | − x
⇒ xSz x
 , if x < 0
⇒ Hence, S is transitive.  −x Here, f ( x ) is defined only when
x −1 1, if x > 0 | x | − x > 0 or | x | > x
58. (a) We have, f ( x ) = 
= which is possible only for negative values
x+1 −1, if x < 0 of x.
Applying componendo and dividendo,
we get Thus, range of f = { 1, − 1}. ∴ Domain of f is ( − ∞ , 0).
f (x ) + 1 x − 1+ x + 1 1+ x 
= 64. (b) We have, f ( x ) = log e   68. (b) Given, f ( x ) = 2x − 3
f (x ) − 1 x − 1− x − 1  1− x 
f (x ) + 1 3x + x 3 and g( x ) = x 3 + 5
⇒ = −x and g( x ) =
f (x ) − 1 1 + 3x 2 Now, fog( x ) = f ( g( x ))
 ( e − 1)  = 2( x 3 + 5) − 3
f (x ) + 1 1+ 
Now, + x = −x + x = 0  e − 1  ( e + 1) 
f (x ) − 1 ∴f   = log e = 2x 3 + 10 − 3 = 2x 3 + 7
 e + 1  ( e − 1) 
1−  Let fog ( x ) = y , then
59. (c) We have,  ( e + 1) 
1/3
y − 7
x −1 2x − 1 = log e 
e + 1 + e − 1
 y = 2x 3 + 7 ⇒ x =  
f (x ) = ⇒ f ( 2x ) =  e + 1 − e + 1  2 
x + 1 2x + 1 1/3
= log e   = log e ( e ) = 1…(i) x − 7
∴( fog )− 1 ( x ) = 
2e
2[ f ( x ) + 1]  2 
−1  2 
1− f (x ) e − 1   e − 1 
⇒ f ( 2x ) = gof   = gf   69. (d) Given, R = {( a , b ) : |a − b | ≤ 5}
2[ f ( x ) + 1]  e + 1   e + 1 
+ 1 Reflexive ( a , a ) ∈ R
1 − f (x )
= g ( 1) [using Eq. (i)] ( a , a ) = | a − a | = 0, 0 ≤ 5, ( a , a ) ∈ R
  3( 1) + ( 1)3 4
Q x = f ( x ) + 1  = = =1 Hence, R is reflexive.
 1 − f (x ) 1 + 3( 1)2 4 Symmetric ( a , b ) ∈ R
 
65. (c) I. We have, f ( x ) = x 3 , x ∈ R ⇒ ( b, a) ∈ R
3 f (x ) + 1
⇒ f ( 2x ) = ⇒ f ′( x ) = 3x 2 ≥ 0 ( a, b) = | a − b | ≤ 5 ,
f (x ) + 3
⇒ f is increasing function. ( b, a) = | b − a | ≤ 5
x −1
60. (c) We have, f ( x ) = So, f is one-one. ∴ ( a, b) ∈ R ⇒ ( b, a) ∈ R
x+1
Hence, f is invertible on its range. Hence, R is symmetric.
f (x ) − 1
⇒ f [ f ( x )] = Transitive ( a , b ) ∈ R, ( b , c ) ∈ R
f (x ) + 1 II. We have, f ( x ) = sin x , 0 < x < 2 π
π π ⇒ ( a , c) ∈ R
Clearly, f   = sin =
3
⇒ f [ f ( x )] = −
1 3 3 2 ( a , b ) = | a − b | ≤ 5,
2π π
and f  
x
 = sin  π −  ( b , c ) = |b – c |≤ 5
    3  3
Q x = −  f ( x ) + 1  π
|a − b |+ |b − c | ≤ 10, |a − c | ≤ 10
= sin   =
3
  f ( x ) − 1 ∴ ( a , c) ∉ R
 3 2
Hence, R is not transitive.
61. (a) Number of distinct relations from So, f is not one-one.
So, R is reflexive and symmetric but not
B to A = 24 × 3 = 212 = 4096 Hence, f is not invertible on its
transitive.
range.
MATHEMATICS Relations and Functions 29

70. (b) Given, g( x ) =

1
and f ( x ) = x  1 − x1 − x 2  27( x 2 / 3 − x )
  79. (b) Given function, f ( x ) =
f (x )  x −x  1− x x  4
and f  1 2  = ln  1 2
∴
1
g( x ) = , x ≠ 0  1− x x   x −x  If f (x ) = 1
 1 2  1+ 1− x x 
1 2
x
 27( x 2 / 3 − x ) 4
1 1 1 2  ⇒ 1= ⇒ x 2/3 − x =
Clearly, g( f ( x )) = = 4 27
f (x ) x  1− x x − x + x  Let x1 / 3 = α ⇒ x = α3
1 = ln  1 2 1 2 …(ii)
g( g ( f ( x ))) = =x  1− x x + x − x  Then, α − α 3 =
2 4
 1  1 2 1 2 …(i)
  27
x
∴ From Eqs. (i) and (ii), we get ⇒ α 2 (1 − α ) = × ×
2 2 1
1 1
g( g( g( f ( x )))) = =  x −x  3 3 3
(x ) x f (x ) − f (x ) = f  1 2  2 2 1
1 1 2  1− x x  ⇒ α ⋅ α (1 − α ) = × ×
f ( g( g( g( f ( x ))))) =  1 2 3 3 3
x 2 2
1 x2 ⇒ α= ⇒ x1 / 3 =
f ( f ( g( g( g( f ( x )))))) = 75. (a) Let f ( x ) = 3 3
x 1 + x2 8
1 ∴ x =
and g( f ( x )) = 27
x Clearly, domain ( f ) = R
1 x2 Also, from Eq. (i)
f ( g( f ( x ))) = Let y = f ( x ) ⇒ y = 4
x 1+ x2 α2 − α3 =
1 ⇒ y + x y = x ⇒ x2 − x2y = y
2 2 27
g( f ( g( f ( x )))) = =x
⇒ α ⋅ α( 1 − α ) =  −  ×  −  ×  
 1 y 1 1 4
  ⇒ x 2 (1 − y ) = y ⇒ x = ±  3  3  3 
x 1− y
α = − ⇒ x 1 / 3 =  − 
1 1 1
g( g( f ( g( f ( x ))))) = Clearly, x will take real values, ⇒
3  3
x y y−0
From option (b), LHS = RHS if ≥0⇒ ≤0 1
1− y y−1 ⇒ x =−
71. (d) Let f ( x ) = log x + – + 27
–∞ ∞ Hence, f ( x ) has two solutions.
∴ f ( xy ) = log( xy ) 0 1
Now, f ( x ) + f ( y ) = log x + log y ⇒ 0 ≤ y < 1 ⇒ y ∈[ 0, 1) 27( x 2 / 3 − x )
80. (a) Given, f ( x ) =
Hence, range f ( x ) is [ 0, 1). 4
= log ( xy ) = f ( xy )
76. (c) Given, R is a relation on the set N of We have, f (x ) = − 1
Hence, f ( x ) + f ( y ) = f ( xy ) natural numbers defined by nRm ⇔ n is a 27( x 2/3
− x)
72. (a) I. is correct, since f ( x ) = x 3 is factor of m. ⇒ = −1
4
one-one, ∀ x ∈ R. Reflexive Since, n is a factor of n for
each n ∈ N , therefore, nRn, ∀ n ∈ N , i.e. 4
Q f ( a) = f ( b) ⇒ a3 = b 3 ⇒ a = b ⇒ x 2/3 − x = −
R is reflexive. 27
II. is also correct and is the correct
Symmetric Note that 2 is a factor of 4 Let x1 / 3 = α ⇒ x = α3
explanation of Statement I. but 4 is not a factor of 2, i.e. 2R4 but 4
Then, α2 − α3 = −
73. (a) Reflexive Given, xRy ⇒ x is less 4 R/ 2 . Thus, R is not symmetric. 27
than y 2 . Hence, option (c) is correct. 4 4
⇒ α3 − α2 = ⇒ α3 = α2 +
∴ xRx ⇒ x is less than x 2 .
77. (c) ( gof )  −  − ( fog )  − 
5 5 27 27
which is true. Hence, R is reflexive.  3  3
Y
Symmetric xRy is not equivalent to  5   5  y=α2 + 4/27
yRx because = g  f  −   − f  g  −   2
  3    3 
1R 2 ⇒ 1 is less than 22 . 1
 5   5 
2R 1 ⇒ 2 is less than 12 . = g   −   − f  −  X′ X
  3     3  −4 −3 −2 −1 0 1 2 3 4
Thus, it is not symmetric. Hence, option
= g( −2) − f  
5 −1
(a) is correct.
3 −2
1− x 
74. (a) Let f ( x ) = ln    5 y=α3
 1+ x  = |− 2|− = 2 − 1= 1 Y′
 3 
Now, f ( x ) − f ( x ) Since, the graph of y = α 3 and
78. (b) ( fof )  −  + ( gog ) ( −2)
1 2 9
 1− x   1− x  4
= ln  1  − ln  2   5 y = α2 + intersects at only one
 1+ x   1+ x  27
 1  2  9 
= f  f  −   + g( g( −2)) point.
 ( 1 − x )( 1 + x )    5
= ln  1 2 
∴ α3 = α2 +
4
 ( 1 − x )( 1 + x )  has only one solution.
 1   9 
2 = f   −   + g(| − 2 |) 27
 1+ x − x − x x    5   4
Hence, x − x 2 / 3 = has only one
= ln  2 1 1 2 …(i) 27
 1+ x − x − x x  = f ( −2) + g( 2) = − 2 + 2 = 0
 1 2 1 2 solution.