Chapter 1 - Relations and Functions

Definitions:
Let A and B be two non-empty sets, then a function f from set A to set B is a rule which associates
each element of A to a unique element of B.
o Relation
If (a, b) ∈ R, we say that a is related to b under the relation R and we write as a R b
o Function
It is represented as f: A → B and function is also called mapping.
o Real Function
f: A → B is called a real function, if A and B are subsets of R.
o Domain and Codomain of a Real Function
Domain and codomain of a function f is a set of all real numbers x for which f(x) is a real
number. Here, set A is domain and set B is codomain.
o Range of a real function
f is a set of values f(x) which it attains on the points of its domain
Types of Relations
o A relation R in a set A is called Empty relation, if no element of A is related to any element of
A, i.e., R = φ ⊂ A × A.
o A relation R in a set A is called Universal relation, if each element of A is related to every
element of A, i.e., R = A × A.
o Both the empty relation and the universal relation are sometimes called Trivial Relations
o A relation R in a set A is called
▪ Reflexive
▪ if (a, a) ∈ R, for every a ∈ A,
▪ Symmetric
▪ If (a1, a2) ∈ R implies that (a2, a1) ∈ R, for all a1, a2∈ A.
▪ Transitive
▪ If (a1, a2) ∈ R and (a2, a3) ∈ R implies that (a1, a3) ∈ R, for all a1, a2, a3 ∈ A.

o A relation R in a set A is said to be an equivalence relation if R is reflexive, symmetric and

transitive
o The set E of all even integers and the set O of all odd integers are subsets of Z satisfying following
conditions:
▪ All elements of E are related to each other and all elements of O are related to each other.
▪ No element of E is related to any element of O and vice-versa.
▪ E and O are disjoint and Z = E ∪ O.
▪ The subset E is called the equivalence class containing zero, Denoted by [0].
▪ O is the equivalence class containing 1 and is denoted by [1].
o Note
▪ [0] ≠ [1]
▪ [0] = [2r]
▪ [1] = [2r + 1], r ∈ Z.

o Given an arbitrary equivalence relation R in an arbitrary set X, R divides X into mutually disjoint
subsets Ai called partitions or subdivisions of X satisfying:
▪ All elements of Ai are related to each other, for all i.
▪ No element of Ai is related to any element of Aj, i ≠ j.
▪ ⋃ Aj = X and Ai ∩ Aj = φ, i ≠ j.
o The subsets Ai are called equivalence classes.
Note:
o Two ways of representing a relation
▪ Roaster method
▪ Set builder method
o If (a, b) ∈ R, we say that a is related to b and we denote it as a R b.

Types of Functions
Consider the functions f1, f2, f3 and f4 given

• A function f: X → Y is defined to be one-one (or injective), if the images of distinct elements

of X under f are distinct, i.e., for every x1, x2 ∈ X, f(x1) = f(x2) implies x1 = x2. Otherwise, f is called
many-one.
Example
o One- One Function

o Many-One Function

• A function f: X → Y is said to be onto (or surjective), if every element of Y is the image of some
element of X under f, i.e., for every y ∈ Y, there exists an element x in X such that f(x) = y.
 o f: X → Y is onto if and only if Range of f = Y.
o Eg:

• A function f: X → Y is said to be one-one and onto (or bijective), if f is both one-one and
onto.
o Eg:

Composition of Functions and Invertible Function

Composite Function
• Let f: A → B and g: B → C be two functions.
• Then the composition of f and g, denoted by g o f, is defined as the function g o f: A → C given by
g o f(x) = g (f(x)), ∀ x ∈ A.

• Eg:
o Let f : {2, 3, 4, 5} → {3, 4, 5, 9} and g : {3, 4, 5, 9} → {7, 11, 15} be functions
o Defined as f (2) = 3, f (3) = 4, f (4) = f (5) = 5 and g (3) = g (4) = 7 and g (5) = g (9) = 11.
o Find g o f.
o Solution
▪ g o f(2) = g (f(2)) = g (3) = 7,
▪ g o f (3) = g (f(3)) = g (4) = 7,
▪ g o f (4) = g (f(4)) = g (5) = 11 and
▪ g o f (5) = g (5) = 11

• It can be verified in general that gof is one-one implies that f is one-one. Similarly, gof is onto
implies that g is onto.
• While composing f and g, to get gof, first f and then g was applied, while in the reverse process of
the composite gof, first the reverse process of g is applied and then the reverse process of f.
• If f: X → Y is a function such that there exists a function g: Y → X such that gof = IX and fog =
IY, then f must be one-one and onto.
Invertible Function
• A function f: X → Y is defined to be invertible, if there exists a function g: Y → X such that gof =
IX and fog = IY. The function g is called the inverse of f
• Denoted by f–1.

• Thus, if f is invertible, then f must be one-one and onto and conversely, if f is one-one and onto,
then f must be invertible.

Theorem 1
• If f : X → Y, g : Y → Z and h : Z → S are functions, then
o h o (g o f) = (h o g) o f.
• Proof
We have
o h o (g o f) (x) = h(g o f (x)) = h(g(f(x))), ∀ x in X
o (h o g) o f (x) = h o g (f(x)) = h (g (f(x))), ∀ x in X.

Hence, h∘ (g∘f) = (h∘g) ∘ f

Theorem 2
• Let f: X → Y and g: Y → Z be two invertible functions.
o Then gof is also invertible with (g o f)-1 = f -1 o g-1
• Proof
o To show that gof is invertible with (g o f)-1 = f -1 o g-1, it is enough to show that
(f -1 o g-1) o (g o f) = IX and (g o f) o (f -1 o g-1) = IZ.
Now, (f–1 o g–1) o (g o f) = ((f–1 o g–1) o g) of, by Theorem 1
= (f -1 o (g -1 o g)) of, by Theorem 1
= (f-1 o IY) of, by definition of g–1
= IX
Similarly, it can be shown that (g o f) o (f-1 o g-1) = IZ
 Relations and Functions
Short Answer Type Questions
Q. 1 Let A = {a, b, c} and the relation R be defined on A as follows
R = {(a, a), (b, c ), (a, b)}
Then, write minimum number of ordered pairs to be added in R to make
R reflexive and transitive.
Sol. Given relation, R = {(a, a), (b, c ), (a, b )}.
To make R is reflexive we must add (b, b ) and (c, c ) to R. Also, to make R is transitive we must
add (a, c ) to R.
So, minimum number of ordered pair is to be added are (b, b ), (c, c ), (a, c ).

Q. 2 Let D be the domain of the real valued function f defined by

f (x ) = 25 - x 2 . Then, write D.
Sol. Given function is, f(x ) = 25 - x 2
For real valued of f(x ) 25 - x 2 ³ 0
x 2 £ 25
-5 £ x £ + 5
\ D = [-5, 5]

Q. 3 If f , g : R ® R be defined by f ( x ) = 2x + 1 and g( x ) = x 2 - 2, " x Î R,

respectively. Then, find gof .
K Thinking Process
If f , g : R ® R be two functions, then gof(x) = g { f(x)}, "x ÎR.
Sol. Given that, f(x ) = 2 x + 1 and g (x ) = x 2 - 2, "x Î R
\ gof = g {f(x )}
= g (2 x + 1) = (2 x + 1)2 - 2
= 4x 2 + 4x + 1 - 2
= 4x 2 + 4x - 1
Q. 4 Let f : R ® R be the function defined by f (x) = 2x - 3, " x Î R. Write
-1
f .
Sol. Given that, f(x ) = 2 x - 3, " x Î R
Now, let y = 2x - 3
2x = y + 3
y+ 3
x=
2
x+ 3
\ f -1(x ) =
2

Q. 5 If A = {a, b, c, d } and the function f = {(a, b), (b, d), (c, a), (d, c)}, write
-1
f .
Sol. Given that, A = {a, b, c, d }
and f = {(a, b ), (b, d ), (c, a), (d , c )}
f -1 = {(b, a), (d , b ), (a, c ), (c, d )}

Q. 6 If f : R ® R is defined by f (x) = x 2 - 3x + 2, write f { f (x)}.

K Thinking Process
To solve this problem use the formula i.e., (a + b + c)2 = (a2 + b2 + c2 + 2 ab + 2bc + 2 ca)
Sol. Given that, f(x ) = x 2 - 3x + 2
\ f{f(x )} = f(x 2 - 3x + 2 )
= (x 2 - 3x + 2 )2 - 3(x 2 - 3x + 2 ) + 2
= x 4 + 9x 2 + 4 - 6x 3 - 12 x + 4x 2 - 3x 2 + 9x - 6 + 2
= x 4 + 10x 2 - 6x 3 - 3x
f {f(x )} = x 4 - 6x 3 + 10x 2 - 3x

Q. 7 Is g = {(1, 1), (2, 3), (3, 5), (4, 7)} a function? If g is described by
g(x) = a x + b, then what value should be assigned to a and b?
Sol. Given that, g = {(1, 1), (2, 3), (3, 5), (4, 7)}.
Here, each element of domain has unique image. So, g is a function.
Now given that, g (x ) = ax + b
g(1) = a + b
a + b =1 …(i)
g(2 ) = 2 a + b
2a + b = 3 …(ii)
From Eqs. (i) and (ii),
2(1 - b ) + b = 3
Þ 2 - 2b + b = 3
Þ 2 -b = 3
b = -1
If b = - 1, then a = 2
a = 2, b = - 1
Q. 8 Are the following set of ordered pairs functions? If so examine whether
the mapping is injective or surjective.
(i) {(x, y) : x is a person, y is the mother of x}.
(ii) {(a, b) : a is a person, b is an ancestor of a}.
Sol. (i) Given set of ordered pair is {(x, y) : x is a person, y is the mother of x}.
It represent a function. Here, the image of distinct elements of x under f are not distinct,
so it is not a injective but it is a surjective.
(ii) Set of ordered pairs = {(a, b ) : a is a person, b is an ancestor of a}
Here, each element of domain does not have a unique image. So, it does not represent
function.

Q. 9 If the mappings f and g are given by f = {(1, 2), (3, 5), (4, 1)} and
g = {(2, 3), (5, 1), (1, 3)}, write fog.
Sol. Given that, f = {(1, 2), (3, 5), (4, 1)}
and g = {(2, 3), (5, 1), (1, 3)}
Now, fog (2 ) = f{g (2 )} = f(3) = 5
fog (5) = f{g (5)} = f(1) = 2
fog (1) = f{g (1)} = f(3) = 5
fog = {(2, 5), (5, 2 ), (1, 5)}

Q. 10 Let C be the set of complex numbers. Prove that the mapping

f : C ® R given by f (z) = | z |, " z Î C, is neither one-one nor onto.
Sol. The mapping f :C ® R
Given, f( z) = z , " z Î C
f(1) = |1| = 1
f(-1) = |- 1| = 1
f(1) = f(-1)
But 1¹ -1
So, f( z) is not one-one. Also, f( z) is not onto as there is no pre-image for any negative
element of R under the mapping f( z).

Q. 11 Let the function f : R ® R be defined by f (x) = cos x, " x Î R. Show

that f is neither one-one nor onto.
Sol. Given function, f(x ) = cos x , " x Î R
æpö p
Now, f ç ÷ = cos = 0
è2 ø 2
æ -p ö p
Þ fç ÷ = cos = 0
è 2 ø 2
æpö æ -p ö
Þ fç ÷=fç ÷
è ø
2 è 2 ø
p -p
But ¹
2 2
So, f(x ) is not one-one.
Now, f(x ) = cos x, " x Î R is not onto as there is no pre-image for any real number. Which
does not belonging to the intervals [-1, 1], the range of cos x.
Q. 12 Let X = {1, 2, 3} and Y = {4, 5}. Find whether the following subsets of
X ´ Y are functions from X to Y or not.
(i) f = {(1, 4), (1, 5), (2, 4), (3, 5)} (ii) g = {(1, 4), (2, 4), (3, 4)}
(iii) h = {(1, 4), (2, 5), (3, 5)} (iv) k = {(1, 4), (2, 5)}
Sol. Given that, X = {1, 2, 3} and Y = {4, 5}
X ´ Y = {(1, 4), (1, 5), (2, 4), (2, 5), (3, 4), (3, 5)}
(i) f = {(1, 4), (1, 5), (2, 4), (3, 5)}
f is not a function because f has not unique image.
(ii) g = {(1, 4), (2, 4), (3, 4)}
Since, g is a function as each element of the domain has unique image.
(iii) h = {(1, 4), (2, 5), (3, 5)}
It is clear that h is a function.
(iv) k = {(1, 4), (2, 5)}
k is not a function as 3 has not any image under the mapping.

Q. 13 If functions f : A ® B and g : B ® A satisfy gof = I A , then show that

f is one-one and g is onto.
Sol. Given that,
f : A ® B and g : B ® A satisfy gof = I A
Q gof = I A
Þ gof{f(x1 )} = gof{f(x 2 )}
Þ g ( x1 ) = g ( x 2 ) [Q gof = I A ]
\ x1 = x 2
Hence, f is one-one and g is onto.

1
Q. 14 Let f : R ® R be the function defined by f (x) = , " x Î R.
2 - cos x
Then, find the range of f .
K Thinking Process
Range of f = { y ÎY : y = f(x) : for some in x} and use range of cos x is [-1,1]
1
Sol. Given function, f( x ) = , " x ÎR
2 - cos x
1
Let y=
2 - cos x
Þ 2 y - ycos x = 1
Þ ycos x = 2 y - 1
2y - 1 1 1
Þ cos x = =2 - Þ cos x = 2 -
y y y
1
Þ -1 £ cos x £ 1 Þ -1 £ 2 - £ 1
y
1 1
Þ - 3 £ - £ -1 Þ 1£ £ 3
y y
1 1
Þ £ £1
3 y
é1 ù
So, y range is ê , 1ú.
ë3 û
Q. 15 Let n be a fixed positive integer. Define a relation R in Z as follows " a,
b Î Z , aRb if and only if a - b is divisible by n. Show that R is an
equivalence relation.
Sol. Given that, " a, b Î Z, aRb if and only if a - b is divisible by n.
Now,
I. Reflexive
aRa Þ (a - a) is divisible by n, which is true for any integer a as ‘O’ is divisible by n.
Hence, R is reflexive.
II. Symmetric
aRb
Þ a - b is divisible by n.
Þ - b + a is divisible by n.
Þ -(b - a) is divisible by n.
Þ (b - a) is divisible by n.
Þ bRa
Hence, R is symmetric.
III. Transitive
Let aRb and bRc
Þ (a - b ) is divisible by n and (b - c )is divisible by n
Þ (a - b ) + (b - c ) is divisibly by n
Þ (a - c ) is divisible by n
Þ aRc
Hence, R is transitive.
So, R is an equivalence relation.

Long Answer Type Questions

Q. 16 If A = {1, 2, 3, 4}, define relations on A which have properties of being
(i) reflexive, transitive but not symmetric.
(ii) symmetric but neither reflexive nor transitive.
(iii) reflexive, symmetric and transitive.
Sol. Given that, A = {1, 2, 3, 4}
(i) Let R1 = {(1, 1), (1, 2 ), (2, 3), (2, 2 ), (1, 3), (3, 3)}
R1 is reflexive, since, (1, 1) (2, 2) (3, 3) lie in R1.
Now, (1, 2 ) Î R1, (2, 3) Î R1 Þ (1, 3) Î R1
Hence, R1 is also transitive but (1, 2 ) Î R1 Þ (2, 1) Ï R1.
So, it is not symmetric.
(ii) Let R 2 = {(1, 2 ), (2, 1)}
Now, (1, 2 ) Î R 2 , (2, 1) Î R 2
So, it is symmetric.
(iii) Let R 3 = {(1, 2 ), (2, 1), (1, 1), (2, 2 ), (3, 3), (1, 3), (3, 1), (2, 3)}
Hence, R 3 is reflexive, symmetric and transitive.
Q. 17 Let R be relation defined on the set of natural number N as follows,
R = {(x, y) : x Î N , y Î N , 2x + y = 41}. Find the domain and range of
the relation R. Also verify whether R is reflexive, symmetric and
transitive.
Sol. Given that, R = {(x, y) : x Î N, y Î N, 2 x + y = 41}.
Domain = {1, 2, 3, K, 20}
Range = {1, 3, 5, 7, K, 39}
R = {(1, 39), (2, 37 ), (3, 35), K, (19, 3), (20, 1)}
R is not reflexive as (2, 2 ) Ï R
2 ´ 2 + 2 ¹ 41
So, R is not symmetric.
As (1, 39) Î R but (39, 1) Ï R
So, R is not transitive.
As (11, 19) Î R, (19, 3) Î R
But (11, 3) Ï R
Hence, R is neither reflexive, nor symmetric and nor transitive.

Q. 18 Given, A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of each of

the following
(i) an injective mapping from A to B.
(ii) a mapping from A to B which is not injective.
(iii) a mapping from B to A.
Sol. Given that, A = {2, 3, 4}, B = {2, 5, 6, 7}
(i) Let f : A ® B denote a mapping
f = {(x, y) : y = x + 3}
i.e., f = {(2, 5), (3, - 6), (4, 7 )}, which is an injective mapping.
(ii) Let g : A ® B denote a mapping such that g = {(2, 2 ), (3, 5), (4, 5)}, which is not an
injective mapping.
(iii) Let h : B ® A denote a mapping such that h = {(2, 2 ), (5, 3), (6, 4), (7, 4)}, which is a
mapping from B to A.

Q. 19 Give an example of a map

(i) which is one-one but not onto.
(ii) which is not one-one but onto.
(iii) which is neither one-one nor onto.
Sol. (i) Let f : N ® N, be a mapping defined by f(x ) = 2 x
which is one-one.
For f( x1 ) = f( x 2 )
Þ 2 x1 = 2 x 2
x1 = x 2
Further f is not onto, as for 1Î N, there does not exist any x in N such that f(x ) = 2 x + 1.
(ii) Let f : N ® N, given by f(1) = f(2 ) = 1 and f(x ) = x - 1 for every x >2 is onto but not
one-one. f is not one-one as f(1) = f(2 ) = 1. But f is onto.
(iii) The mapping f : R ® R defined as f(x ) = x 2 , is neither one-one nor onto.
 x -2
Q. 20 Let A = R - {3}, B = R - {1}. If f : A ® B be defined by f (x) = ,
x -3
" x Î A. Then, show that f is bijective.
K Thinking Process
A function f : x ® y is said to be bijective, if f is both one-one and onto.
Sol. Given that, A = R - {3}, B = R - {1}.
x -2
f : A ® B is defined by f(x ) = ,"xÎA
x-3
For injectivity
x1 - 2 x 2 - 2
Let f( x1 ) = f( x 2 ) Þ =
x1 - 3 x 2 - 3
Þ (x1 - 2 )(x 2 - 3) = (x 2 - 2 )(x1 - 3)
Þ x1x 2 - 3x1 - 2 x 2 + 6 = x1x 2 - 3x 2 - 2 x1 + 6
Þ -3x1 - 2 x 2 = - 3x 2 - 2 x1
Þ - x1 = - x 2 Þ x1 = x 2
So, f(x ) is an injective function.
For surjectivity
x -2
Let y= Þ x - 2 = xy - 3 y
x-3
2 - 3y
Þ x(1 - y) = 2 - 3 y Þ x =
1- y
3y - 2
Þ x= Î A, " y Î B [codomain]
y-1
So, f(x ) is surjective function.
Hence, f(x ) is a bijective function.

Q. 21 Let A = [ - 1, 1], then, discuss whether the following functions defined

on A are one-one onto or bijective.
x
(i) f (x) = (ii) g(x) = | x |
2
(iii) h(x) = x| x | (iv) k(x) = x 2
Sol. Given that, A = [-1, 1]
x
(i) f(x ) =
2
Let f( x1 ) = f( x 2 )
x1 x 2
Þ = Þ x1 = x 2
2 2
So, f(x ) is one-one.
x
Now, let y=
2
Þ x = 2 y Ï A, " y Î A
As for y = 1 Î A, x = 2 Ï A
So, f(x ) is not onto.
Also, f(x ) is not bijective as it is not onto.
 (ii) g (x ) = |x|
Let g ( x1 ) = g ( x 2 )
Þ |x1| = |x 2| Þ x1 = ± x 2
So, g (x ) is not one-one.
Now, y =|x| Þ x = ± y Ï A, " y Î A
So, g (x ) is not onto, also, g (x ) is not bijective.
(iii) h(x ) = x|x|
Let h(x1 ) = h(x 2 )
Þ x1|x1| = x 2|x 2| Þ x1 = x 2
So, h(x ) is one-one.
Now, let y = x|x|
Þ y = x 2 Î A, " x Î A
So, h(x ) is onto also, h(x ) is a bijective.
(iv) k(x ) = x 2
Let k(x1 ) = k(x 2 )
Þ x12 = x 22 Þ x1 = ± x 2
Thus, k(x ) is not one-one.
Now, let y = x2
Þ x = y Ï A, " y Î A
As for y = - 1, x = -1 Ï A
Hence, k(x ) is neither one-one nor onto.

Q. 22 Each of the following defines a relation of N

(i) x is greater than y, x, y Î N .
(ii) x + y = 10, x, y Î N .
(iii) xy is square of an integer x, y Î N .
(iv) x + 4 y = 10, x, y Î N
Determine which of the above relations are reflexive, symmetric and
transitive.
Sol. (i) x is greater than y, x, y Î N
(x, x ) Î R
For x Rx x > x is not true for any x Î N.
Therefore, R is not reflexive.
Let (x, y) Î R Þ x Ry
x >y
but y > x is not true for any x, y Î N
Thus, R is not symmetric.
Let xRy and yRz
x > y and y > z Þ x > z
Þ xRz
So, R is transitive.
 (ii) x + y = 10, x, y Î N
R = {(x, y); x + y = 10, x, y Î N}
R = {(1, 9), (2, 8), (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1)} (1, 1) Ï R
So, R is not reflexive.
(x, y) Î R Þ ( y, x ) Î R
Therefore, R is symmetric.
(1, 9) Î R, (9, 1) Î R Þ (1, 1) Ï R
Hence, R is not transitive.
(iii) Given xy, is square of an integer x, y Î N.
Þ R = {(x, y) : xy is a square of an integer x, y Î N}
(x, x ) Î R, " x Î N
As x 2 is square of an integer for any x Î N.
Hence, R is reflexive.
If (x, y) Î R Þ ( y, x ) Î R
Therefore, R is symmetric.
If (x, y) Î R, ( y, z) Î R
So, xy is square of an integer and yz is square of an integer.
Let xy = m2 and yz = n2 for some m, n Î Z
m2 x2
x= and z =
y y
m2 n2
xz = , which is square of an integer.
y2
So, R is transitive.
(iv) x + 4 y = 10, x, y Î N
R = {(x, y) : x + 4 y = 10, x, y Î N}
R = {(2, 2 ), (6, 1)}
(1, 1), (3, 3), K, Ï R
Thus, R is not reflexive.
(6, 1) Î R but (1, 6) Ï R
Hence, R is not symmetric.
(x, y) Î R Þ x + 4 y = 10 but ( y, z) Î R
y + 4 z = 10 Þ (x, z) Î R
So, R is transitive.

Q. 23 Let A = {1, 2, 3, K , 9} and R be the relation in A ´ A defined by

(a, b) R (c , d ) if a + d = b + c for (a, b), (c , d ) in A ´ A. Prove that R is an
equivalence relation and also obtain the equivalent class [(2, 5)].
Sol. Given that, A = {1, 2, 3, K, 9} and (a, b ) R(c, d ) if a + d = b + c for (a, b ) Î A ´ A and
(c, d ) Î A ´ A.
Let (a, b ) R (a, b )
Þ a + b = b + a, " a, b Î A
which is true for any a, b Î A.
Hence, R is reflexive.
Let (a, b ) R (c, d ) a+d =b+c
c + b = d + a Þ (c, d ) R (a, b )
So, R is symmetric.
 Let (a, b ) R (c, d ) and (c, d ) R (e, f )
a + d = b + c and c + f = d + e
a + d = b + c and d + e = c + f
(a + d ) - (d + e ) = (b + c ) - (c + f )
(a - e ) = b - f
a+ f =b+e
(a, b ) R (e, f )
So, R is transitive.
Hence, R is an equivalence relation.
Now, equivalence class containing [(2, 5)] is {(1, 4), (2, 5), (3, 6), (4, 7), (5, 8), (6, 9)}.

Q. 24 Using the definition, prove that the function f : A ® B is invertible if

and only if f is both one-one and onto.
Sol. A function f : X ® Y is defined to be invertible, if there exist a function g = Y ® X such that
gof = I X and fog = I Y . The function is called the inverse of f and is denoted by f -1.
A function f = X ® Y is invertible iff f is a bijective function.

Q. 25 Functions f , g : R ® R are defined, respectively, by f (x) = x 2 + 3x + 1,

g(x) = 2x - 3, find
(i) fog (ii) gof (iii) fof (iv) gog
Sol. Given that, f(x ) = x 2 + 3x + 1, g (x ) = 2 x - 3
(i) fog = f{g (x )} = f(2 x - 3)
= (2 x - 3)2 + 3 (2 x - 3) + 1
= 4x 2 + 9 - 12 x + 6x - 9 + 1 = 4x 2 - 6x + 1
(ii) gof = g {f(x )} = g (x 2 + 3x + 1)
= 2(x 2 + 3x + 1) - 3
= 2 x 2 + 6x + 2 - 3 = 2 x 2 + 6x - 1
(iii) fof = f{f(x )} = f(x 2 + 3x + 1)
= (x 2 + 3x + 1)2 + 3 (x 2 + 3x + 1) + 1
= x 4 + 9x 2 + 1 + 6x 3 + 6x + 2 x 2 + 3x 2 + 9x + 3 + 1
= x 4 + 6x 3 + 14x 2 + 15x + 5
(iv) gog = g {g (x )} = g (2 x - 3)
= 2(2 x - 3) - 3
= 4x - 6 - 3 = 4x - 9

Objective Type Questions

Q. 28 Let T be the set of all triangles in the Euclidean plane and let a
relation R on T be defined as aRb, if a is congruent to b, " a, b Î T .
Then, R is
(a) reflexive but not transitive (b) transitive but not symmetric
(c) equivalence (d) None of these
Sol. (c) Consider that aRb, if a is congruent to b, " a, b ÎT.
Then, aRa Þ a @ a,
which is true for all a ÎT
So, R is reflexive, …(i)
 Let aRb Þ a@b
Þ b@a Þ b@a
Þ bRa
So, R is symmetric. …(ii)
Let aRb and bRc
Þ a@b and b @ c
Þ a@c Þ aRc
So, R is transitive. …(iii)
Hence, R is equivalence relation.

Q. 29 Consider the non-empty set consisting of children in a family and a

relation R defined as aRb, if a is brother of b. Then, R is
(a) symmetric but not transitive
(b) transitive but not symmetric
(c) neither symmetric nor transitive
(d) both symmetric and transitive
Sol. (b) Given, aRb Þ a is brother of b
\ aRa Þ a is brother of a, which is not true.
So, R is not reflexive.
aRb Þ a is brother of b.
This does not mean b is also a brother of a and b can be a sister of a.
Hence, R is not symmetric.
aRb Þ a is brother of b
and bRc Þ b is a brother of c.
So, a is brother of c.
Hence, R is transitive.

Q. 30 The maximum number of equivalence relations on the set A = {1, 2, 3}

are
(a) 1 (b) 2 (c) 3 (d) 5
Sol. (d) Given that, A = {1, 2, 3}
Now, number of equivalence relations as follows
R1 = {(1, 1), (2, 2 ), (3, 3)}
R 2 = {(1, 1), (2, 2 ), (3, 3), (1, 2 ), (2,1)}
R 3 = {(1, 1), (2, 2 ), (3, 3), (1, 3), (3,1)}
R 4 = {(1, 1), (2, 2 ), (3, 3), (2, 3), (3, 2 )}
R 5 = {(1, 2, 3) Û A ´ A = A 2 }
\ Maximum number of equivalence relation on the set A = {1, 2, 3} = 5

Q. 31 If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is

(a) reflexive (b) transitive (c) symmetric (d) None of these
Sol. (b) R on the set {1, 2, 3} be defined by R = {(1, 2 )}
It is clear that R is transitive.
Q. 32 Let us define a relation R in R as aRb if a ³ b. Then, R is
(a) an equivalence relation
(b) reflexive, transitive but not symmetric
(c) symmetric, transitive but not reflexive
(d) neither transitive nor reflexive but symmetric
Sol. (b) Given that, aRb if a ³ b
Þ aRa Þ a ³ a which is true.
Let aRb, a ³ b, then b ³ a which is not true R is not symmetric.
But aRb and b R c
Þ a ³ b and b ³ c
Þ a ³c
Hence, R is transitive.

Q. 33 If A = {1, 2, 3} and consider the relation

R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}
Then, R is
(a) reflexive but not symmetric (b) reflexive but not transitive
(c) symmetric and transitive (d) neither symmetric nor transitive
Sol. (a) Given that, A = {1, 2, 3}
and R = {(1, 1), (2, 2 ), (3, 3), (1, 2 ), (2, 3), (1, 3)}
Q (1, 1), (2, 2 ), (3, 3) Î R
Hence, R is reflexive.
(1, 2 ) Î R but (2, 1) Ï R
Hence, R is not symmetric.
(1, 2 ) Î R and (2, 3) Î R
Þ (1, 3) Î R
Hence, R is transitive.
Q. 34 If the set A contains 5 elements and the set B contains 6 elements,
then the number of one-one and onto mappings from A to B is
(a) 720 (b) 120 (c) 0 (d) None of these
Sol. (c) We know that, if A and B are two non-empty finite set containing m and n elements
respectively, then the number of one-one and onto mapping from A to B is
n!, if m = n
0, if m ¹ n
Given that, m = 5 and n = 6
\ m¹ n
Number of mapping = 0

Q. 35 If A = {1, 2, 3, K, n} and B = {a, b}. Then, the number of surjections

from A into B is
(a) n P2 (b) 2 n - 2 (c) 2 n - 1 (d) None of these
Sol. (d) Given that, A = {1, 2, 3, K, n} and B = {a, b}.
We know that, if A and B are two non-empty finite sets containing m and n elements
respectively, then the number of surjection from A into B is
n
C m ´ m!, if n ³ m
0, if n < m
Here, m = 2
n!
\ Number of surjection from A into B is n C 2 ´ 2 ! = ´ 2!
2 !(n - 2 )!
n(n - 1)(n - 2 )!
= ´ 2 ! = n2 - n
2 ´ 1 (n - 2 )

1
Q. 36 If f : R ® R be defined by f (x) = , " x Î R. Then, f is
x
(a) one-one (b) onto (c) bijective (d) f is not defined
K Thinking Process
In the given function at x = 0, f(x) = ¥. So, the function is not define.
1
Sol. (d) Given that, f( x ) = , " x ÎR
x
For x = 0,
f(x ) is not defined.
Hence, f(x ) is a not define function.

Q. 37 If f : R ® R be defined by f (x) = 3x 2 - 5 and g : R ® R by

x
g(x) = 2 . Then, gof is
x +1
3x 2 - 5 3x 2 - 5
(a) (b)
9x - 30 x 2 + 26
4
9x - 6x 2 + 26
4

3x 2 3x 2
(c) (d)
x + 2x 2 - 4
4
9x + 30 x 2 - 2
4
 x
Sol. (a) Given that, f(x ) = 3x 2 - 5 and g (x ) =
x2 + 1
gof = g {f(x )} = g (3x 2 - 5)
3x 2 - 5 3x 2 - 5
= 2 2
=
(3x - 5) + 1 9x - 30x 2 + 25 + 1
4

3x 2 - 5
=
9x - 30x 2 + 26
4

Q. 38 Which of the following functions from Z into Z are bijections?

(a) f ( x) = x3 (b) f ( x) = x + 2 (c) f ( x) = 2x + 1 (d) f ( x) = x 2 + 1
Sol. (b) Here, f( x ) = x + 2 Þ f( x1 ) = f( x 2 )
x1 + 2 = x 2 + 2 Þ x1 = x 2
Let y=x +2
x = y - 2 Î Z, " y Î x
Hence, f(x ) is one-one and onto.

Q. 39 If f : R ® R be the functions defined by f (x) = x+3 5, then f -1 (x) is

1 1 1
(a) ( x + 5)3 (b) ( x - 5)3 (c) (5 - x)3 (d) 5 - x
3
Sol. (b) Given that, f( x ) = x + 5
Let y = x3 + 5 Þ x3 = y - 5
1 1
x = (y - 5)3 Þ f(x )-1 = (x - 5)3

Q. 40 If f : A ® B and g : B ® C be the bijective functions, then (gof ) -1 is

(a) f -1og -1 (b) fog (c) g -1of -1 (d) gof
Sol. (a) Given that, f : A ® B and g : B ® C be the bijective functions.
(gof )-1 = f -1og -1

3x + 2
f : R - ìí üý ® R be defined by f (x) =
3
Q. 41 If , then
î5þ 5x - 3
1
(a) f -1( x) = f ( x) (b) f -1( x) = - f ( x) (c) ( fof ) x = - x (d) f -1( x) = f ( x)
19
Sol. (a) 3x +2
Given that, f( x ) =
5x -3
3x +2
Let y=
5x -3
3x + 2 = 5xy - 3 y Þ x(3 - 5 y) = - 3 y - 2
3y + 2 3x + 2
x= Þ f -1(x ) =
5y - 3 5x - 3
\ f -1(x ) = f(x )
, Q. 42 If f : [0, 1] ® [0, 1] be defined by f ( ) ì x if x is rational
x =í
î1 - x, if x is irrational
then ( fof )x is
(a) constant (b) 1 + x (c) x (d) None of these
Sol. (c) Given that, f: [0, 1] ® [0, 1] be defined by
ì x, if x is rational
f (x ) = í
î 1 - x, if x is irrational
\ (fof )x = f(f(x )) = x

Q. 43 If f : [2, ¥) ® R be the function defined by f (x) = x 2 - 4 x + 5, then

the range of f is
(a) R (b) [1, ¥ ) (c) [ 4, ¥ ) (d) [5, ¥ )
K Thinking Process
Range of f = {y ÎY : y = f(x) for some in X}

Sol. (b) Given that, f(x ) = x 2 - 4x + 5

Let y = x 2 - 4x + 5
Þ y = x 2 - 4x + 4 + 1= (x - 2 )2 + 1
2
Þ (x - 2 ) = y - 1 Þ x - 2 = y-1
Þ x =2 + y-1
\ y - 1 ³ 0, y ³ 1
Range = [1, ¥ )

2x - 1
Q. 44 If f : N ® R be the function defined by f (x) = and g : Q ® R
2
3
be another function defined by g(x) = x + 2. Then, (gof ) is
2
7
(a) 1 (b) 1 (c) (d) None of these
2
2x - 1
Sol. (d) Given that, f( x ) = and g (x ) = x + 2
2
æ 3 ö
3 é æ 3 öù ç 2 ´ - 1÷
(gof ) = g ê f ç ÷ ú = g ç 2 ÷
2 ë è 2 øû çç 2 ÷÷
è ø
= g(1) = 1 + 2 = 3
Q. 45 If f : R ® R be defined by f ( ) ì2x x > 3
ï
x = í x2 : 1 < x £ 3
ï3x : x £ 1
î :
Then, f (-1) + f (2) + f (4) is
(a) 9 (b) 14 (c) 5 (d) None of these
ì2 x : x > 3
ï
Sol. (a) Given that, f( x ) = í x 2 : 1 < x £ 3
ï3x : x £ 1
î
f(-1) + f(2 ) + f(4) = 3 (-1) + (2 )2 + 2 ´ 4
= - 3 + 4 + 8= 9

Q. 46 If f : R ® R be given by f (x) = tan x, then f -1 (1) is

p p
(a) (b) ìínp + : n Î Z üý
4 î 4 þ
(c) Does not exist (d) None of these
Sol. (a) Given that, f(x ) = tan x
Let y = tan x Þ x = tan-1 y
Þ f -1(x ) = tan-1 x Þ f -1(1) = tan-1 1
p p é p ù
Þ = tan-1tan = êëQ tan 4 = 1úû
4 4

Fillers
Q. 47 Let the relation R be defined in N by aRb, if 2a +3b = 30. Then, R = …..
.
Sol. Given that, 2 a + 3b = 30
3b = 30 - 2 a
30 - 2 a
b=
3
For a = 3, b = 8
a = 6, b = 6
a = 9, b = 4
a = 12, b = 2
R = {(3, 8), (6, 6), (9, 4), (12, 2 )}

Q. 48 If the relation R be defined on the set A = {1, 2, 3, 4, 5} by

R = {(a, b) : |a 2 - b 2 | < 8}. Then, R is given by ……… .
Sol. Given, A = {1, 2, 3, 4, 5},
R = {(a, b ) :|a2 - b 2| < 8}
R = { (1, 1), (1, 2), (2, 1), (2, 2), (2, 3), (3, 2), (3, 3), (4, 3), (3, 4), (4, 4), (5, 5)}
Q. 49 If f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}, then
gof = ……… and fog = ……… .
Sol. Given that, f = {(1, 2 ), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}
gof(1) = g {f(1)} = g (2 ) = 3
gof(3) = g {f(3)} = g (5) = 1
gof(4) = g {f(4)} = g (1) = 3
gof = {(1, 3), (3, 1), (4, 3)}
Now, fog (2 ) = f{g (2 )} = f(3) = 5
fog (5) = f{g (5)} = f(1) = 2
fog (1) = f{g (1)} = f(3) = 5
fog = {(2, 5), (5, 2 ), (1, 5)}

x
Q. 50 If f : R ® R be defined by f (x) = , then ( fofof )(x) = ……… .
2
1+x
x
Sol. Given that, f( x ) =
1 + x2
(fofof )(x ) = f [ f{f(x )}]
æ x ö
ç ÷
é æ ö ù ç 1 + x 2 ÷
ç x ÷
= f êf ú= f ç ÷
ê ç 2 ÷ ú ç 2
÷
ë è 1 + x øû x
ç 1+ 2 ÷
è 1 + x ø
é 2 ù æ ö
x 1+ x ú= f ç x ÷
=fê
ê ú ç 2 ÷
è 1 + 2x
2 2
ë 1 + x ( 2 x + 1) û ø
x
1 + 2x 2 x 1 + 2x 2
= =
x2 1 + 2 x 2 1 + 3x 2
1+ 2
1 + 2x
x x
= =
1 + 3x 2 3x 2 + 1

Q. 51 If f (x) = [4 - (x - 7) 3 ], then f -1 (x) = ……… .

Sol. Given that, f(x ) = {4 - (x - 7)3 }
Let y = [4 - (x - 7 )3 ]
(x - 7 )3 = 4 - y
(x - 7 ) = (4 - y)1/ 3
Þ x = 7 + (4 - y)1/ 3
f -1(x ) = 7 + (4 - x )1/ 3
True/False
Q. 52 Let R ={(3, 1), (1, 3), (3, 3)} be a relation defined on the set
A ={1, 2, 3}. Then, R is symmetric, transitive but not reflexive.
Sol. False
Given that, R = {(3, 1), (1, 3), (3, 3)} be defined on the set A = {1, 2, 3}
(1, 1) Ï R
So, R is not reflexive. (3, 1) Î R, (1, 3) Î R
Hence, R is symmetric.
Since, (3, 1) Î R, (1, 3) Î R
But (1, 1) Ï R
Hence, R is not transitive.

Q. 53 If f : R ® R be the function defined by f (x) = sin(3x + 2) " x Î R.

Then, f is invertible.
Sol. False
Given that, f(x ) = sin(3x + 2 ), " x Î R is not one-one function for all x Î R.
So, f is not invertible.

Q. 54 Every relation which is symmetric and transitive is also reflexive.

Sol. False
Let R be a relation defined by
R ={(1, 2), (2, 1), (1, 1), (2, 2)} on the set A = {1, 2, 3}
It is clear that (3, 3) Ï R. So, it is not reflexive.

Q. 55 An integer m is said to be related to another integer n, if m is a integral

multiple of n. This relation in Z is reflexive, symmetric and transitive.
Sol. False
The given relation is reflexive and transitive but not symmetric.

Q. 56 If A = {0, 1} and N be the set of natural numbers. Then, the mapping

f : N ® A defined by f (2n - 1) = 0, f (2n) = 1, " n Î N, is onto.
Sol. True
Given, A = {0, 1}
f(2 n - 1) = 0, f(2 n) = 1, " n Î N
So, the mapping f : N ® A is onto.

Q. 57 The relation R on the set A ={1, 2, 3} defined as R = {(1, 1), (1, 2), (2,
1), (3, 3)} is reflexive, symmetric and transitive.
Sol. False
Given that, R = {(1, 1), (1, 2), (2, 1), (3, 3)}
(2, 2 ) Ï R
So, R is not reflexive.