Class-XII-Maths Relations and Functions

CBSE NCERT Solutions for Class 12 Maths Chapter 01

Back of Chapter Questions

EXERCISE 1.1
1. Determine whether each of the following relations are reflexive, symmetric and
transitive:
(i) Relation 𝑅 in the set 𝐴 = {1, 2, 3, . . . , 13, 14} defined as

𝑅 = {(𝑥, 𝑦) ∶ 3𝑥 – 𝑦 = 0}
(ii) Relation 𝑅 in the set 𝑁 of natural numbers defined as
𝑅 = {(𝑥, 𝑦) ∶ 𝑦 = 𝑥 + 5 and 𝑥 < 4}
(iii) Relation R in the set 𝐴 = {1, 2, 3, 4, 5, 6} as
𝑅 = {(𝑥, 𝑦) ∶ 𝑦 is divisible by 𝑥}
(iv) Relation 𝑅 in the set 𝑍 of all integers defined as

𝑅 = {(𝑥, 𝑦) ∶ 𝑥 – 𝑦 is an integer}
(v) Relation 𝑅 in the set 𝐴 of human beings in a town at a particular time given by
(a) 𝑅 = {(𝑥, 𝑦) ∶ 𝑥 and 𝑦 work at the same place}
(b) 𝑅 = {(𝑥, 𝑦) ∶ 𝑥 and 𝑦 live in the same locality}
(c) 𝑅 = {(𝑥, 𝑦) ∶ 𝑥 is exactly 7 cm taller than 𝑦}
(d) 𝑅 = {(𝑥, 𝑦) ∶ 𝑥 is wife of 𝑦}
(e) 𝑅 = {(𝑥, 𝑦) ∶ 𝑥 is father of 𝑦}

Solution:
(i) 𝐴 = {1, 2, 3 … 13, 14}
𝑅 = {(𝑥, 𝑦): 3𝑥 − 𝑦 = 0}
Hence, 𝑅 = {(1, 3), (2, 6), (3, 9), (4, 12)}

1
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

𝑅 is not reflexive since (1, 1), (2, 2) … (14, 14) ∉ 𝑅.

Again, 𝑅 is not symmetric as (1, 3) ∈ 𝑅, but (3, 1) ∉ 𝑅. [3(3) − 1 ≠ 0]
Again, 𝑅 is not transitive as (1, 3), (3, 9) ∈ 𝑅, but (1, 9) ∉ 𝑅. [3(1) − 9 ≠ 0]
Hence, 𝑅 is neither reflexive, nor symmetric, nor transitive.
(ii) 𝐴 = {1, 2, 3 … 13, 14}
𝑅 ={(𝑥, 𝑦): 𝑦 = 𝑥 + 5 and 𝑥 < 4}
Hence, 𝑅 = {(1, 6), (2, 7), (3, 8)}
It is clear that (1, 1) ∉ 𝑅.
∴ 𝑅 is not reflexive.
(1, 6) ∈ 𝑅 But, (6, 1) ∉ 𝑅.
∴ 𝑅 is not symmetric.
Now, since there is no pair in 𝑅 such that (𝑥, 𝑦) and (𝑦, 𝑧) ∈ 𝑅, so we will not bother
about (𝑥, 𝑧).
∴ 𝑅 is transitive.
Hence, 𝑅 is neither reflexive, nor symmetric, but transitive.
(iii) 𝐴 = {1, 2, 3, 4, 5, 6}
𝑅 = {(𝑥, 𝑦): 𝑦 is divisible by 𝑥}
We know that any number (x) is divisible by itself.
So, (𝑥, 𝑥) ∈ 𝑅
∴ 𝑅 is reflexive.
Now,
(2, 4)∈ 𝑅 [as 4 is divisible by 2]
But, (4, 2)∉ 𝑅. [as 2 is not divisible by 4]
∴ 𝑅 is not symmetric.
Suppose (𝑥, 𝑦) , (𝑦, 𝑧) ∈ R. Then, 𝑦 is divisible by 𝑥 and 𝑧 is divisible by 𝑦.
Hence, 𝑧 is divisible by 𝑥.
⇒ (𝑥, 𝑧) ∈ 𝑅

2
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

∴ 𝑅 is transitive.
Hence, 𝑅 is reflexive and transitive but not symmetric.
(iv) 𝑅 ={(𝑥, 𝑦): 𝑥 − 𝑦 is an integer}
Now, for every 𝑥 ∈ 𝑍, (𝑥, 𝑥) ∈ 𝑅 as 𝑥 − 𝑥 = 0 is an integer.
∴ 𝑅 is reflexive.
Now, for every 𝑦 ∈ 𝑍, if (𝑥, 𝑦) ∈ 𝑅, then 𝑥 − 𝑦 is an integer.
⇒ −(𝑥 − 𝑦) is also an integer.
⇒ (𝑦 − 𝑥) is an integer.
∴ (𝑦, 𝑥) ∈ 𝑅
∴ 𝑅 is symmetric.
Now,
Suppose (𝑥, 𝑦) and (𝑦, 𝑧) ∈ 𝑅, where, (𝑦, z)∈ 𝑍.
⇒ (𝑥 − 𝑦) and (𝑦 − 𝑧) are integers
⇒ 𝑥 − 𝑧 = (𝑥 − 𝑦) + (𝑦 − 𝑧) is an integer.
∴ (𝑥, 𝑧) ∈ 𝑅
∴ 𝑅 is transitive.
Hence, 𝑅 is reflexive, symmetric, and transitive.
(v)
(a) 𝑅 ={(𝑥, 𝑦): 𝑥 and 𝑦 work at the same place}
⇒ (𝑥, 𝑥) ∈ 𝑅 [as 𝑥 and 𝑥 work at the same place]
∴ 𝑅 is reflexive.
If (𝑥, 𝑦) ∈ 𝑅, then 𝑥 and 𝑦 work at the same place.
⇒ 𝑦 and 𝑥 work at the same place.
⇒ (𝑦, 𝑥) ∈ 𝑅.
∴ 𝑅 is symmetric.
Now, suppose (𝑥, 𝑦) , (𝑦, 𝑧) ∈ 𝑅
⇒ 𝑥 and 𝑦 work at the same place and 𝑦 and 𝑧 work at the same place.
⇒ 𝑥 and 𝑧 work at the same place.

3
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

⇒ (𝑥, 𝑧) ∈ 𝑅
∴ 𝑅 is transitive.
Hence, 𝑅 is reflexive, symmetric and transitive.
(b) 𝑅 ={(𝑥, 𝑦): 𝑥 and 𝑦 live in the same locality}
Clearly, (𝑥, 𝑥) ∈ 𝑅 as 𝑥 and 𝑥 is the same human being.
∴ 𝑅 is reflexive.
If (𝑥, 𝑦) ∈ 𝑅, then 𝑥 and 𝑦 live in same locality.
⇒ 𝑦 and 𝑥 live in the same locality.
⇒ (𝑦, 𝑥) ∈ 𝑅

Hence, 𝑅 is symmetric.
Now, suppose (𝑥, 𝑦) ∈ 𝑅 and (𝑦, 𝑧) ∈ 𝑅
⇒ 𝑥 and 𝑦 live in the same locality and 𝑦 and 𝑧 live in the same locality.
⇒ 𝑥 and 𝑧 live in the same locality.
⇒ (𝑥, 𝑧) ∈ 𝑅
𝑅 is transitive.
Hence, 𝑅 is reflexive, symmetric and transitive.
(c) 𝑅 ={(𝑥, 𝑦): 𝑥 is exactly 7 cm taller than 𝑦}
Now, (𝑥, 𝑥) ∉ 𝑅
Since human being 𝑥 cannot be taller than himself.
Hence, 𝑅 is not reflexive.
Now, suppose (𝑥, 𝑦) ∈ 𝑅.
⇒ 𝑥 is exactly 7 cm taller than 𝑦.
Then, 𝑦 is not taller than 𝑥. [Since, 𝑦 is 7 cm smaller than 𝑥]
∴ (𝑦, 𝑥) ∉ 𝑅
Indeed if 𝑥 is exactly 7 𝑐𝑚 taller than 𝑦, then 𝑦 is exactly 7 𝑐𝑚 shorter than 𝑥.
Hence, 𝑅 is not symmetric.
Now,
Suppose (𝑥, 𝑦) , (𝑦, 𝑧) ∈ 𝑅.

4
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

⇒ 𝑥 is exactly 7 𝑐𝑚 taller than 𝑦 and 𝑦 is exactly 7 𝑐𝑚 taller than 𝑧.

⇒ 𝑥 is exactly 14 𝑐𝑚 taller than 𝑧.
∴ (𝑥, 𝑧) ∉ 𝑅
∴ 𝑅 is not transitive.
Hence, 𝑅 is neither reflexive, nor symmetric, nor transitive.
(d) 𝑅 = {(𝑥, 𝑦): 𝑥 is the wife of 𝑦}
Now,
(𝑥, 𝑥) ∉ 𝑅
Since 𝑥 cannot be the wife of herself.
∴ 𝑅 is not reflexive.
Now, suppose (𝑥, 𝑦) ∈ 𝑅
⇒x is the wife of 𝑦.
Clearly 𝑦 is not the wife of 𝑥.
∴ (𝑦, 𝑥) ∉ 𝑅
Indeed if 𝑥 is the wife of 𝑦, then 𝑦 is the husband of 𝑥.
𝑅 is not symmetric.
Suppose (𝑥, 𝑦), (𝑦, 𝑧) ∈ 𝑅
⇒ 𝑥 is the wife of 𝑦 and 𝑦 is the wife of 𝑧.
This case is not possible. Also, this does not imply that 𝑥 is the wife of 𝑧.
∴ (𝑥, 𝑧) ∉ 𝑅
∴ 𝑅 is not transitive.
Hence, 𝑅 is neither reflexive, nor symmetric, nor transitive.

(e) 𝑅 ={(𝑥, 𝑦): 𝑥 is the father of y}

(𝑥, 𝑥) ∉ 𝑅
As 𝑥 cannot be the father of himself.
∴ 𝑅 is not reflexive.
Now, suppose (𝑥, 𝑦) ∉ 𝑅.

5
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

⇒ 𝑥 is the father of 𝑦.
⇒ 𝑦 cannot be the father of 𝑦.
Indeed, 𝑦 is the son or the daughter of 𝑦.
∴ (𝑦, 𝑥) ∉ 𝑅
∴ 𝑅 is not symmetric.
Now, suppose (𝑥, 𝑦) ∈ 𝑅 and (𝑦, 𝑧) ∉ 𝑅.
⇒ 𝑥 is the father of 𝑦 and 𝑦 is the father of 𝑧.
⇒ 𝑥 is not the father of 𝑧.
Indeed 𝑥 is the grandfather of 𝑧.
∴ (𝑥, 𝑧) ∉ 𝑅
∴ 𝑅 is not transitive.
Hence, 𝑅 is neither reflexive, nor symmetric, nor transitive.

2. Show that the relation 𝑅 in the set 𝑅 of real numbers, defined as

𝑅 = {(𝑎, 𝑏) ∶ 𝑎 ≤ 𝑏 2 } is neither reflexive nor symmetric nor transitive.

Solution:
𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏 2 }
1 1 1 1 2
It can be observed that (2 , 2) ∉ 𝑅, since, 2 > (2)

∴ 𝑅 is not reflexive.
Now, (1, 4) ∈ 𝑅 as 1 < 42 But, 4 is not less than 12 .
∴ (4, 1) ∉ 𝑅
∴ 𝑅 is not symmetric.
Now,
(3, 2), (2, 1.5) ∈ 𝑅 [as 3 < 22 = 4 and 2 < (1.5)2 = 2.25]

6
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

But, 3 > (1.5)2 = 2.25

∴ (3, 1.5) ∉ 𝑅
∴ 𝑅 is not transitive.
Hence, 𝑅 is neither reflexive, nor symmetric, nor transitive.

3. Check whether the relation 𝑅 defined in the set {1, 2, 3, 4, 5, 6} as

𝑅 = {(𝑎, 𝑏): 𝑏 = 𝑎 + 1} is reflexive, symmetric or transitive.

Solution:
Suppose 𝐴 = {1, 2, 3, 4, 5, 6}.
A relation 𝑅 is defined on set 𝐴 as: 𝑅 = {(𝑎, 𝑏): 𝑏 = 𝑎 + 1}
𝑅 = {(1,2), (2,3), (3,4), (4,5), (5,6)}
⇒we can find (𝑎, 𝑎) ∉ 𝑅, where 𝑎 ∈ 𝐴.
For instance,
(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6) ∉ 𝑅
∴ 𝑅 is not reflexive.
⇒It can be observed that (1, 2) ∈ 𝑅, but (2, 1) ∉ 𝑅.
Hence, 𝑅 is not symmetric.
Now, (1, 2), (2, 3) ∈ 𝑅
But, (1, 3) ∉ 𝑅
∴ 𝑅 is not transitive
Hence, 𝑅 is neither reflexive, nor symmetric, nor transitive.

4. Show that the relation 𝑅 in 𝑅 defined as 𝑅 = {(𝑎, 𝑏) ∶ 𝑎 ≤ 𝑏}, is reflexive and

7
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

transitive but not symmetric.

Solution:
𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏}
⇒Clearly (𝑎, 𝑎) ∈ 𝑅 [as 𝑎 = 𝑎]
𝑅 is reflexive.
⇒Now, (2, 4) ∈ 𝑅 (as 2 < 4)
But, (4, 2) ∉ 𝑅 as 4 is greater than 2.
∴ 𝑅 is not symmetric.
Now, suppose (𝑎, 𝑏), (𝑏, 𝑐) ∈ 𝑅.
Then, 𝑎 ≤ 𝑏 and 𝑏 ≤ 𝑐
⇒𝑎≤𝑐
⇒ (𝑎, 𝑐) ∈ 𝑅
∴ 𝑅 is transitive.
Hence 𝑅 is reflexive and transitive but not symmetric.

5. Check whether the relation 𝑅 in 𝑅 defined by 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏 3 } is reflexive,

Symmetric or transitive.

Solution:
𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏 3 }
1 1 1 1 3
⇒It is found that (2 , 2) ∉ 𝑅, since, 2 > (2)

∴ 𝑅 is not reflexive.
⇒Now, (1 , 2) ∈ 𝑅 (as 1 < 23 = 8)
But, (2, 1) ∉ 𝑅 (as 23 > 1)

8
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

∴ 𝑅 is not symmetric.
3 3 6
⇒For, (3, 2) (2 , 5) ∈ 𝑅 ,

3 3 3 6 3
Since, 3 < (2 ) and 2 < (5)

6 6 3
But (3, 5) ∉ 𝑅 as 3 > (5)

𝑅 is not transitive.
Hence, 𝑅 is neither reflexive, nor symmetric, nor transitive.

6. Show that the relation 𝑅 in the set {1, 2, 3} given by 𝑅 = {(1, 2), (2, 1)} is
symmetric but neither reflexive nor transitive.

Solution:
Suppose 𝐴 = {1, 2, 3}.
A relation 𝑅 on 𝐴 is defined as 𝑅 = { (1, 2), (2, 1)}
⇒It is clear that (1, 1), (2, 2), (3, 3) ∉ 𝑅.
∴ 𝑅 is not reflexive.
⇒As (1, 2) ∈ 𝑅 and (2, 1) ∈ 𝑅,
Hence, 𝑅 is symmetric.
⇒Now, (1, 2) and (2, 1) ∈ 𝑅
However, (1, 1) ∉ 𝑅
∴ 𝑅 is not transitive.
Hence, 𝑅 is symmetric but neither reflexive nor transitive.

7. Show that the relation 𝑅 in the set 𝐴 of all the books in a library of a college,

9
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

given by 𝑅 = {(𝑥, 𝑦) ∶ 𝑥 and 𝑦 have same number of pages} is an equivalence

relation.

Solution:
Given: Set 𝐴 is the set of all books in the library of a college.
𝑅 = {𝑥, 𝑦): 𝑥 and 𝑦 have the same number of pages}
⇒since (𝑥, 𝑥) ∈ 𝑅 as 𝑥 and 𝑥 has the same number of pages.
Hence, 𝑅 is reflexive
Suppose (𝑥, 𝑦) ∈ 𝑅 ⇒ 𝑥 and 𝑦 have the same number of pages.
So, 𝑦 and 𝑥 have the same number of pages.
(𝑦, 𝑥) ∈ 𝑅
∴ 𝑅 is symmetric.
⇒Now, suppose (𝑥, 𝑦) ∈ 𝑅 and (𝑦, 𝑧) ∈ 𝑅.
⇒ 𝑥 and 𝑦 and have the same number of pages and 𝑦 and 𝑧 have the same number
of pages.
⇒ 𝑥 and 𝑧 have the same number of pages.
⇒ (𝑥, 𝑧) ∈ 𝑅
Hence, 𝑅 is transitive.
As R is reflexive, symmetric and also transitive, 𝑅 is an equivalence relation.

8. Show that the relation 𝑅 in the set 𝐴 = {1, 2, 3, 4, 5} given by

𝑅 = {(𝑎, 𝑏) ∶ |𝑎 – 𝑏| is even}, is an equivalence relation. Show that all the

elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are
related to each other. But no element of {1, 3, 5} is related to any element of { 2, 4}.

10
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Solution:
𝐴 = {1, 2, 3, 4, 5} and 𝑅 ={(𝑎, 𝑏): |𝑎 − 𝑏| is even}
⇒It is clear that for any element 𝑎 ∈ 𝐴, we have |𝑎 − 𝑎| = 0 (which is even).
∴ 𝑅 is reflexive.
Suppose (𝑎, 𝑏) ∈ 𝑅.
⇒ |𝑎 − 𝑏| is even
⇒ | − (𝑎 − 𝑏)| = |𝑏 − 𝑎| is also even
⇒ (𝑏, 𝑎) ∈ 𝑅
∴ 𝑅 is symmetric.
Now, suppose (𝑎, 𝑏) ∈ 𝑅 and (𝑏, 𝑐) ∈ 𝑅.
⇒ |𝑎 − 𝑏| is even and |𝑏 − 𝑐| is even
⇒ (𝑎 − 𝑏) is even and (𝑏‐ 𝑐) is even
⇒ (𝑎 − 𝑐) = (𝑎 − 𝑏) + (𝑏 − 𝑐) is even [Sum of two even integers is even]
⇒ |𝑎 − 𝑏| is even.
⇒ (𝑎, 𝑐) ∈ 𝑅
∴ 𝑅 is transitive.
Since, the relation 𝑅 is reflexive, symmetric and transitive.
Hence, 𝑅 is an equivalence relation.
Now, all elements of the set {1, 2, 3} are related to each other as all the elements of this
subset are odd. Thus, the modulus of the difference between any two odd elements will
be even.
Similarly, all elements of the set {2, 4} are related to each other as all the elements of this
subset are even.
Also, no element of the subset {1, 3, 5} can be related to any element of {2, 4} as
all elements of {1, 3, 5} are odd and all elements of {2, 4} are even. Thus, the
modulus of the difference between even and odd numbers (from each of these two
subsets) will not be even. [as 1‐ 2, 1‐ 4, 3‐ 2, 3‐ 4, 5‐ 2 and 5‐ 4 all are odd]

11
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

9. Show that each of the relation 𝑅 in the set 𝐴 = {𝑥 ∈ 𝑍 ∶ 0 ≤ 𝑥 ≤ 12}, given by

(i) 𝑅 = {(𝑎, 𝑏) ∶ |𝑎 – 𝑏| is a multiple of 4}

(ii) 𝑅 = {(𝑎, 𝑏) ∶ 𝑎 = 𝑏}
is an equivalence relation. Find the set of all elements related to 1 in each case.

Solution:
𝐴 = {𝑥 ∈ 𝑍: 0 ≤ 𝑥 ≤ 12}= {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}
(i) 𝑅 ={(𝑎, 𝑏) : |𝑎 − 𝑏| is a multiple of 4}
For any element, 𝑎 ∈ 𝐴,
we have (𝑎, 𝑎) ∈ 𝑅 as |𝑎 − 𝑎| = 0 is a multiple of 4.
𝑅 is reflexive.
Now, suppose (𝑎, 𝑏) ∈ 𝑅 ⇒ |𝑎 − 𝑏| is a multiple of 4.
⇒ | − (𝑎 − 𝑏)| = |𝑏 − 𝑎| is a multiple of 4.
⇒ (𝑏, 𝑎) ∈ 𝑅
∴ 𝑅 is symmetric.
Now, suppose (𝑎, 𝑏), (𝑏, 𝑐) ∈ 𝑅.
⇒ |𝑎 − 𝑏| is a multiple of 4 and |𝑏 − 𝑐| is a multiple of 4.
⇒ (𝑎 − 𝑏) is a multiple of 4 and (𝑏 − 𝑐) is a multiple of 4.
⇒ (𝑎 − 𝑐) = (𝑎 − 𝑏) + (𝑏 − 𝑐) is a multiple of 4.

⇒ |𝑎 − 𝑐| is a multiple of 4.
⇒ (𝑎, 𝑐) ∈ 𝑅
∴ 𝑅 is transitive.
Since, the relation 𝑅 is reflexive, symmetric and transitive.
Hence, 𝑅 is an equivalence relation.
The set of elements related to 1 is {1, 5, 9} as
|1 − 1| = 0 is a multiple of 4.
|5 − 1| = 4 is a multiple of 4.

12
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

|9 − 1| = 8 is a multiple of 4.
Hence, {1, 5, 9} is the set of elements related to 1.
(ii) 𝑅 = {(𝑎, 𝑏): 𝑎 = 𝑏}
For any element 𝑎 ∈ 𝐴, we have (𝑎, 𝑎) ∈ 𝑅, since 𝑎 = 𝑎.
∴ 𝑅 is reflexive.
Now, suppose (𝑎, 𝑏) ∈ 𝑅.
Hence, 𝑎 = 𝑏
then 𝑏 = 𝑎 ⇒ (𝑏, 𝑎) ∈ 𝑅
∴ 𝑅 is symmetric.
Now, suppose (𝑎, 𝑏) ∈ 𝑅 and (𝑏, 𝑐) ∈ 𝑅.
⇒ 𝑎 = 𝑏 and 𝑏 = 𝑐
⇒𝑎=𝑐
⇒ (𝑎, 𝑐) ∈ 𝑅
∴ 𝑅 is transitive.
Since, the relation 𝑅 is reflexive, symmetric and transitive.
Hence, 𝑅 is an equivalence relation.
The elements in 𝑅 that are related to 1 will be those elements from set A which
are equal to 1.
Hence, the set of elements related to 1 is {1}.

10. Give an example of a relation. Which is

(i) Symmetric but neither reflexive nor transitive.
(ii) Transitive but neither reflexive nor symmetric.
(iii) Reflexive and symmetric but not transitive.
(iv) Reflexive and transitive but not symmetric.
(v) Symmetric and transitive but not reflexive.

13
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Solution:
(i) Suppose 𝐴 = {5, 6, 7}.
Define a relation 𝑅 on 𝐴 as 𝑅 = {(5, 6), (6, 7), (7, 5), (6, 5), (7, 6), (5, 7)}
Relation 𝑅 is not reflexive as (5, 5), (6, 6), (7, 7) ∉ 𝑅.
Now, as (5, 6) ∈ 𝑅 and also (6, 5) ∈ 𝑅
Hence, R is symmetric.
⇒ (5, 6), (6, 5) ∈ 𝑅, but (5, 5) ∉ 𝑅
∴ 𝑅 is not transitive.
Hence, relation 𝑅 = {(5, 6), (6, 7), (7, 5), (6, 5), (7, 6), (5, 7)} on 𝐴 = {5, 6, 7} is the
required relation.
(ii) Consider a relation 𝑅 in 𝑅 defined as:
𝑅 = {(𝑎, 𝑏): 𝑎 < 𝑏}
For any 𝑎 ∈ 𝑅, we have (𝑎, 𝑎) ∉ 𝑅 since 𝑎 cannot be strictly less than 𝑎 itself.
In fact, 𝑎 = 𝑎.
∴ 𝑅 is not reflexive.
Now, (1, 2) ∈ 𝑅 (as 1 < 2)
But, 2 is not less than 1.
∴ (2, 1) ∉ 𝑅
∴ 𝑅 is not symmetric.
Now, suppose (𝑎, 𝑏), (𝑏, 𝑐) ∈ 𝑅.
⇒ 𝑎 < 𝑏 and 𝑏 < 𝑐
⇒𝑎<𝑐
⇒ (𝑎, 𝑐) ∈ 𝑅
∴ 𝑅 is transitive.
Hence, relation 𝑅 = {(𝑎, 𝑏): 𝑎 < 𝑏} is transitive but neither reflexive nor symmetric.

(iii) Suppose 𝐴 = {4, 6, 8}.

Define a relation 𝑅 on A as
𝑅 = {(4, 4), (6, 6), (8, 8), (4, 6), (6, 4), (6, 8), (8, 6)}

14
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Relation 𝑅 is reflexive since for every 𝑎 ∈ 𝐴, (𝑎, 𝑎) ∈ 𝑅

i.e., {(4,4), (6, 6), (8, 8)} ∈ 𝑅.
Relation 𝑅 is symmetric since (𝑎, 𝑏) ∈ 𝑅 ⇒ (𝑏, 𝑎) ∈ 𝑅 for all 𝑎, 𝑏 ∈ 𝑅.
Relation 𝑅 is not transitive
since (4, 6), (6, 8) ∈ 𝑅, but (4, 8) ∉ 𝑅.
Hence, relation 𝑅 = {(4, 4), (6, 6), (8, 8), (4, 6), (6, 4), (6, 8), (8, 6)} on 𝐴 = {4, 6, 8} is
reflexive and symmetric but not transitive.
(iv) Define a relation 𝑅 in 𝑅 as:
𝑅 = {𝑎, 𝑏): 𝑎3 ≥ 𝑏 3 }
Clearly (𝑎, 𝑎) ∈ 𝑅 as 𝑎3 = 𝑎3 .
∴ 𝑅 is reflexive.
Now, (2, 1) ∈ 𝑅 [as 23 ≥ 13 ]
But, (1, 2) ∉ 𝑅 [as 13 < 23 ]
∴ 𝑅 is not symmetric.
Now, Suppose (𝑎, 𝑏), (𝑏, 𝑐) ∈ 𝑅.
3
⇒ 𝑎3 ≥ 𝑏 and 𝑏 3 ≥ 𝑐 3

⇒ 𝑎3 ≥ 𝑐3

⇒ (𝑎, 𝑐) ∈ 𝑅
∴ 𝑅 is transitive.
Hence, relation 𝑅 = {𝑎, 𝑏): 𝑎3 ≥ 𝑏 3 } in 𝑅 is reflexive and transitive not symmetric.

(v) Suppose 𝐴 = {0, 1, 2}.

Define a relation 𝑅 on 𝐴 as
𝑅 = {(0, 0), (1, 1), (0, 1), (1, 0)}
Relation 𝑅 is not reflexive as (2, 2) ∉ 𝑅.
Relation 𝑅 is symmetric as (0, 1) ∈ 𝑅 and (1, 0) ∈ 𝑅.
It is seen that (0, 1), (1, 0) ∈ 𝑅. Also, (0, 0) ∈ 𝑅.
Also, while going through all possibilities, we can say that:
The relation 𝑅 is transitive.

15
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Hence, relation 𝑅 is symmetric and transitive but not reflexive.

11. Show that the relation R in the set A of points in a plane given by 𝑅 = {(𝑃, 𝑄) ∶ Distance
of the point 𝑃 from the origin is same as the distance of the point 𝑄 from the origin}, is an
equivalence relation. Further, show that the set of all points related to a point 𝑃 ≠ (0, 0)
is the circle passing through 𝑃 with origin as centre.

Solution:
𝑅 = {(𝑃, 𝑄) : Distance of point 𝑃 from the origin is the same as the distance of point 𝑄
from the origin}
Clearly, (𝑃, 𝑃) ∈ 𝑅 since the distance of point 𝑃 from the origin is always the same as the
distance of the same point 𝑃 from the origin.
∴ 𝑅 is reflexive.
Now, Suppose (𝑃, 𝑄) ∈ 𝑅.
⇒ The distance of point 𝑃 from the origin is the same as the distance of point 𝑄 from the
origin.
⇒ The distance of point 𝑄 from the origin is the same as the distance of point 𝑃 from the
origin.
⇒ (𝑄, 𝑃) ∈ 𝑅
∴ 𝑅 is symmetric.
Now, Suppose (𝑃, 𝑄), (𝑄, 𝑆) ∈ 𝑅.
⇒ The distance of points 𝑃 and 𝑄 from the origin is the same and also, the distance of
points 𝑄 and 𝑆 from the origin is the same.
⇒ The distance of points 𝑃 and 𝑆 from the origin is the same.

⇒ (𝑃, 𝑆) ∈ 𝑅
∴ 𝑅 is transitive.
Since, the relation 𝑅 is reflexive, symmetric and transitive.
Hence, 𝑅 is an equivalence relation.
The set of all points related to 𝑃 ≠ (0,0) will be those points whose distance from the
origin is the same as the distance of point 𝑃 from the origin.

16
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

In other words, if 𝑂(0,0) is the origin and 𝑂𝑃 = 𝑘, then the set of all the points related
to 𝑃 is at a distance of 𝑘 from the origin.
Hence, this set of points form a circle with the center as the origin and this circle passes
through point 𝑃.

12. Show that the relation 𝑅 defined in the set 𝐴 of all triangles as 𝑅 = {(𝑇1 , 𝑇2 ): 𝑇1
is similar to 𝑇2 }, is equivalence relation. Consider three right angle triangles 𝑇1
with sides 3, 4, 5, 𝑇2 with sides 5, 12, 13 and 𝑇3 with sides 6, 8, 10. Which
triangles among 𝑇1 , 𝑇2 and 𝑇3 are related?

Solution:
𝑅 ={(𝑇1 , 𝑇2 ): 𝑇1 is similar to 𝑇2 }
𝑅 is reflexive since every triangle is similar to itself.
Further,
If (𝑇1 , 𝑇2 ) ∈ 𝑅, then 𝑇1 is similar to 𝑇2 .
⇒ 𝑇2 is similar to 𝑇1 .

⇒ (𝑇2 , 𝑇1 ) ∈ 𝑅
∴ 𝑅 is symmetric.
Now,
Suppose (𝑇1 , 𝑇2 ) , (𝑇2 , 𝑇3 ) ∈ 𝑅.
⇒ 𝑇1 is similar to 𝑇2 and 𝑇2 is similar to 𝑇3 .

⇒ 𝑇1 is similar to 𝑇3 .

⇒ (𝑇1 , 𝑇3 ) ∈ 𝑅
∴ 𝑅 is transitive.
Since, the relation 𝑅 is reflexive, symmetric and transitive.
Thus, 𝑅 is an equivalence relation.
Now,

17
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

We can observe that

3 4 5 1
= 8 = 10 =
6 2

∴ The corresponding sides of triangles 𝑇1 and 𝑇3 are in the same ratio.

Then, triangle 𝑇1 is similar to triangle 𝑇3 .
Hence, 𝑇1 is related to 𝑇3 .

13. Show that the relation 𝑅 defined in the set 𝐴 of all polygons as 𝑅 = {(𝑃1 , 𝑃2 ) ∶ 𝑃1 and 𝑃2
have same number of sides}, is an equivalence relation. What is the set of all elements in
𝐴 related to the right-angle triangle 𝑇 with sides 3, 4 and 5?

Solution:
𝑅 ={(𝑃1 , 𝑃2 ): 𝑃1 and 𝑃2 have same the number of sides}
Since (𝑃1 , 𝑃1 ) ∈ 𝑅, as the same polygon has the same number of sides with itself.
Hence, 𝑅 is reflexive,
Suppose (𝑃1 , 𝑃2 ) ∈ 𝑅.
⇒ 𝑃1 and 𝑃2 have the same number of sides.

⇒ 𝑃2 and 𝑃1 have the same number of sides.

⇒ (𝑃2 , 𝑃1 ) ∈ 𝑅
∴ 𝑅 is symmetric.
Now,
Suppose (𝑃1 , 𝑃2 ), (𝑃2 , 𝑃3 ) ∈ 𝑅.
⇒ 𝑃1 and 𝑃2 have the same number of sides.

Also, 𝑃2 and 𝑃3 have the same number of sides.

⇒ 𝑃1 and 𝑃3 have the same number of sides.

⇒ (𝑃1 , 𝑃3 ) ∈ 𝑅
∴ 𝑅 is transitive.
Since, the relation 𝑅 is reflexive, symmetric and transitive.

18
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Hence, 𝑅 is an equivalence relation.

The elements in 𝐴 related to the right‐angled triangle (𝑇) with sides 3, 4, and 5
are those polygons which have 3 sides (Since 𝑇 is a polygon with 3 𝑠𝑖𝑑𝑒𝑠).
Hence, the set of all elements in 𝐴 related to triangle 𝑇 is the set of all triangles.

14. Let 𝐿 be the set of all lines in 𝑋𝑌 plane and 𝑅 be the relation in 𝐿 defined as
𝑅 = {(𝐿1 , 𝐿2 ) ∶ 𝐿1 is parallel to 𝐿2 }. Show that 𝑅 is an equivalence relation. Find
the set of all lines related to the line 𝑦 = 2𝑥 + 4.

Solution:
𝑅 ={(𝐿1 , 𝐿2 ): 𝐿1 is parallel to 𝐿2 }
𝑅 is reflexive as any line 𝐿1 is parallel to itself i.e., (𝐿1 , 𝐿1 ) ∈ 𝑅.
Now, suppose (𝐿1 , 𝐿2 ) ∈ 𝑅.
⇒ 𝐿1 is parallel to 𝐿2 ⇒ 𝐿2 is parallel to 𝐿1 .

⇒ (𝐿2 , 𝐿1 ) ∈ 𝑅
∴ 𝑅 is symmetric.
Now, suppose (𝐿1 , 𝐿2 ), (𝐿2 , 𝐿3 ) ∈ 𝑅.
⇒ 𝐿1 is parallel to 𝐿2 . Also, 𝐿2 is parallel to 𝐿3 .

⇒ 𝐿1 is parallel to 𝐿3 .

∴ 𝑅 is transitive.
Since, the relation 𝑅 is reflexive, symmetric and transitive.
Hence, 𝑅 is an equivalence relation.
The set of all lines related to the line 𝑦 = 2𝑥 + 4 is the set of all the lines that are
parallel to the line 𝑦 = 2𝑥 + 4.
Slope of line 𝑦 = 2𝑥 + 4 is 𝑚 = 2

19
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

It is known that parallel lines have the same slopes.

The line parallel to the given line is of the form 𝑦 = 2𝑥 + 𝑐, where 𝑐 ∈ 𝑅.
Hence, the set of all lines related to the given line is 𝑦 = 2𝑥 + 𝑐, where 𝑐 ∈ 𝑅.

15. Let 𝑅 be the relation in the set {1, 2, 3, 4} given by

𝑅 = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer.
(A) 𝑅 is reflexive and symmetric but not transitive.
(B) 𝑅 is reflexive and transitive but not symmetric.
(C) 𝑅 is symmetric and transitive but not reflexive.
(D) 𝑅 is an equivalence relation.

Solution:
Given, 𝑅 = {(1, 2) , (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}
It is seen that (𝑎, 𝑎) ∈ 𝑅, for every
𝑎 ∈ {1, 2, 3, 4}.
∴ 𝑅 is reflexive.
It is seen that (1, 2) ∈ 𝑅, but (2, 1) ∉ 𝑅.
Hence, 𝑅 is not symmetric.
Also, it is observed that (𝑎, 𝑏) , (𝑏, 𝑐) ∈ 𝑅 ⇒ (𝑎, 𝑐) ∈ 𝑅 for all 𝑎, 𝑏, 𝑐 ∈ {1, 2, 3, 4}.
𝑅 is transitive.
Hence, 𝑅 is reflexive and transitive but not symmetric.
The correct answer is 𝐵.

16. Let 𝑅 be the relation in the set 𝑁 given by 𝑅 = {(𝑎, 𝑏): 𝑎 = 𝑏 – 2, 𝑏 > 6}. Choose

20
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

the correct answer.

(A) (2, 4) ∈ 𝑅
(B) (3, 8) ∈ 𝑅
(C) (6, 8) ∈ 𝑅
(D) (8, 7) ∈ 𝑅

Solution:
Given, 𝑅 = {(𝑎, 𝑏): 𝑎 = 𝑏 − 2, 𝑏 > 6}
Now,
Since 𝑏 > 6,
As 4 is not greater than 6, (2, 4) ∉ 𝑅
Also, as 3 ≠ 8 − 2,
(3, 8) ∉ 𝑅
As 8 ≠ 7 − 2
∴ (8, 7) ∉ 𝑅
Now, consider (6, 8).
We have 8 > 6 and also, 6 = 8 − 2.
(6, 8) ∈ 𝑅
The correct answer is 𝐶.

EXERCISE 1.2
1
1. Show that the function 𝑓: 𝑅∗ → 𝑅∗ defined by 𝑓(𝑥) = 𝑥 is one‐one and onto, where 𝑅∗ is
the set of all non‐zero real numbers. Is the result true, if the domain 𝑅∗ is replaced by 𝑁
with co‐domain being same as 𝑅∗ ?

21
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Solution:
1
It is given that 𝑓: 𝑅∗ → 𝑅∗ is defined by 𝑓(𝑥) = 𝑥

For one‐one:
Suppose 𝑥, 𝑦 ∈ 𝑅∗ such that 𝑓(𝑥) = 𝑓(𝑦)
1 1
⇒𝑥=𝑦

⇒𝑥=𝑦
∴ 𝑓 is one‐one.
For onto:
1
It is clear that for 𝑦 ∈ 𝑅∗ , there exists 𝑥 = ∈ 𝑅∗ [as 𝑦 ≠ 0]
𝑦

1
such that, 𝑓(𝑥) = 1 =𝑦
( )
𝑦

∴ 𝑓 is onto.
Thus, the given function 𝑓 is one - one and onto.
1
Now, consider function 𝑔: 𝑁 → 𝑅∗ defined by 𝑔(𝑥) = 𝑥

We have,
1 1
𝑔(𝑥1 ) = 𝑔(𝑥2 ) ⇒ 𝑥 = 𝑥 ⇒ 𝑥1 = 𝑥2
1 2

∴ 𝑔 is one - one.
Further, it is clear that 𝑔 is not onto as for 1.2 ∈ 𝑅∗ there does not exit any 𝑥 in 𝑁
such that, 𝑔(𝑥) = 1.2
Hence, function 𝑔 is one‐one but not onto.
Hence, result is not same when domain is changed from 𝑅∗ to 𝑁.

2. Check the injectivity and surjectivity of the following functions:

(i) 𝑓: 𝑁 → 𝑁 given by 𝑓(𝑥) = 𝑥 2
(ii) 𝑓: 𝑍 → 𝑍 given by 𝑓(𝑥) = 𝑥 2

22
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

(iii) 𝑓: 𝑅 → 𝑅 given by 𝑓(𝑥) = 𝑥 2

(iv) 𝑓: 𝑁 → 𝑁 given by 𝑓(𝑥) = 𝑥 3
(v) 𝑓: 𝑍 → 𝑍 given by 𝑓(𝑥) = 𝑥 3

Solution:
(i) 𝑓: 𝑁 → 𝑁 is given by 𝑓(𝑥) = 𝑥 2
It is seen that for 𝑥, 𝑦 ∈ 𝑁, 𝑓(𝑥) = 𝑓(𝑦) ⇒ 𝑥 2 = 𝑦 2 ⇒ 𝑥 = 𝑦.
∴ 𝑓 is injective.
Now, 2 ∈ 𝑁. But, there does not exist any 𝑥 in 𝑁 such that 𝑓(𝑥) = 𝑥 2 = 2.
∴ 𝑓 is not surjective.
Hence, function 𝑓 is injective but not surjective.
(ii) 𝑓: 𝑍 → 𝑍 is given by 𝑓(𝑥) = 𝑥 2
It is seen that𝑓(−1) = 𝑓(1) = 1, but −1 ≠ 1.
∴ 𝑓 is not injective.
Now, −2 ∈ 𝑍. But, there does not exist any element 𝑥 ∈ 𝑍 such that
𝑓(𝑥) = −2 or 𝑥 2 = −2.
∴ 𝑓 is not surjective.
Hence, function 𝑓 is neither injective nor surjective.
(iii) 𝑓: 𝑅 → 𝑅 is given by 𝑓(𝑥) = 𝑥 2
It is seen that 𝑓(−1) = 𝑓(1)
= (−1)2 = (1)2
but −1 ≠ 1.
∴ 𝑓 is not injective.
Now, −2 ∈ 𝑅. But, there does not exist any element 𝑥 ∈ 𝑅 such that
𝑓(𝑥) = −2 or 𝑥 2 = −2.
∴ 𝑓 is not surjective.
Hence, function 𝑓 is neither injective nor surjective.
(iv) 𝑓: 𝑁 → 𝑁 given by 𝑓(𝑥) = 𝑥 3

23
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

It is seen that for 𝑥, 𝑦 ∈ 𝑁, 𝑓(𝑥) = 𝑓(𝑦) ⇒ 𝑥 3 = 𝑦 3 ⇒ 𝑥 = 𝑦.

∴ 𝑓 is injective.
Now, 2 ∈ 𝑁. But, there does not exist any element 𝑥 ∈ 𝑁 such that
𝑓(𝑥) = 2 or 𝑥 3 = 2.
∴ 𝑓 is not surjective
Hence, function 𝑓 is injective but not surjective.
(v) 𝑓: 𝑍 → 𝑍 is given by 𝑓(𝑥) = 𝑥 3
It is seen that for 𝑥, 𝑦 ∈ 𝑍, 𝑓(𝑥) = 𝑓(𝑦) ⇒ 𝑥 3 = 𝑦 3 ⇒ 𝑥 = 𝑦.
∴ 𝑓 is injective.
Now, 2 ∈ 𝑍. But, there does not exist any element 𝑥 ∈ 𝑍 such that
𝑓(𝑥) = 2 or 𝑥 3 = 2.
∴ 𝑓 is not surjective.
Hence, function 𝑓 is injective but not surjective.

3. Prove that the Greatest Integer Function 𝑓: 𝑅 → 𝑅, given by 𝑓(𝑥) = [𝑥], is neither one‐
one nor onto, where [𝑥] denotes the greatest integer less than or equal to 𝑥.

Solution:
𝑓: 𝑅 → 𝑅 is given by, 𝑓(𝑥) = [𝑥]
It is seen that 𝑓(1.2) = [1.2] = 1, 𝑓(1.9) = [1.9] = 1.
∴ 𝑓(1.2) = 𝑓(1.9) , but 1.2 ≠ 1.9.
∴ 𝑓 is not one‐one.
Now, consider 0.8 ∈ 𝑅.
It is known that 𝑓(𝑥) = [𝑥] is always an integer. Thus, there does not exist any
element 𝑥 ∈ 𝑅 such that 𝑓(𝑥) = 0.8.
∴ 𝑓 is not onto.

24
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Hence, the greatest integer function is neither one‐ one nor onto.

4. Show that the Modulus Function 𝑓: 𝑅 → 𝑅, given by 𝑓(𝑥) = |𝑥|, is neither one‐ one nor
onto, where |𝑥| is 𝑥, if 𝑥 is positive or 0 and |𝑥| is −𝑥, if 𝑥 is negative.

Solution:
𝑓: 𝑅 → 𝑅 is given by 𝑓(𝑥) = |𝑥| = {𝑥, 𝑖𝑓 𝑥 ≥ 0
‐ 𝑥, 𝑖𝑓 𝑥 < 0}
It is clear that
⇒ 𝑓(−1) = | − 1| = 1
⇒ 𝑓(1) = |1| = 1
∴ 𝑓(−1) = 𝑓(1) , but −1 ≠ 1.
∴ 𝑓 is not one‐one.
Now, consider −1 ∈ 𝑅.
It is known that 𝑓(𝑥) = |𝑥| is always non - negative. Thus, there does not exist any
element 𝑥 in domain 𝑅 such that 𝑓(𝑥) = |𝑥| = −1.
∴ 𝑓 is not onto.
Hence, the modulus function is neither one - one nor onto.

5. Show that the Signum Function 𝑓: 𝑅 → 𝑅, given by

𝑓(𝑥) = { 1, 𝑖𝑓 𝑥 > 0
0, 𝑖𝑓 𝑥 = 0
−1, 𝑖𝑓 𝑥 < 0 } is neither one‐one nor onto.

25
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Solution:
𝑓: 𝑅 → 𝑅 is given by 𝑓(𝑥) = {1, 𝑖𝑓𝑥 > 0
0, 𝑖𝑓𝑥 = 0
−1, 𝑖𝑓𝑥 < 0 }
It is seen that 𝑓(1) = 𝑓(2) = 1, but 1 ≠ 2.
∴ 𝑓 is not one - one.
Now, as 𝑓(𝑥) takes only 3 values (1, 0, or −1) for the element −2 in co-domain 𝑅, there
does not exist any 𝑥 in domain 𝑅 such that 𝑓(𝑥) = −2.
∴ 𝑓 is not onto.
Hence, the Signum function is neither one - one nor onto.

6. Let 𝐴 = {1, 2, 3}, 𝐵 = {4, 5, 6, 7} and let 𝑓 = {(1,4), (2, 5), (3, 6)} be a function from 𝐴
to 𝐵. Show that 𝑓 is one‐one.

Solution:
It is given that 𝐴 = {1, 2, 3}, 𝐵 = {4, 5, 6, 7}.
𝑓: 𝐴 → 𝐵 is defined as 𝑓 = {(1, 4, (2, 5), (3, 6)}
∴ 𝑓(1) = 4, 𝑓(2) = 5, 𝑓(3) = 6
It is seen that the images of distinct elements of 𝐴 in 𝑓 are distinct.
Hence, function 𝑓 is one-one.

7. In each of the following cases, state whether the function is one‐one, onto or bijective.
Justify your answer.
(i) 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 3 − 4𝑥
(ii) 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 1 + 𝑥 2

26
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Solution:
(i) 𝑓: 𝑅 → 𝑅 is defined as 𝑓(𝑥) = 3 − 4𝑥.
Suppose 𝑥1 , 𝑥2 ∈ 𝑅 such that 𝑓(𝑥1 ) = 𝑓(𝑥2 )
⇒ 3 − 4𝑥1 = 3 − 4𝑥2
⇒ −4𝑥1 = −4𝑥2
⇒ 𝑥1 = 𝑥2

∴ 𝑓 is one‐one.
3−𝑦
For any real number (y) in 𝑅, there exists in 𝑅 such that
4
3−𝑦 3−𝑦
𝑓( ) = 3 − 4( )=𝑦
4 4

∴ 𝑓 is onto.
As function is both one-one and onto, 𝑓 is bijective.
(ii) 𝑓: 𝑅 → 𝑅 is defined as 𝑓(𝑥) = 1 + 𝑥 2
Suppose 𝑥1 , 𝑥2 ∈ 𝑅 such that 𝑓(𝑥1 ) = 𝑓(𝑥2 )
⇒ 1 + 𝑥12 = 1 + 𝑥22
⇒ 𝑥12 = 𝑥22

⇒ 𝑥1 = ±𝑥2

𝑓(𝑥1 ) = 𝑓(𝑥2 ) does not imply that 𝑥1 = 𝑥2

For example 𝑓(1) = 𝑓(−1) = 2

∴ 𝑓 is not one-one.
Consider an element −2 in co-domain R.
It is seen that 𝑓(𝑥) = 1 + 𝑥 2 is positive for all 𝑥 ∈ 𝑅.
Thus, there does not exist any 𝑥 in domain 𝑅 such that 𝑓(𝑥) = −2.
∴ 𝑓 is not onto.
𝑓 is neither one - one nor onto hence, it is not bijective.

27
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

8. Let 𝐴 and 𝐵 be sets. Show that 𝑓: 𝐴 × 𝐵 → 𝐵 × 𝐴 such that (𝑎, 𝑏) = (𝑏, 𝑎) is bijective
function.

Solution:
𝑓: 𝐴 × 𝐵 → 𝐵 × 𝐴 is defined as 𝑓(𝑎, 𝑏) = (𝑏, 𝑎).
Suppose (𝑎1 , 𝑏1 ), (𝑎2 , 𝑏2 ) ∈ 𝐴 × 𝐵 such that 𝑓(𝑎1 , 𝑏1 ) = 𝑓(𝑎2 , 𝑏2 )
⇒ (𝑏1 , 𝑎1 ) = (𝑏2 , 𝑎2 )
⇒ 𝑏1 = 𝑏2 and 𝑎1 = 𝑎2

⇒ (𝑎1 , 𝑏1 ) = (𝑎2 , 𝑏2 )
∴ 𝑓 is one-one.
Now, suppose (𝑏, 𝑎) ∈ 𝐵 × 𝐴 be any element.
Then, there exists (𝑎, 𝑏) ∈ 𝐴 × 𝐵 such that (𝑎, 𝑏) = (𝑏, 𝑎) . [By definition of 𝑓]
∴ 𝑓 is onto.
As the function is both one-one and onto, 𝑓 is bijective.

𝑛+1
9. Let: 𝑁 → 𝑁 be defined by 𝑓(𝑛) = { 2
, 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
𝑛
, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛 }
2
for all 𝑛 ∈ N. State whether the function 𝑓 is bijective. Justify your answer.
Solution:
𝑛+1
𝑓: 𝑁 → 𝑁 is defined as 𝑓(𝑛) = { , 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
2
𝑛
2
, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛}

for all 𝑛 ∈ 𝑁
for x =1, 2 where 1 is odd and 2 is even number.
1+1 2
𝑓(1) = = 1 and 𝑓(2) = 2 = 1 [By definition of 𝑓(𝑛)]
2

28
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

𝑓(1) = 𝑓(2) , where 1 ≠ 2

∴ 𝑓 is not one - one.
Consider a natural number (n) in co - domain N.
Case I: 𝑛 is odd
∴ 𝑛 = 2𝑟 + 1 for some 𝑟 ∈ 𝑁. Then, there exists 4𝑟 + 1 ∈ 𝑁 such that
4𝑟 + 1 + 1
𝑓(4𝑟 + 1) = = 2𝑟 + 1
2
Case II: 𝑛 is even
∴ 𝑛 = 2𝑟 for some 𝑟 ∈ 𝑁. Then, there exists 4𝑟 ∈ 𝑁 such that
4𝑟
𝑓(4𝑟) = = 2𝑟.
2
∴ 𝑓 is onto.
As the given function is not one-one hence, 𝑓 is not a bijective function.

10. Let 𝐴 = 𝑅 − {3} and 𝐵 = 𝑅 − {1}. Consider the function 𝑓: 𝐴 → 𝐵 defined by 𝑓(𝑥) =
𝑥−2
(𝑥−3). Is 𝑓 one‐one and onto? Justify your answer.

Solution:
𝑥−2
𝐴 = 𝑅 − {3}, 𝐵 = 𝑅 − {1} and 𝑓: 𝐴 → 𝐵 defined by 𝑓(𝑥) = (𝑥−3)

Suppose 𝑥, 𝑦 ∈ 𝐴 such that 𝑓(𝑥) = 𝑓(𝑦)

𝑥−2 𝑦−2
⇒ 𝑥−3 = 𝑦−3

⇒ (𝑥 − 2)(𝑦 − 3) = (𝑦 − 2)(𝑥 − 3)
⇒ 𝑥𝑦 − 3𝑥 − 2𝑦 + 6 = 𝑥𝑦 − 2𝑥 − 3𝑦 + 6
⇒ −3𝑥 − 2𝑦 = −2𝑥 − 3𝑦 ⇒ 𝑥 = 𝑦
∴ 𝑓 is one - one.
Suppose 𝑦 ∈ 𝐵 = 𝑅 − {1}. Then, 𝑦 ≠ 1.
29
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

The function 𝑓 is onto if there exists 𝑥 ∈ 𝐴 such that 𝑓(𝑥) = 𝑦.

Now, 𝑓(𝑥) = 𝑦
𝑥−2
⇒ 𝑥−3 = 𝑦

⇒ 𝑥 − 2 = 𝑥𝑦 − 3𝑦 ⇒ 𝑥(1 − 𝑦) = −3𝑦 + 2
2−3𝑦
⇒𝑥= ∈ 𝐴 [𝑦 ≠ 1]
1−𝑦

2−3𝑦
Thus, for any 𝑦 ∈ 𝐵, there exists ∈ 𝐴 such that
1−𝑦
2−3𝑦
2−3𝑦 ( )−2 2−3𝑦−2+2𝑦 −𝑦
1−𝑦
𝑓( )= 2−3𝑦 = = =𝑦
1−𝑦 ( )−3 2−3𝑦−3+3𝑦 −1
1−𝑦

∴ 𝑓 is onto.
As the given function is both one-one and onto.
Hence, 𝑓 is bijective.

11. Let: 𝑅 → 𝑅 be defined as 𝑓(𝑥) = 𝑥 4 . Choose the correct answer.

(A) 𝑓 is one‐one onto
(B) 𝑓 is many‐one onto
(C) 𝑓 is one‐one but not onto
(D) 𝑓 is neither one‐one nor onto.

Solution:
𝑓: 𝑅 → 𝑅 is defined as 𝑓(𝑥) = 𝑥 4 .
Suppose 𝑥, 𝑦 ∈ 𝑅 such that (𝑥) = 𝑓(𝑦).
⇒ 𝑥4 = 𝑦4

⇒ 𝑥 = ±𝑦
∴ 𝑓(𝑥) = 𝑓(𝑦) does not imply that 𝑥 = 𝑦.
For example 𝑓(1) = 𝑓(−1) = 1
∴ 𝑓 is not one - one.

30
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Consider an element 2 in co - domain R. It is clear that there does not exist any 𝑥 in
domain 𝑅 such that 𝑓(𝑥) = 2.
∴ 𝑓 is not onto.
Hence, function 𝑓 is neither one - one nor onto.
The correct answer is D.

12. Let 𝑓: 𝑅 → 𝑅 be defined as 𝑓(𝑥) = 3𝑥. Choose the correct answer.

(A) 𝑓 is one‐one and onto
(B) 𝑓 is many‐one onto
(C) 𝑓 is one‐one but not onto
(D) 𝑓 is neither one‐one nor onto.

Solution:
𝑓: 𝑅 → 𝑅 is defined as 𝑓(𝑥) = 3𝑥.
Suppose 𝑥, 𝑦 ∈ 𝑅 such that 𝑓(𝑥) = 𝑓(𝑦).
⇒ 3𝑥 = 3𝑦
⇒𝑥=𝑦
∴ 𝑓 is one - one.
𝑦
Also, for any real number (𝑦) in co-domain 𝑅, there exists 3 in 𝑅 such that
𝑦 𝑦
𝑓 ( 3) = 3( 3) = 𝑦

∴ 𝑓 is onto.
Hence, function 𝑓 is one - one and onto.
The correct answer is A.

31
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

EXERCISE 1.3

1. Let 𝑓: {1, 3, 4} → {1, 2, 5} and 𝑔: {1, 2, 5} → {1 , 3} be given by

𝑓 = {(1, 2), (3, 5), (4, 1)} and 𝑔 = {(1, 3), (2, 3), (5, 1)} Write down 𝑔𝑜𝑓.

Solution:
The functions 𝑓: {1, 3, 4} → {1, 2, 5} and 𝑔: {1, 2, 5} → {1, 3} are defined as
𝑓 = {(1,2), (3,5), (4,1)} and 𝑔 = {(1, 3), (2, 3), (5, 1)}
𝑔𝑜𝑓(1) = 𝑔[𝑓(1)] = 𝑔(2) = 3 [𝑎𝑠 𝑓(1) = 2 and 𝑔(2) = 3]
𝑔𝑜𝑓(3) = 𝑔[𝑓(3)] = 𝑔(5) = 1 [𝑎𝑠 𝑓(3) = 5 and 𝑔(5) = 1]
𝑔𝑜𝑓(4) = 𝑔[𝑓(4)] = 𝑔(1) = 3 [𝑎𝑠 𝑓(4) = 1 and 𝑔(1) = 3]
Hence, 𝑔𝑜𝑓 = {(1, 3), (3, 1), (4, 3)}

2. Let 𝑓, 𝑔 and ℎ be functions from 𝑅 to R. Show that

(𝑓 + 𝑔)𝑜ℎ = 𝑓𝑜ℎ + 𝑔𝑜ℎ
(𝑓. 𝑔)𝑜ℎ = (𝑓𝑜ℎ) . (𝑔𝑜ℎ)

Solution:
⇒To prove: (𝑓 + 𝑔)𝑜ℎ = 𝑓𝑜ℎ + 𝑔𝑜ℎ
LHS = [(𝑓 + 𝑔)𝑜ℎ](𝑥)
= (𝑓 + 𝑔)[ℎ(𝑥)]
= 𝑓[ℎ(𝑥)] + 𝑔[ℎ(𝑥)]
= (𝑓𝑜ℎ)(𝑥) + (𝑔𝑜ℎ)(𝑥)
= {(𝑓𝑜ℎ)(𝑥) + (𝑔𝑜ℎ)}(𝑥) = 𝑅𝐻𝑆
∴ {(𝑓 + 𝑔)𝑜ℎ}(𝑥) = {(𝑓𝑜ℎ)(𝑥) + (𝑔𝑜ℎ)}(𝑥) for all 𝑥 ∈ 𝑅
Hence, (𝑓 + 𝑔)𝑜ℎ = 𝑓𝑜ℎ + 𝑔𝑜ℎ

32
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

To Prove: (𝑓𝑔)𝑜ℎ = (𝑓𝑜ℎ). (𝑔𝑜ℎ)

LHS = [(𝑓. 𝑔)𝑜ℎ](𝑥)
= (𝑓. 𝑔)[ℎ(𝑥)]
= 𝑓[ℎ(𝑥)]. 𝑔[ℎ(𝑥)]
= (𝑓𝑜ℎ)(𝑥) . (𝑔𝑜ℎ)(𝑥)
= {(𝑓𝑜ℎ). (𝑔𝑜ℎ)}(𝑥) = 𝑅𝐻𝑆
∴ [(𝑓. 𝑔)𝑜ℎ](𝑥) = {(𝑓𝑜ℎ). (𝑔𝑜ℎ)}(𝑥) for all 𝑥 ∈ 𝑅
Hence, (𝑓. 𝑔)𝑜ℎ = (𝑓𝑜ℎ). (𝑔𝑜ℎ)

3. Find 𝑔𝑜𝑓 and 𝑓𝑜𝑔, if

(i) 𝑓(𝑥) = |𝑥| and 𝑔(𝑥) = |5𝑥 − 2|
1
(ii) 𝑓(𝑥) = 8𝑥 3 and 𝑔(𝑥) = 𝑥 3

Solution:
(i). 𝑓(𝑥) = |𝑥| and 𝑔(𝑥) = |5𝑥 − 2|

∴ 𝑔𝑜𝑓 (𝑥) = 𝑔(𝑓(𝑥)) = 𝑔(|𝑥|) = |5|𝑥|−2|

𝑓𝑜𝑔(𝑥) = 𝑓(𝑔(𝑥)) = 𝑓(|5𝑥 − 2|) = ||5𝑥 − 2|| = |5𝑥 − 2|

1
(ii). 𝑓(𝑥) = 8𝑥 3 and 𝑔(𝑥) = 𝑥 3
1
∴ 𝑔𝑜𝑓(𝑥) = 𝑔(𝑓(𝑥)) = 𝑔(8𝑥 3 ) = (8𝑥 3 )3 = 2𝑥
1 1
𝑓𝑜𝑔(𝑥) = 𝑓(𝑔(𝑥)) = 𝑓(𝑥 3 ) = 8(𝑥 3 )3 = 8𝑥

33
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

(4𝑥+3) 2 2
4. If 𝑓(𝑥) = (6𝑥−4), 𝑥 ≠ 3 , show that 𝑓𝑜𝑓(𝑥) = 𝑥, for all 𝑥 ≠ 3. What is the inverse of 𝑓?

Solution:
(4𝑥+3) 2
It is given that 𝑓(𝑥) = (6𝑥−4), 𝑥 ≠ 3

4𝑥+3
4𝑥+3 4( )+3
6𝑥−4
(𝑓𝑜𝑓) (𝑥) = 𝑓(𝑓(𝑥)) = 𝑓 ( )= 4𝑥+3
6𝑥−4 6(6𝑥−4)−4

16𝑥+12+18𝑥−12 34𝑥
= =
24𝑥+18−24𝑥+16 34

=𝑥
2
∴ 𝑓𝑜𝑓(𝑥) = 𝑥, for all 𝑥 ≠ 3.

⇒ 𝑓𝑜𝑓 = 𝐼𝑥
Hence, the given function 𝑓 is invertible and the inverse of 𝑓 is 𝑓 itself.

5. State with reason whether following functions have inverse

(i) 𝑓: {1, 2, 3, 4} → {10} with
𝑓 = { (1, 10), (2, 10), (3, 10), (4, 10)}
(ii) 𝑔 ∶ {5, 6, 7, 8} → {1 , 2, 3, 4} with
𝑔 = {(5,4), (6, 3), (7, 4), (8, 2)}
(iii) ℎ: {2, 3, 4, 5} → {7, 9, 11, 13} with
ℎ = {(2, 7), (3, 9), (4, 11), (5, 13)}

Solution:
(i) 𝑓{1, 2, 3, 4} → {10} defined as 𝑓 = {(1, 10) , (2, 10), (3, 10), (4, 10)}
From the given definition of f, we found that 𝑓 is a many one function as
𝑓(1) = 𝑓(2) = 𝑓(3) = 𝑓(4) = 10

34
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

∴ 𝑓 is not one - one.

Hence, function 𝑓 does not have an inverse.
(ii) 𝑔: {5, 6, 7, 8} → {1, 2, 3, 4} defined as
𝑔 = {(5, 4) , (6, 3), (7, 4), (8, 2)}
From the given definition of 𝑔, it is seen that 𝑔 is a many one function as
𝑔(5) = 𝑔(7) = 4.
∴ 𝑔 is not one - one.
Hence, function 𝑔 does not have an inverse.
(iii) ℎ: {2, 3, 4, 5} → {7, 9, 11, 13} defined as
ℎ = {(2, 7), (3, 9), (4, 11), (5, 13)}
It is seen that all distinct elements of the set {2, 3, 4, 5} have distinct images under ℎ.
∴ function ℎ is one - one.
Also, ℎ is onto since for every element 𝑦 of the set {7, 9, 11, 13}, there exists an
element 𝑥 in the set {2, 3, 4, 5}, such that ℎ(𝑥) = 𝑦.
Thus, ℎ is a one - one and onto function.
Hence, ℎ has an inverse.

𝑥
6. Show that 𝑓: [−1, 1] → 𝑅, given by 𝑓(𝑥) = (𝑥+2) is one‐one. Find the inverse of the
function 𝑓: [−1, 1] →Range 𝑓.
𝑥 2𝑦
(Hint: For 𝑦 ∈ Range 𝑓, 𝑦 = 𝑓(𝑥) = 𝑥+2 , for some 𝑥 in [−1, 1], i.e., 𝑥 = (1−𝑦))

Solution:
𝑥
𝑓: [−1, 1] → 𝑅 is given as 𝑓(𝑥) = (𝑥+2)

For one - one

Suppose 𝑓(𝑥) = 𝑓(𝑦)

35
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions
𝑥 𝑦
⇒ 𝑥+2 = 𝑦+2

⇒ 𝑥𝑦 + 2𝑥 = 𝑥𝑦 + 2𝑦
⇒ 2𝑥 = 2𝑦
⇒𝑥=𝑦
𝑓 is a one - one function.
It’s clear that the function 𝑓: [−1, 1] →Range 𝑓 is onto.
∴ 𝑓: [−1, 1] → Range 𝑓 is one - one and onto and hence, the inverse of the
function 𝑓: [−1, 1] → Range 𝑓 exists.
Suppose 𝑔: Range 𝑓 → [−1, 1] be the inverse of 𝑓.
Suppose 𝑦 be an arbitrary element of range 𝑓.
Since 𝑓: [−1, 1] → Range 𝑓 is onto, we have
𝑦 = 𝑗(𝑥) for some 𝑥 ∈ [−1, 1]
𝑥
⇒ 𝑦 = 𝑥+2

⇒ 𝑥𝑦 + 2𝑦 = 𝑥
⇒ 𝑥(1 − 𝑦) = 2𝑦
2𝑦
⇒ 𝑥 = 1−𝑦, 𝑦 ≠ 1

Now, let us define 𝑔: Range 𝑓 → [−1, 1] as

2𝑦
𝑔(𝑦) = 1−𝑦, 𝑦 ≠ 1

Now,
𝑥
𝑥 2( ) 2𝑥 2𝑥
𝑥+2
(𝑔𝑜𝑓)(𝑥) = 𝑔(𝑓(𝑥)) = 𝑔 ( )= 𝑥 = 𝑥+2−𝑥 = =𝑥
𝑥+2 1−( ) 2
𝑥+2

and
2𝑦
2𝑦 1−𝑦 2𝑦 2𝑦
(𝑓𝑜𝑔)(𝑦) = 𝑓(𝑔(𝑦)) = 𝑓 ( )= 2𝑦 = 2𝑦+2−2𝑦 = =𝑦
1−𝑦 +2 2
1−𝑦

∴ 𝑔𝑜𝑓 = 𝑥 = 𝐼[−1,1] and 𝑓𝑜𝑔 = 𝑦 = 𝐼𝑅𝑎𝑛𝑔𝑒 𝑓

𝑓 −1 = 𝑔
−1 2𝑦
Hence, the inverse of 𝑓 𝑖𝑠, 𝑓 (𝑦) =
1−𝑦
, 𝑦≠1

36
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

7. Consider 𝑓: 𝑅 → 𝑅 given by 𝑓(𝑥) = 4𝑥 + 3. Show that 𝑓 is invertible. Find the inverse

of 𝑓.

Solution:
𝑓: 𝑅 → 𝑅 is given by, 𝑓(𝑥) = 4𝑥 + 3
For one -one
Suppose 𝑓(𝑥) = 𝑓(𝑦)
⇒ 4𝑥 + 3 = 4𝑦 + 3
⇒ 4𝑥 = 4𝑦
⇒𝑥=𝑦
∴ 𝑓 is a one - one function.
For onto
For 𝑦 ∈ 𝑅, suppose 𝑦 = 4𝑥 + 3.
𝑦−3
⇒𝑥= ∈𝑅
4
𝑦−3
Hence, for any 𝑦 ∈ 𝑅, there exists 𝑥 = ∈ 𝑅, such that
4

𝑦−3 𝑦−3
𝑓(𝑥) = 𝑓 ( ) = 4( ) + 3 = 𝑦.
4 4

∴ 𝑓 is onto.
Thus, 𝑓 is one‐ one and onto and hence, 𝑓 −1 exists.
𝑦−3
Let us define 𝑔: 𝑅 → 𝑅 by 𝑔(𝑥) = 4

Now,
(4𝑥+3)−3 4𝑥
(𝑔𝑜𝑓)(𝑥) = 𝑔(𝑓(𝑥)) = 𝑔(4𝑥 + 3) = = =𝑥
4 4

and
𝑦−3 𝑦−3
(𝑓𝑜𝑔) (𝑦) = 𝑓(𝑔(𝑦)) = 𝑓 ( ) = 4( )+3= 𝑦−3+3= 𝑦
4 4

∴ 𝑔𝑜𝑓 = 𝑓𝑜𝑔 = 𝐼𝑅
𝑦−3
Hence, 𝑓 is invertible and the inverse of 𝑓 is given by 𝑓 −1 (𝑦) = 𝑔(𝑦) = .
4

37
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

8. Consider 𝑓: 𝑅+ → [4, ∞) given by 𝑓(𝑥) = 𝑥 2 + 4. Show that 𝑓 is invertible with the

inverse 𝑓 −1 of 𝑓 given by 𝑓 −1 (𝑦) = √𝑦 − 4, where 𝑅+ is the set of all non‐negative
real numbers.

Solution:
𝑓: 𝑅+ → [4, ∞) is given as 𝑓(𝑥) = 𝑥 2 + 4.
For one - one
Suppose 𝑓(𝑥) = 𝑓(𝑦)
⇒ 𝑥2 + 4 = 𝑦2 + 4

⇒ 𝑥2 = 𝑦2

⇒ 𝑥 = 𝑦 [𝑎𝑠 𝑥 = 𝑦 ∈ 𝑅+ ]
∴ 𝑓 is a one - one function.
For onto
For ∈ [4, ∞) , suppose 𝑦 = 𝑥 2 + 4
⇒ 𝑥2 = 𝑦 − 4 ≥ 0 [as 𝑦 ≥ 4]

⇒ 𝑥 = √𝑦 − 4 ≥ 0

Hence, for any 𝑦 ∈ [4, ∞), there exists 𝑥 = √𝑦 − 4 ∈ 𝑅+ , such that

2
𝑓(𝑥) = 𝑓(√𝑦 − 4) = (√𝑦 − 4) + 4 = 𝑦 − 4 + 4 = 𝑦

∴ 𝑓 is onto.
As the given function 𝑓 is one - one and onto and hence, 𝑓 −1 exists.

Let us define 𝑔: [4, ∞) → 𝑅+ by 𝑔(𝑦) = √𝑦 − 4

Now,

(𝑔𝑜𝑓) (𝑥) = 𝑔(𝑓(𝑥)) = 𝑔(𝑥 2 + 4) = √(𝑥 2 + 4) − 4 = √𝑥 2 = 𝑥

and

(𝑓𝑜𝑔) (𝑦) = 𝑓(𝑔(𝑦)) = 𝑓(√𝑦 − 4) = (√𝑦 − 4)2 + 4 = 𝑦 − 4 + 4 = 𝑦

∴ 𝑔𝑜𝑓 = 𝑓𝑜𝑔 = 𝐼𝑅

38
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Hence, 𝑓 is invertible and the inverse of 𝑓 is given by 𝑓 −1 (𝑦) = 𝑔(𝑦) = √𝑦 − 4

9. Consider 𝑓: 𝑅+ → [−5, ∞) given by 𝑓(𝑥) = 9𝑥 2 + 6𝑥 − 5. Show that 𝑓 is invertible with

(√𝑦+6)−1
𝑓 −1 (𝑦) = ( ).
3

Solution:
Given:
𝑓: 𝑅+ → [−5, ∞) is given as 𝑓(𝑥) = 9𝑥 2 + 6𝑥 − 5.
Suppose 𝑥1 , 𝑥2 are two values of 𝑥 for which 𝑓(𝑥1 ) = 𝑓(𝑥2 )
∴ 9𝑥12 + 6𝑥1 − 5 = 9𝑥22 + 6𝑥2 − 5
⇒ 9(𝑥1 + 𝑥2 )(𝑥1 − 𝑥2 ) + 6(𝑥1 − 𝑥2 ) = 0
⇒ 9(𝑥 − 𝑥2 )(9𝑥1 + 9𝑥2 + 6) = 0
∵ 𝑥1 , 𝑥2 ≥ 0
∴ 9𝑥1 + 9𝑥2 + 6 ≠ 0
∴ 𝑥1 − 𝑥2 = 0
∴ 𝑥1 = 𝑥2 if 𝑓(𝑥1 ) = 𝑓(𝑥2 )
∴ 𝑓(𝑥) is one-one function.
Again, 𝑓(𝑥) = 9𝑥 2 + 6𝑥 − 5
⇒ 𝑓(𝑥) = (3𝑥 + 1)2 − 6 …(i)
∵𝑥≥0
∴ 3𝑥 + 1 ≥ 1
∴ (3𝑥 + 1)2 ≥ 1
∴ (3𝑥 + 1)2 − 6 ≥ −5
∴ 𝑓(𝑥) ≥ −5
∴ Range of 𝑓(𝑥) = [−5, ∞)
∵ Range = Co-domain

39
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

∴ 𝑓(𝑥) is onto function.

∵ 𝑓(𝑥) is one-one and onto both.
∴ 𝑓(𝑥) is invertible
Again from (i)
𝑦 = 𝑓(𝑥) = (3𝑥 + 1)2 − 6
⇒ (3𝑥 + 1)2 = 𝑦 + 6

⇒ 3𝑥 + 1 = √𝑦 + 6 (∵ 3𝑥 + 1 ≥ 0)

√𝑦 + 6 − 1
⇒𝑥=
3
√𝑦 + 6 − 1
∴ 𝑓 −1 (𝑦) −
3
Hence, the inverse of 𝑓 is given by
(√𝑦+6)−1
𝑓 −1 (𝑦) = ( )
3

10. Let 𝑓: 𝑋 → 𝑌 be an invertible function. Show that 𝑓 has unique inverse.

(Hint: suppose 𝑔1 and 𝑔2 are two inverses of 𝑓. Then for all 𝑦 ∈ 𝑌,
𝑓𝑜𝑔1 (𝑦) = 𝐼𝑌 (𝑦) = 𝑓𝑜𝑔2 (𝑦). Use one‐one ness of 𝑓).

Solution:
Suppose 𝑓: 𝑋 → 𝑌 be an invertible function.
Also, suppose 𝑓 has two inverses (say 𝑔1 and 𝑔2 )
Then, for all 𝑦 ∈ 𝑌, we have
𝑓𝑜𝑔1 (𝑦) = 𝐼𝑌 (𝑦) = 𝑓𝑜𝑔2 (𝑦)
⇒ 𝑓(𝑔1 (𝑦)) = 𝑓(𝑔2 (𝑦))
⇒ 𝑔1 (𝑦) = 𝑔2 (𝑦) [as 𝑓 is invertible ⇒ 𝑓 is one‐one]

⇒ 𝑔1 = 𝑔2

40
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Hence, the given function, 𝑓 has a unique inverse.

11. Consider 𝑓: {1, 2, 3} → {𝑎, 𝑏, 𝑐} given by 𝑓(1) = 𝑎, 𝑓(2) = 𝑏 and 𝑓(3) = 𝑐. Find 𝑓 −1
and show that (𝑓 −1 )−1 = 𝑓.

Solution:
Function 𝑓: {1, 2, 3} → {𝑎, 𝑏, 𝑐} is given by 𝑓(1) = 𝑎, 𝑓(2) = 𝑏, and 𝑓(3) = 𝑐
If we define 𝑔: {𝑎, 𝑏, 𝑐} → {1, 2, 3} as 𝑔(𝑎) = 1, 𝑔(𝑏) = 2, 𝑔(𝑐) = 3.
We have
(𝑓𝑜𝑔) (𝑎) = 𝑓(𝑔(𝑎)) = 𝑓(1) = 𝑎
(𝑓𝑜𝑔) (𝑏) = 𝑓(𝑔(𝑏)) = 𝑓(2) = 𝑏
(𝑓𝑜𝑔) (𝑐) = 𝑓(𝑔(𝑐)) = 𝑓(3) = 𝑐
and
(𝑔𝑜𝑓)(1) = 𝑔(𝑓(1)) = 𝑓(𝑎) = 1
(𝑔𝑜𝑓)(2) = 𝑔(𝑓(2)) = 𝑓(𝑏) = 2
(𝑔𝑜𝑓)(3) = 𝑔(𝑓(3)) = 𝑓(𝑐) = 3

∴ 𝑔𝑜𝑓 = 𝐼𝑋 and 𝑓𝑜𝑔 = 𝐼𝑌 , where 𝑋 = {1, 2, 3} and 𝑌 = {𝑎, 𝑏, 𝑐}.

Thus, the inverse of 𝑓 exists and 𝑓 −1 = 𝑔.
∴ 𝑓 −1 : {𝑎, 𝑏, 𝑐} → {1, 2, 3} is given by
𝑓 −1 (𝑎) = 1
𝑓 −1 (𝑏) = 2
𝑓 −1 (𝑐) = 3
Let us now find the inverse of 𝑓 −1 i.e., find the inverse of 𝑔.
If we define ℎ: {1, 2, 3} → {𝑎, 𝑏, 𝑐} as ℎ(1) = 𝑎, ℎ(2) = 𝑏, ℎ(3) = 𝑐
We have
(𝑔𝑜ℎ) (1) = 𝑔(ℎ(1)) = 𝑔(𝑎) = 1

41
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

(𝑔𝑜ℎ)(2) = 𝑔(ℎ(2)) = 𝑔(𝑏) = 2

(𝑔𝑜ℎ)(3) = 𝑔(ℎ(3)) = 𝑔(𝑐) = 3

and
(ℎ𝑜𝑔)(𝑎) = ℎ(𝑔(𝑎)) = ℎ(1) = 𝑎
(hog) (𝑏) = ℎ(𝑔(𝑏)) = ℎ(2) = 𝑏

(ℎ𝑜𝑔)(𝑐) = ℎ(𝑔(𝑐)) = ℎ(3) = 𝑐

∴ 𝑔𝑜ℎ = 𝐼𝑋 and ℎ𝑜𝑔 = 𝐼𝑌 , where 𝑋 = {1, 2, 3} and 𝑌 = {𝑎, 𝑏, 𝑐}.

Thus, the inverse of 𝑔 exists and 𝑔−1 = ℎ ⇒ (𝑓 −1 )−1 = ℎ.
It can be noted that ℎ = 𝑓
Hence, (𝑓 −1 )−1 = 𝑓

12. Let 𝑓: 𝑋 → 𝑌 be an invertible function. Show that the inverse of 𝑓 −1 is 𝑓, i.e.,

(𝑓 −1 )−1 = 𝑓.

Solution:
Suppose 𝑓: 𝑋 → 𝑌 be an invertible function.
Then, there exists a function 𝑔: 𝑌 → 𝑋 such that 𝑔𝑜𝑓 = 𝐼𝑋 and 𝑓𝑜𝑔 = 𝐼𝑌 .
Here, 𝑓 −1 = 𝑔.
Now, 𝑔𝑜𝑓 = 𝐼𝑋 and 𝑓𝑜𝑔 = 𝐼𝑌
−1
⇒𝑓 𝑜𝑓 = 𝐼𝑋 and 𝑓𝑜𝑓 −1 = 𝐼𝑌
Hence, 𝑓 −1 : 𝑌 → 𝑋 is invertible and 𝑓 is the inverse of 𝑓 −1 i.e., (𝑓 −1 )−1 = 𝑓

1
13. If 𝑓: 𝑅 → 𝑅 be given by 𝑓(𝑥) = (3 − 𝑥 3 )3 , then 𝑓𝑜𝑓(𝑥) is

42
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions
1
(A) 𝑥 3
(B) 𝑥 3
(C) 𝑥
(D) (3 − 𝑥 3 )

Solution:
1
𝑓: 𝑅 → 𝑅 be given as 𝑓(𝑥) = (3 − 𝑥 3 )3
1
1 1 3 3
∴ 𝑓𝑜𝑓(𝑥) = 𝑓(𝑓(𝑥)) = 𝑓((3 − 𝑥 3 ) ) = [3 − ((3 − 𝑥
3 3 )3 ) ]

1 1
= [3 − (3 − 𝑥 3 )]3 = (𝑥 3 )3 = 𝑥
∴ 𝑓𝑜𝑓(𝑥) = 𝑥
The correct Answer is C.

4 4𝑥
14. Let 𝑓: 𝑅 − {− 3} → 𝑅 be a function defined as 𝑓(𝑥) = 3𝑥+4. The inverse of 𝑓 is the
4
map 𝑔: Range 𝑓 → 𝑅 − {− 3} given by
3𝑦
(A) 𝑔(𝑦) = 3−4𝑦
4𝑦
(B) 𝑔(𝑦) = 4−3𝑦
4𝑦
(C) 𝑔(𝑦) = 3−4𝑦
3𝑦
(D) 𝑔(𝑦) = 4−3𝑦

Solution:
4 4𝑥
It is given that 𝑓: 𝑅 − {− 3} → 𝑅 be a function as 𝑓(𝑥) = 3𝑥+4

Suppose 𝑦 be an arbitrary element of Range 𝑓

43
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

4
Then, there exists 𝑥 ∈ 𝑅 − {− 3} such that 𝑦 = 𝑓(𝑥)
4𝑥
⇒ 𝑦 = 3𝑥+4

⇒ 3𝑥𝑦 + 4𝑦 = 4𝑥
⇒ 𝑥(4 − 3𝑦) = 4𝑦
4𝑦
⇒ 𝑥 = 4−3𝑦

4 4𝑦
Let us define 𝑔: Range 𝑓 → 𝑅 − {− 3} as 𝑔(𝑦) = 4−3𝑦

Now,
4𝑥
4𝑥 4( )
3𝑥+4
𝑔𝑜𝑓(𝑥) = 𝑔(𝑓(𝑥)) = 𝑔 (3𝑥+4) = 4𝑥
4−3( )
3𝑥+4

16𝑥 16𝑥
= = = 𝑥
12𝑥+16−12𝑥 16

and
4𝑦
4𝑦 4( )
4−3𝑦
𝑓𝑜𝑔 (𝑦) = 𝑓(𝑔(𝑦)) = 𝑓 (4−3𝑦) = 4𝑦
3( )+4
4−3𝑦

16𝑦 16𝑦
= 12𝑦+16−12𝑦 = =𝑦
16

∴ 𝑔𝑜𝑓 = 𝐼𝑅−{−4} and 𝑓𝑜𝑔 = 𝐼𝑅𝑎𝑛𝑔𝑒 𝑓

3

Thus, 𝑔 is the inverse of 𝑓 𝑖. 𝑒. , 𝑓 −1 = 𝑔.

4
Hence, the inverse of 𝑓 is the map 𝑔: Range 𝑓 → 𝑅 − {− 3}, which is given by
4𝑦
𝑔(𝑦) = 4−3𝑦.

The correct Answer is B.

EXERCISE 1.4

44
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

1. Determine whether or not each of the definition of ∗ given below gives a binary
operation. In the event that ∗ is not a binary operation, give justification for this.

(i) On 𝑍 + , define ∗ by 𝑎 ∗ 𝑏 = 𝑎– 𝑏
(ii) On 𝑍 + , define ∗ by 𝑎 ∗ 𝑏 = 𝑎𝑏
(iii) On 𝑅, define ∗ by 𝑎 ∗ 𝑏 = 𝑎𝑏 2

(iv) On 𝑍 + , define ∗ by 𝑎 ∗ 𝑏 = |𝑎– 𝑏|

(v) On 𝑍 + , define ∗ by 𝑎 ∗ 𝑏 = 𝑎

Solution:
(i) On 𝑍 + , ∗ is defined by 𝑎 ∗ 𝑏 = 𝑎 − 𝑏.
Here, the image of (1, 2) under ∗ is 1 ∗ 2 = 1 − 2 = −1 ∉ 𝑍 + .
Hence, the given definition of ∗ is not a binary operation.
(ii) On 𝑍 + , ∗ is defined by 𝑎 ∗ 𝑏 = 𝑎𝑏.
It is clear that for each 𝑎, 𝑏 ∈ 𝑍 + , there is a unique element ab in 𝑍 + .
This means that ∗ takes each pair (𝑎, 𝑏) to a unique element 𝑎 ∗ 𝑏 = 𝑎𝑏 in 𝑍 + .
Hence, ∗ is a binary operation.
(iii) On 𝑅, ∗ is defined by 𝑎 ∗ 𝑏 = 𝑎𝑏 2 .
It is clear that for each 𝑎, 𝑏 ∈ 𝑅, there is a unique element 𝑎𝑏 2 in 𝑅.
This means that ∗ takes each pair (𝑎, 𝑏) to a unique element 𝑎 ∗ 𝑏 = 𝑎𝑏 2 in 𝑅.
Hence, ∗ is a binary operation.
(iv) On 𝑍 + , ∗ is defined by 𝑎 ∗ 𝑏 = |𝑎 − 𝑏|.
Here, the image of (1, 1) under ∗ is 1 ∗ 1 = |1 − 1| = 0 ∉ 𝑍 +
Hence, ∗ is not a binary operation.
(v) On 𝑍 + , ∗ is defined by 𝑎 ∗ 𝑏 = 𝑎.
It is clear that for each 𝑎, 𝑏 ∈ 𝑍 + , there is a unique element 𝑎 in 𝑍 + .
This means that ∗ takes each pair (𝑎, 𝑏) to a unique element 𝑎 ∗ 𝑏 = 𝑎 in 𝑍 + .
Hence, ∗ is a binary operation.

45
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

2. For each operation ∗ defined below, determine whether ∗ is binary, commutative

or associative.

(i) On 𝑍, define 𝑎 ∗ 𝑏 = 𝑎– 𝑏
(ii) On 𝑄, define 𝑎 ∗ 𝑏 = 𝑎𝑏 + 1
𝑎𝑏
(iii) On 𝑄, define 𝑎 ∗ 𝑏 = 2

(iv) On 𝑍 + , define 𝑎 ∗ 𝑏 = 2𝑎𝑏

(v) On 𝑍 + , define 𝑎 ∗ 𝑏 = 𝑎𝑏
𝑎
(vi) On 𝑅– {– 1}, define 𝑎 ∗ 𝑏 = 𝑏+1

Solution:
(i) On 𝑍, ∗ is defined by 𝑎 ∗ 𝑏 = 𝑎 − 𝑏.
If 𝑎, 𝑏 ∈ 𝑍, then 𝑎 − 𝑏 ∈ 𝑍.
Hence, the operation ∗ is a binary operation.
It is observed that 1 ∗ 2 = 1 − 2 = −1 and 2 ∗ 1 = 2 − 1 = 1.
∴ 1 ∗ 2 ≠ 2 ∗ 1, where 1, 2 ∈ 𝑍
Hence, the operation ∗ is not commutative.
Also, we have
(1 ∗ 2) ∗ 3 = (1 − 2) ∗ 3 = −1 ∗ 3 = −1 − 3 = −4
1 ∗ (2 ∗ 3) = 1 ∗ (2 − 3) = 1 ∗ −1 = 1 − (−1) = 2
∴ (1 ∗ 2) ∗ 3 ≠ 1 ∗ (2 ∗ 3) , where 1, 2, 3 ∈ 𝑍
Hence, the operation ∗ is not associative.
(ii) On 𝑄, ∗ is defined by 𝑎 ∗ 𝑏 = 𝑎𝑏 + 1.
If 𝑎, 𝑏 ∈ 𝑄, then 𝑎𝑏 + 1 ∈ 𝑄.
Hence, the operation ∗ is a binary operation.
We know that: 𝑎𝑏 = 𝑏𝑎 for all 𝑎, 𝑏 ∈ 𝑄
⇒ 𝑎𝑏 + 1 = 𝑏𝑎 + 1 for all 𝑎, 𝑏 ∈ 𝑄

46
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

⇒ 𝑎 ∗ 𝑏 = 𝑏 ∗ 𝑎 for all 𝑎, 𝑏 ∈ 𝑄

Hence, the operation ∗ is commutative.

It can be observed that
(1 ∗ 2) ∗ 3 = (1 × 2 + 1) ∗ 3 = 3 ∗ 3 = 3 × 3 + 1 = 10
1 ∗ (2 ∗ 3) = 1 ∗ (2 × 3 + 1) = 1 ∗ 7 = 1 × 7 + 1 = 8
(1 ∗ 2) ∗ 3 ≠ 1 ∗ (2 ∗ 3) , where 1, 2, 3 ∈ 𝑄
Hence, the operation ∗ is not associative.
Hence, the operation ∗ is commutative and not associative.
𝑎𝑏
(iii) On 𝑄, ∗ is defined by a ∗ 𝑏 = 2
𝑎𝑏
If 𝑎, 𝑏 ∈ 𝑄, then ∈ 𝑄.
2

Hence, the operation ∗ is a binary operation.

We know that: 𝑎𝑏 = 𝑏𝑎 for all 𝑎, 𝑏 ∈ 𝑄
𝑎𝑏 𝑏𝑎
⇒ 2
= 2
for all 𝑎, 𝑏 ∈ 𝑄

⇒ a ∗ 𝑏 = b ∗ 𝑎 for all 𝑎, 𝑏 ∈ 𝑄

Hence, the operation ∗ is commutative.

Again, for all 𝑎, 𝑏, 𝑐 ∈ 𝑄, we have
𝑎𝑏
𝑎𝑏 ( )𝑐 𝑎𝑏𝑐
2
(𝑎 ∗ 𝑏) ∗ 𝑐 = ( 2 ) ∗ 𝑐 = =
2 4

and
𝑏𝑐
𝑏𝑐 𝑎( ) 𝑎𝑏𝑐
2
𝑎 ∗ (𝑏 ∗ 𝑐) = 𝑎 ∗ ( 2 ) = =
2 4

∴ (𝑎 ∗ 𝑏) ∗ 𝑐 = a ∗ (b ∗ 𝑐), where 𝑎, 𝑏, 𝑐 ∈ 𝑄
Hence, the operation ∗ is associative.
Hence, the operation ∗ is associative and commutative.
(iv) On 𝑍 + , ∗ is defined by a ∗ 𝑏 = 2𝑎𝑏 .
If 𝑎, 𝑏 ∈ 𝑍 + , then 2𝑎𝑏 ∈ 𝑍 + .
Hence, the operation ∗ is a binary operation.
we know that: 𝑎𝑏 = 𝑏𝑎 for all 𝑎, 𝑏 ∈ 𝑍 +

47
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

𝑎𝑏
⇒2 = 2𝑏𝑎 for all 𝑎, 𝑏 ∈ 𝑍 +
⇒ a ∗ 𝑏 = b ∗ 𝑎 for all 𝑎, 𝑏 ∈ 𝑍 +

Hence, the operation ∗ is commutative.

It is observed that
(1 ∗ 2) ∗ 3 = 21×2 ∗ 3 = 4 ∗ 3 = 24×3 = 212 and
1 ∗ (2 ∗ 3) = 1 ∗ 22×3 = 1 ∗ 26 = 1 ∗ 64 = 21×64 = 264
Since, (1 ∗ 2) ∗ 3 ≠ 1 ∗ (2 ∗ 3) , where 1, 2, 3 ∈ 𝑍 +
Hence, the operation ∗ is not associative.
Hence, the operation ∗ is commutative and not associative.
(v) On 𝑍 + , ∗ is defined by 𝑎 ∗ 𝑏 = 𝑎𝑏 .
If 𝑎, 𝑏 ∈ 𝑍 + , then 𝑎𝑏 ∈ 𝑍 + .
Hence, the operation ∗ is a binary operation.
It is observed that
1 ∗ 2 = 12 = 1 and 2 ∗ 1 = 21 = 2
Since, 1 ∗ 2 ≠ 2 ∗ 1, where 1, 2 ∈ 𝑍 +
Hence, the operation ∗ is not commutative.
It is also observed that
(2 ∗ 3) ∗ 4 = 23 ∗ 4 = 8 ∗ 4 = 84 = 212 and
2 ∗ (3 ∗ 4) = 2 ∗ 34 = 2 ∗ 81 = 281
(2 ∗ 3) ∗ 4 ≠ 2 ∗ (3 ∗ 4) , where 2, 3, 4 ∈ 𝑍 +
Hence, the operation ∗ is not associative.
Hence, the operation ∗ is neither associative nor commutative.
𝑎
(vi) On 𝑅 − {−1}, ∗ is defined by 𝑎 ∗ 𝑏 =
𝑏+1
𝑎
If 𝑎, 𝑏 ∈ 𝑅 − {−1}, then 𝑏+1 ∈ 𝑅 − {−1}.

Hence, the operation ∗ is a binary operation.

It is observed that
1 1 2 2
1 ∗ 2 = 2+1 = 3 and 2 ∗ 1 = 1+1 = 2 = 1

48
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Since, 1 ∗ 2 ≠ 2 ∗ 1, where 1, 2 ∈ 𝑅 − {−1}

Hence, the operation ∗ is not commutative.
It is also observed that
1
1 1 3 1
(1 ∗ 2) ∗ 3 = 2+1 ∗ 3 = 3 ∗ 3 = = 12
3+1

and
2 2 1 1 1 2
1 ∗ (2 ∗ 3) = 1 ∗ 3+1 = 1 ∗ 4 = 1 ∗ 2 = 1 = 3 =3
+1
2 2

Since, (1 ∗ 2) ∗ 3 ≠ 1 ∗ (2 ∗ 3) , where 1, 2, 3 ∈ 𝑅 − {−1}

Hence, the operation ∗ is not associative.
Hence, the operation ∗ is neither associative nor commutative.

3. Consider the binary operation ∧ on the set {1, 2, 3, 4, 5} defined by

𝑎 ∧ 𝑏 =min {𝑎, 𝑏}. Write the operation table of the operation ∧.

Solution:
Since, the binary operation on the set {1, 2, 3, 4, 5} is defined as 𝑎 ∧ 𝑏 = min {𝑎, 𝑏}
for all 𝑎, 𝑏 ∈ {1, 2, 3, 4, 5}.
Hence, the operation table for the given operation ∧ can be given as:
∧ 1 2 3 4 5
1 1 1 1 1 1
2 1 2 2 2 2
3 1 2 3 3 3
4 1 2 3 4 4
5 1 2 3 4 5

4. Consider a binary operation ∗ on the set {1, 2, 3, 4, 5} given by the following

multiplication table.

49
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

(i) Compute (2 ∗ 3) ∗ 4 and 2 ∗ (3 ∗ 4)

(ii) Is ∗ commutative?
(iii) Compute (2 ∗ 3) ∗ (4 ∗ 5) .
(Hint: use the following table)

* 1 2 3 4 5

1 1 1 1 1 1
2 1 2 1 2 1
3 1 1 3 1 1
4 1 2 1 4 1
5 1 1 1 1 5

Solution:
(i) We need to find: (2 ∗ 3) ∗ 4 and 2 ∗ (3 ∗ 4)
Using table,
(2 ∗ 3) ∗ 4 = 1 ∗ 4 = 1
2 ∗ (3 ∗ 4) = 2 ∗ 1 = 1
(ii) For every 𝑎, 𝑏 ∈ {1, 2, 3, 4, 5}, we can observe that 𝑎 ∗ 𝑏 = 𝑏 ∗ 𝑎. Hence, the
operation
∗ is commutative.
(iii) From table, (2 ∗ 3) = 1 and (4 ∗ 5) = 1
∴ (2 ∗ 3) ∗ (4 ∗ 5) = 1 ∗ 1 = 1

5. Let ∗′ be the binary operation on the set {1 , 2, 3, 4, 5} defined by 𝑎 ∗′ 𝑏 = 𝐻. 𝐶. 𝐹. of 𝑎

and 𝑏. Is the operation ∗′ same as the operation ∗ defined in question 4 above? Justify
your answer.

50
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Solution:
Given, the binary operation ∗′ on the set {1, 2, 3, 4, 5} is defined as 𝑎 ∗′ 𝑏 = 𝐻. 𝐶. 𝐹 of 𝑎
and 𝑏.
Hence, the operation table for the operation ∗′ is given as:
∗′ 𝟏 𝟐 𝟑 𝟒 𝟓

1 1 1 1 1 1
2 1 2 1 2 1
3 1 1 3 1 1
4 1 2 1 4 1
5 1 1 1 1 5

We can see that the operation tables for the operations ∗ and ∗′ are the same.
Hence, the operation ∗′ is same as the operation ∗.

6. Let ∗ be the binary operation on 𝑁 given by 𝑎 ∗ 𝑏 = 𝐿. 𝐶. 𝑀. of 𝑎 and 𝑏. Find

(i) 5 ∗ 7, 20 ∗ 16
(ii) Is ∗ commutative?
(iii) Is ∗ associative?
(iv) Find the identity of ∗ in 𝑁
(v) Which elements of 𝑁 are invertible for the operation ∗?

Solution:
Since, the binary operation ∗ on 𝑁 is defined as 𝑎∗ 𝑏 = 𝐿. 𝐶. 𝑀. of 𝑎 and 𝑏.
(i) Hence, 5 ∗ 7 = 𝐿. 𝐶. 𝑀. of 5 and 7 = 35
20 ∗ 16 = 𝐿. 𝐶. 𝑀 of 20 and 16 = 80

51
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

(ii) As we know that

L.C. 𝑀 of 𝑎 and 𝑏 = 𝐿. 𝐶. 𝑀 of 𝑏 and 𝑎 for all 𝑎, 𝑏 ∈ 𝑁.
Hence, 𝑎 ∗ 𝑏 = 𝑏 ∗ 𝑎
Hence, the operation ∗ is commutative.
(iii) For 𝑎, 𝑏, 𝑐 ∈ 𝑁, we have
(a ∗ 𝑏) ∗ 𝑐 = (𝐿. 𝐶. 𝑀 of 𝑎 and 𝑏) ∗ 𝑐 = LCM of 𝑎, 𝑏, and 𝑐
𝑎 ∗ (𝑏 ∗ 𝑐) = 𝑎 ∗ (𝐿𝐶𝑀 of 𝑏 and 𝑐) = 𝐿. 𝐶. 𝑀 of 𝑎, 𝑏, and 𝑐
∴ (𝑎 ∗ 𝑏) ∗ 𝑐 = 𝑎 ∗ (𝑏 ∗ 𝑐)
Hence, the operation ∗ is associative.
(iv) As we know that,
𝐿. 𝐶. 𝑀. of 𝑎 and 1 = 𝑎 = 𝐿. 𝐶. 𝑀. 1 and 𝑎 for all 𝑎 ∈ 𝑁
⇒ 𝑎 ∗ 1 = 𝑎 = 1 ∗ 𝑎 for all 𝑎 ∈ 𝑁

Hence, 1 is the identity of ∗ in 𝑁.

(v) An element 𝑎 in 𝑁 is invertible with respect to the operation ∗ if and only if there
exists
an element 𝑏 in 𝑁, such that a ∗ 𝑏 = 𝑒 = 𝑏 ∗ 𝑎.
Here, 𝑒 = 1
It means that
𝐿. 𝐶. 𝑀 of 𝑎 and 𝑏 = 1 = 𝐿. 𝐶. 𝑀 of 𝑏 and 𝑎
This is possible only if 𝑎 and 𝑏 are equal to 1.
Hence, 1 is the only invertible element of 𝑁 with respect to the operation ∗.

7. Is ∗ defined on the set {1, 2, 3, 4, 5} by 𝑎 ∗ 𝑏 = 𝐿. 𝐶. 𝑀. of 𝑎 and 𝑏 a binary operation?

Justify your answer.

Solution:
Given, the operation ∗ on the set 𝐴 = {1, 2, 3, 4, 5} as 𝑎 ∗ 𝑏 = 𝐿. 𝐶. 𝑀. of 𝑎

52
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

and 𝑏.
Hence, the operation table for the given operation ∗ is:
∗ 𝟏 𝟐 𝟑 𝟒 𝟓

1 1 2 3 4 5
2 2 2 6 4 10
3 3 6 3 12 15
4 4 4 12 4 20
5 5 10 15 20 5

From the obtained table, we can observe that,

3 ∗ 2 = 2 ∗ 3 = 6 ∉ 𝐴,
5 ∗ 2 = 2 ∗ 5 = 10 ∉ 𝐴,
3 ∗ 4 = 4 ∗ 3 = 12 ∉ 𝐴,
3 ∗ 5 = 5 ∗ 3 = 15 ∉ 𝐴,
4 ∗ 5 = 5 ∗ 4 = 20 ∉ 𝐴
Hence, the given operation ∗ is not a binary operation.

8. Let ∗ be the binary operation on 𝑁 defined by 𝑎 ∗ 𝑏 = 𝐻. 𝐶. 𝐹. of 𝑎 and 𝑏. Is ∗

commutative? Is ∗ associative? Does there exist identity for this binary operation on 𝑁?

Solution:
Given, the binary operation ∗ on 𝑁 as: 𝑎 ∗ 𝑏 = 𝐻. 𝐶. 𝐹. of 𝑎 and 𝑏
As we know that,
𝐻. 𝐶. 𝐹. of 𝑎 and 𝑏 = 𝐻. 𝐶. 𝐹. of 𝑏 and 𝑎 for all 𝑎, 𝑏 ∈ 𝑁.
∴𝑎∗𝑏 =𝑏∗𝑎
Hence, the operation ∗ is commutative.
For 𝑎, 𝑏, 𝑐 ∈ 𝑁, we have
53
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

(𝑎 ∗ 𝑏) ∗ 𝑐 = (𝐻. 𝐶. 𝐹. of 𝑎 and 𝑏) ∗ 𝑐 = 𝐻. 𝐶. 𝐹. of 𝑎, 𝑏 and 𝑐

𝑎 ∗ (𝑏 ∗ 𝑐) = 𝑎 ∗ (𝐻. 𝐶. 𝐹. of 𝑏 and 𝑐) = 𝐻. 𝐶. 𝐹. of a, 𝑏, and 𝑐
∴ (𝑎 ∗ 𝑏) ∗ 𝑐 = a ∗ (𝑏 ∗ 𝑐)
Hence, the operation ∗ is associative.
Now, an element 𝑒 ∈ 𝑁 will be the identity for the operation ∗ if 𝑎 ∗ 𝑒 = 𝑎 = 𝑒 ∗ 𝑎
for all 𝑎 ∈ 𝑁.
But this is not true for any 𝑎 ∈ 𝑁.
Hence, the operation ∗ does not have any identity in 𝑁.

9. Let ∗ be a binary operation on the set 𝑄 of rational numbers as follows:

(i) 𝑎 ∗ 𝑏 = 𝑎 − 𝑏
(ii) 𝑎 ∗ 𝑏 = 𝑎2 + 𝑏 2
(iii) 𝑎 ∗ 𝑏 = 𝑎 + 𝑎𝑏
(iv) 𝑎 ∗ 𝑏 = (𝑎 − 𝑏)2
𝑎𝑏
(v) 𝑎 ∗ 𝑏 = 4

(vi) 𝑎 ∗ 𝑏 = 𝑎𝑏 2
Find which of the binary operations are commutative and which are associative.

Solution:
(i) On 𝑄, the binary operation ∗ is defined as 𝑎 ∗ 𝑏 = 𝑎 − 𝑏. It is observed that:
1 1 1 1 3−2 1
∗3=2−3= =6
2 6

and
1 1 1 1 2−3 −1
∗2=3−2= =
3 6 6
1 1 1 1 1 1
∴ 2 ∗ 3 ≠ 3 ∗ 2, where , ∈𝑄
2 3

54
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Hence, the operation ∗ is not commutative.

It is also observed that
1 1 1 1 1 1 3−2 1 1 1 1 1 2−3 −1
(2 ∗ 3) ∗ 4 = (2 − 3) ∗ 4 = ( )∗4=6∗4=6−4= =
6 12 12

and
1 1 1 1 1 1 1 4−3 1 1 1 1 6−1 5
∗ (3 ∗ 4) = 2 ∗ (3 − 4) = 2 ∗ ( 12 ) = 2 ∗ 12 = 2 − 12 = = 12
2 12

1 1 1 1 1 1 1 1 1
Since, (2 ∗ 3) ∗ 4 ≠ 2 ∗ (3 ∗ 4), where 2 , 3 , 4 ∈ 𝑄

Hence, the operation ∗ is not associative.

(ii) On 𝑄, the binary operation ∗ is defined as 𝑎 ∗ 𝑏 = 𝑎2 + 𝑏 2 .
For 𝑎, 𝑏 ∈ 𝑄, we have
𝑎 ∗ 𝑏 = 𝑎2 + 𝑏 2 = 𝑏 2 + 𝑎2 = 𝑏 ∗ 𝑎
∴𝑎∗𝑏 =𝑏∗𝑎
Hence, the operation ∗ is commutative.
It is also found that,
(1 ∗ 2) ∗ 3 = (12 + 22 ) ∗ 3 = (1 + 4) ∗ 3 = 5 ∗ 3 = 52 + 32 = 34 and

1 ∗ (2 ∗ 3) = 1 ∗ (22 + 32 ) = 1 ∗ (4 + 9) = 1 ∗ 13 = 12 + 132 = 170

∴ (1 ∗ 2) ∗ 3 ≠ 1 ∗ (2 ∗ 3), where 1, 2, 3 ∈ 𝑄
Hence, the operation ∗ is not associative.
(iii) On 𝑄, the binary operation ∗ is defined as 𝑎 ∗ 𝑏 = 𝑎 + 𝑎𝑏.
It is found that
1∗2= 1+1×2=1+2=3
2∗1= 2+2×1=2+2=4
Since, 1 ∗ 2 ≠ 2 ∗ 1, where 1, 2 ∈ 𝑄
Hence, the operation ∗ is not commutative.
It is also observed that
(1 ∗ 2) ∗ 3 = (1 + 1 × 2) ∗ 3 = (1 + 2) ∗ 3 = 3 ∗ 3 = 3 + 3 × 3 = 3 + 9 = 12 and
∴ 1 ∗ (2 ∗ 3) = 1 ∗ (2 + 2 × 3) = 1 ∗ (2 + 6) = 1 ∗ 8 = 1 + 1 × 8 = 1 + 8 = 9
∴ (1 ∗ 2) ∗ 3 ≠ 1 ∗ (2 ∗ 3), where 1, 2, 3 ∈ 𝑄

55
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Hence, the operation ∗ is not associative.

(iv) On 𝑄, the binary operation ∗ is defined by 𝑎 ∗ 𝑏 = (𝑎 − 𝑏)2 .
For 𝑎, 𝑏 ∈ 𝑄, we have
𝑎 ∗ 𝑏 = (𝑎 − 𝑏)2
𝑏 ∗ 𝑎 = (𝑏 − 𝑎)2 = [−(𝑎 − 𝑏)]2 = (𝑎 − 𝑏)2
Since, 𝑎 ∗ 𝑏 = 𝑏 ∗ 𝑎
Hence, the operation ∗ is commutative.
Now, it is also seen that
(1 ∗ 2) ∗ 3 = (1 − 2)2 ∗ 3 = (−1)2 ∗ 3 = 1 ∗ 3 = (1 − 3)2 = (−2)2 = 4
and
1 ∗ (2 ∗ 3) = 1 ∗ (2 − 3)2 = 1 ∗ (−1)2 = 1 ∗ 1 = (1 − 1)2 = 0
Since, (1 ∗ 2) ∗ 3 ≠ 1 ∗ (2 ∗ 3), where 1, 2, 3 ∈ 𝑄
Hence, the operation ∗ is not associative.

𝑎𝑏
(v) On 𝑄, the binary operation ∗ is defined as 𝑎 ∗ 𝑏 = .
4

For 𝑎, 𝑏 ∈ 𝑄, we have
𝑎𝑏 𝑏𝑎
𝑎∗𝑏 = = =𝑏∗𝑎
4 4

𝑎∗𝑏 =𝑏∗𝑎
Hence, the operation ∗ is commutative.
For 𝑎, 𝑏, 𝑐 ∈ 𝑄, we have
𝑎𝑏
𝑎𝑏 ( ).𝑐 𝑎𝑏𝑐
4
(𝑎 ∗ 𝑏) ∗ 𝑐 = ( ) ∗ 𝑐 = =
4 4 16

and
𝑏𝑐
𝑏𝑐 𝑎.( ) 𝑎𝑏𝑐
4
𝑎 ∗ (𝑏 ∗ 𝑐) = 𝑎 ∗ ( 4 ) = =
4 16

∴ (𝑎 ∗ 𝑏) ∗ 𝑐 = 𝑎 ∗ (𝑏 ∗ 𝑐), where 𝑎, 𝑏, 𝑐 ∈ 𝑄
Hence, the operation ∗ is associative.
(vi) On 𝑄, the binary operation ∗ is defined as 𝑎 ∗ 𝑏 = 𝑎𝑏 2

56
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

It can be found that

1 1 1 1 2 1 1 1
∗ = 2 . (3) = 2 . 9 = 18
2 3

and
1 1 1 1 2 1 1 1
∗ = 3 . (2) = 3 . 4 = 12
3 2
1 1 1 1 1 1
∴ 2 ∗ 3 ≠ 3 ∗ 2, where 2 and 3 ∈ 𝑄

Hence, the operation ∗ is not commutative.

It is also seen that
1 1 1 1 1 2 1 1 1 1 1 2 1 1
( ∗ )∗ = [ ( ) ]∗ = ∗ = .( ) = = 288
2 3 4 2 3 4 18 4 18 4 18×16

and
1 1 1 1 1 1 2 1 1 1 1 2 1 1
∗ (3 ∗ 4) = 2 ∗ [3 (4) ] = 2 ∗ 48 = 2 (48) = 2×2304 = 4608
2

1 1 1 1 1 1 1 1 1
∴ (2 ∗ 3) ∗ 4 ≠ 2 ∗ (3 ∗ 4), where 2 , 3 , 4 ∈ 𝑄

Hence, the operation ∗ is not associative.

Hence, the operations defined in (ii), (iv), (v) are commutative and the operation
defined in (v) is associative.

10. Find which of the operations given above has identity.

Solution:
An element 𝑒 ∈ 𝑄 will be the identity element for the binary operation ∗ if 𝑎 ∗ 𝑒 = 𝑎 =
𝑒 ∗ 𝑎, for all 𝑎 ∈ 𝑄.
However, there is no such element 𝑒 ∈ 𝑄 with respect to any of the six operations
satisfying the above condition.
Hence, none of the six operations has identity.

57
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

11. Let 𝐴 = 𝑁 × 𝑁 and ∗ be the binary operation on A defined by

(𝑎, 𝑏) ∗ (𝑐, 𝑑) = (𝑎 + 𝑐, 𝑏 + 𝑑). Show that ∗ is commutative and associative. Find the
identity element for ∗ on 𝐴, if any.

Solution:
Given:
𝐴 = 𝑁 × 𝑁 and ∗ is a binary operation on 𝐴 and is defined by
(𝑎, 𝑏) ∗ (𝑐, 𝑑) = (𝑎 + 𝑐, 𝑏 + 𝑑)
Suppose (𝑎, 𝑏), (𝑐, 𝑑) ∈ 𝐴
Then, 𝑎, 𝑏, 𝑐, 𝑑 ∈ 𝑁
We have:
(𝑎, 𝑏) ∗ (𝑐, 𝑑) = (𝑎 + 𝑐, 𝑏 + 𝑑)
(𝑐, 𝑑) ∗ (𝑎, 𝑏) = (𝑐 + 𝑎, 𝑑 + 𝑏) = (𝑎 + 𝑐, 𝑏 + 𝑑)
[Since, addition is commutative in the set of natural numbers]
∴ (𝑎, 𝑏) ∗ (𝑐, 𝑑) = (𝑐, 𝑑) ∗ (𝑎, 𝑏)
Hence, the operation ∗ is commutative.
Now, suppose (𝑎, 𝑏), (𝑐, 𝑑), (𝑒, 𝑓) ∈ 𝐴
Then, 𝑎, 𝑏, 𝑐, 𝑑, 𝑒, 𝑓 ∈ 𝑁
We have
[(𝑎, 𝑏) ∗ (𝑐, 𝑑)] ∗ (𝑒, 𝑓) = (𝑎 + 𝑐, 𝑏 + 𝑑) ∗ (𝑒, 𝑓) = (𝑎 + 𝑐 + 𝑒, 𝑏 + 𝑑 + 𝑓)
and
(𝑎, 𝑏) ∗ [(𝑐, 𝑑) ∗ (𝑒, 𝑓)] = (𝑎, 𝑏) ∗ (𝑐 + 𝑒, 𝑑 + 𝑓) = (𝑎 + 𝑐 + 𝑒, 𝑏 + 𝑑 + 𝑓)
∴ [(𝑎, 𝑏) ∗ (𝑐, 𝑑)] ∗ (𝑒, 𝑓) = (𝑎, 𝑏) ∗ [(𝑐, 𝑑) ∗ (𝑒, 𝑓)]
Hence, the operation ∗ is associative.
Suppose an element 𝑒 = (𝑒1 , 𝑒2 ) ∈ 𝐴 will be an identity element for the operation ∗ if 𝑎 ∗
𝑒 = 𝑎 = 𝑒 ∗ 𝑎 for all 𝑎 = (𝑎1 , 𝑎2 ) ∈ 𝐴
i.e., (𝑎1 + 𝑒1 , 𝑎2 + 𝑒2 ) = (𝑎1 , 𝑎2 ) = (𝑒1 + 𝑎1 , 𝑒2 + 𝑎2 )
Which is not true for any element in 𝐴.

58
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Hence, the operation ∗ does not have any identity element.

12. State whether the following statements are true or false. Justify.
(i) For an arbitrary binary operation ∗ on a set 𝑁, 𝑎 ∗ 𝑎 = 𝑎 ∀ 𝑎 ∈ 𝑁.
(ii) If ∗ is a commutative binary operation on 𝑁, then 𝑎 ∗ (𝑏 ∗ 𝑐) = (𝑐 ∗ 𝑏) ∗ 𝑎

Solution:
(i) Defining an operation ∗ on 𝑁 as 𝑎 ∗ 𝑏 = 𝑎 + 𝑏 ∀ 𝑎, 𝑏 ∈ 𝑁
Then, in particular, for 𝑏 = 𝑎 = 3, we have
3∗3= 3+3= 6≠ 3
Thus, statement (i) is false.
(ii) R.H.S. = (𝑐 ∗ 𝑏) ∗ 𝑎
= (𝑏 ∗ 𝑐) ∗ 𝑎 [Since, ∗ is commutative]
= 𝑎 ∗ (𝑏 ∗ 𝑐) [Again, as ∗ is commutative]
= L. H. S.
∴ 𝑎 ∗ (𝑏 ∗ 𝑐) = (𝑐 ∗ 𝑏) ∗ 𝑎
Hence, statement (ii) is true.

13. Consider a binary operation ∗ on 𝑁 defined as 𝑎 ∗ 𝑏 = 𝑎3 + 𝑏 3 . Choose the correct

answer.
(A) Is ∗ both associative and commutative?
(B) Is ∗ commutative but not associative?
(C) Is ∗ associative but not commutative?
(D) Is ∗ neither commutative nor associative?

59
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Solution:
On 𝑁, the binary operation ∗ is defined as 𝑎 ∗ 𝑏 = 𝑎3 + 𝑏 3 .
For, 𝑎, 𝑏, ∈ 𝑁, we have
𝑎 ∗ 𝑏 = 𝑎3 + 𝑏 3 = 𝑏 3 + 𝑎3 = 𝑏 ∗ 𝑎 [Since, addition is commutative in 𝑁]
Hence, the operation ∗ is commutative.
It is also observed that
(1 ∗ 2) ∗ 3 = (13 + 23 ) ∗ 3 = (1 + 8) ∗ 3 = 9 ∗ 3 = 93 + 33 = 729 + 27 = 756 and

1 ∗ (2 ∗ 3) = 1 ∗ (23 + 33 ) = 1 ∗ (8 + 27) = 1 ∗ 35 = 13 + 353 = 1 + 42875 =

42876
∴ (1 ∗ 2) ∗ 3 ≠ 1 ∗ (2 ∗ 3), where 1, 2, 3 ∈ 𝑁
Hence, the operation ∗ is not associative.
Hence, the operation ∗ is commutative, but not associative.
Hence, the correct answer is B.

Miscellaneous Exercise on Chapter 1

1. Let 𝑓: 𝑅 → 𝑅 be defined as 𝑓(𝑥) = 10𝑥 + 7. Find the function 𝑔: 𝑅 → 𝑅 such that

𝑔𝑜𝑓 = 𝑓𝑜𝑔 = 𝐼𝑅 .

Solution:
Given that 𝑓: 𝑅 → 𝑅 is defined as 𝑓(𝑥) = 10𝑥 + 7.
For one – one
Suppose 𝑓(𝑥) = 𝑓(𝑦), where 𝑥, 𝑦 ∈ 𝑅.
⇒ 10𝑥 + 7 = 10𝑦 + 7
⇒ 𝑥 = 𝑦

Hence, 𝑓 is a one-one function.

For onto

60
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

For 𝑦 ∈ 𝑅, suppose 𝑦 = 10𝑥 + 7.

𝑦−7
⇒𝑥= ∈𝑅
10
𝑦−7
Hence, for any 𝑦 ∈ 𝑅, there exists 𝑥 = ∈ 𝑅 such that
10

𝑦−7 𝑦−7
𝑓(𝑥) = 𝑓 ( 10 ) = 10 ( 10 ) + 7 = 𝑦 − 7 + 7 = 𝑦

∴ 𝑓 is onto function.
Hence, 𝑓 is one – one and onto.
Hence, 𝑓 is an invertible function.
𝑦−7
Let us define 𝑔: 𝑅 → 𝑅 as 𝑔(𝑦) = 10

Now, we have
(10𝑥+7)−7 10𝑥
𝑔𝑜𝑓(𝑥) = 𝑔(𝑓(𝑥)) = 𝑔(10𝑥 + 7) = = =𝑥
10 10

and
𝑦−7 𝑦−7
𝑓𝑜𝑔(𝑦) = 𝑓(𝑔(𝑦)) = 𝑓 ( 10 ) = 10 ( 10 ) + 7 = 𝑦 − 7 + 7 = 𝑦

∴ 𝑔𝑜𝑓 = 𝐼𝑅 and 𝑓𝑜𝑔 = 𝐼𝑅 .

𝑦−7
Hence, the required function 𝑔: 𝑅 → 𝑅 is defined as 𝑔(𝑦) = .
10

2. Let 𝑓: 𝑊 → 𝑊 be defined as 𝑓(𝑛) = 𝑛 − 1, if 𝑛 is odd and 𝑓(𝑛) = 𝑛 + 1, if 𝑛 is even.

Show that 𝑓 is invertible. Find the inverse of 𝑓. Here, 𝑊 is the set of all whole numbers.

Solution:
Given that:
𝑓: 𝑊 → 𝑊 is defined as 𝑓(𝑛) = {𝑛 − 1, 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
𝑛 + 1, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛 }
For one-one
Suppose 𝑓(𝑛) = 𝑓(𝑚).

61
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Here it can be observed that if 𝑛 is odd and 𝑚 is even, then we will have 𝑛 − 1 = 𝑚 + 1.
⇒𝑛−𝑚=2

However, this is impossible.

Similarly, the possibility of 𝑛 being even and 𝑚 being odd can also be ignored in a
similar way.
Hence, both 𝑛 and 𝑚 must be either odd or even. Now, if both 𝑛 and 𝑚 are odd,
Then, we have
𝑓(𝑛) = 𝑓(𝑚)

⇒ 𝑛 − 1 = 𝑚 –1

⇒ 𝑛 = 𝑚

Again, if both 𝑛 and 𝑚 are even,

Then, we have
𝑓(𝑛) = 𝑓(𝑚)
⇒𝑛+1= 𝑚+1
⇒𝑛=𝑚

∴ 𝑓 is one-one.
For onto
Here, it is clear that any odd number 2𝑟 + 1 in co-domain 𝑁 is the image of 2𝑟 in domain
𝑁
Again, any even number 2𝑟 in co-domain 𝑁 is the image of 2𝑟 + 1 in domain 𝑁.
∴ 𝑓 is onto function.
Hence, 𝑓 is an invertible function.
Let us define 𝑔: 𝑊 → 𝑊 as 𝑔(𝑚) = {𝑚 + 1, 𝑖𝑓 𝑚 𝑖𝑠 𝑒𝑣𝑒𝑛 𝑚 − 1, 𝑖𝑓 𝑚 𝑖𝑠 𝑜𝑑𝑑
Now, when 𝑛 is odd

𝑔𝑜𝑓(𝑛) = 𝑔(𝑓(𝑛)) = 𝑔(𝑛 − 1) = 𝑛 − 1 + 1 = 𝑛 and

When 𝑛 is even

𝑔𝑜𝑓(𝑛) = 𝑔(𝑓(𝑛)) = 𝑔(𝑛 + 1) = 𝑛 + 1 − 1 = 𝑛

Similarly,

62
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

When 𝑚 is odd
𝑓𝑜𝑔(𝑚) = 𝑓(𝑔(𝑚)) = 𝑓(𝑚 − 1) = 𝑚 − 1 + 1 = 𝑚 and

When 𝑚 is even

𝑓𝑜𝑔(𝑚) = 𝑓(𝑔(𝑚)) = 𝑓(𝑚 + 1) = 𝑚 + 1 − 1 = 𝑚

∴ 𝑔𝑜𝑓 = 𝐼𝑊 and 𝑓𝑜𝑔 = 𝐼𝑊

Hence, 𝑓 is invertible and the inverse of 𝑓 is given by 𝑓 — 1 = 𝑔, which is the same as 𝑓.

Hence, the inverse of 𝑓 is 𝑓 itself.

3. If 𝑓: 𝑅 → 𝑅 is defined by 𝑓(𝑥) = 𝑥 2 − 3𝑥 + 2, find 𝑓(𝑓(𝑥)).

Solution:

Given that 𝑓: 𝑅 → 𝑅 is defined as 𝑓(𝑥) = 𝑥 2 – 3𝑥 + 2.

Hence, 𝑓(𝑓(𝑥)) = 𝑓(𝑥 2 − 3𝑥 + 2)

= (𝑥 2 − 3𝑥 + 2)2 − 3(𝑥 2 − 3𝑥 + 2) + 2
= (𝑥 4 + 9𝑥 2 + 4 − 6𝑥 3 − 12𝑥 + 4𝑥 2 ) + (−3𝑥 2 + 9𝑥 − 6) + 2
= 𝑥 4 − 6𝑥 3 + 10𝑥 2 − 3𝑥

𝑥
4. Show that the function 𝑓: 𝑅 → {𝑥 ∈ 𝑅 ∶ −1 < 𝑥 < 1} defined by f(𝑥) = 1+|𝑥| , 𝑥 ∈ 𝑅 is

one-one and onto function.

Solution:
𝑥
Given that 𝑓: 𝑅 → {𝑥 ∈ 𝑅 ∶ −1 < 𝑥 < 1} is defined as 𝑓(𝑥) = 1+|𝑥| , 𝑥 ∈ 𝑅.

For one-one
Suppose 𝑓(𝑥) = 𝑓(𝑦), where 𝑥, 𝑦 ∈ 𝑅.

63
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions
𝑥 𝑦
⇒ 1+|𝑥| = 1+|𝑦|

It can be observed that if 𝑥 is positive and 𝑦 is negative,

Then, we have
𝑥 𝑦
= 1−𝑦 ⇒ 2𝑥𝑦 = 𝑥 − 𝑦
1+𝑥

Since, 𝑥 is positive and 𝑦 is negative

𝑥 >𝑦 ⇒𝑥−𝑦 >0
But, 2𝑥𝑦 is negative.
Hence, 2𝑥𝑦 ≠ 𝑥 − 𝑦
Hence, the case of 𝑥 being positive and 𝑦 being negative can be ruled out.
Using a similar argument, 𝑥 being negative and 𝑦 being positive can also be ruled out.
∴ 𝑥 and 𝑦 have to be either positive or negative.
When 𝑥 and 𝑦 are both are positive, we have
𝑥 𝑦
𝑓(𝑥) = 𝑓(𝑦) ⇒ 1+𝑥 = 1+𝑦 ⇒ 𝑥 + 𝑥𝑦 = 𝑦 + 𝑥𝑦 ⇒ 𝑥 = 𝑦

When 𝑥 and 𝑦 are both are negative, we have

𝑥 𝑦
𝑓(𝑥) = 𝑓(𝑦) ⇒ 1−𝑥 = 1−𝑦 ⇒ 𝑥 − 𝑥𝑦 = 𝑦 − 𝑥𝑦 ⇒ 𝑥 = 𝑦

∴ 𝑓 is one-one.
For onto
Now, suppose 𝑦 ∈ 𝑅 such that −1 < 𝑦 < 1.
𝑦
If 𝑦 is negative, then, there exists 𝑥 = 1+𝑦 ∈ 𝑅 such that
𝑦 𝑦
𝑦 ( ) 𝑦
1+𝑦 1+𝑦
𝑓(𝑥) = 𝑓 (1+𝑦) = 𝑦 = −𝑦 = 1+𝑦−𝑦 = 𝑦
1+| | 1+( )
1+𝑦 1+𝑦

𝑦
If 𝑦 is positive, then, there exists 𝑥 = 1−𝑦 ∈ 𝑅 such that
𝑦 𝑦
𝑦 ( ) 𝑦
1−𝑦 1−𝑦
𝑓(𝑥) = 𝑓 (1−𝑦) = 𝑦 = 𝑦 = 1−𝑦+𝑦 = 𝑦
1+| | 1+( )
1−𝑦 1−𝑦

∴ 𝑓 is onto function.
Hence, 𝑓 is one-one and onto.

64
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

5. Show that the function 𝑓: 𝑅 → 𝑅 given by 𝑓(𝑥) = 𝑥 3 is injective.

Solution:
We have: 𝑓: 𝑅 → 𝑅 is given as 𝑓(𝑥) = 𝑥 3 .
For one-one
Suppose 𝑓(𝑥) = 𝑓(𝑦), 𝑤ℎ𝑒𝑟𝑒 𝑥, 𝑦 ∈ 𝑅.
⇒ 𝑥3 = 𝑦3 … (1)

Now, we need to show that 𝑥 = 𝑦.

Suppose 𝑥 ≠ 𝑦, their cubes will also not be equal.
⇒ 𝑥3 ≠ 𝑦3

However, this is a contradiction to (1).

∴𝑥=𝑦
Hence, 𝑓 is injective.

6. Give examples of two functions 𝑓 ∶ 𝑁 → 𝑍 and 𝑔 : 𝑍 → 𝑍 such that 𝑔𝑜𝑓 is injective but
𝑔 is not injective.
(Hint: Consider 𝑓(𝑥) = 𝑥 and 𝑔(𝑥) = |𝑥|).

Solution:
Define 𝑓: 𝑁 → 𝑍 as 𝑓(𝑥) = 𝑥 and 𝑔: 𝑍 → 𝑍 as 𝑔(𝑥) = |𝑥|.
We will now first show that 𝑔 is not injective.
It can be seen that
𝑔(−1) = | − 1| = 1
𝑔(1) = |1| = 1
∴ 𝑔(−1) = 𝑔(1), but −1 ≠ 1.

65
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

∴ 𝑔 is not injective.

Now, 𝑔 𝑜𝑓: 𝑁 → 𝑍 is defined as 𝑔𝑜𝑓(𝑥) = 𝑔(𝑓(𝑥)) = 𝑔(𝑥) = |𝑥|.

Suppose 𝑥, 𝑦 ∈ 𝑁 such that 𝑔 𝑜𝑓(𝑥) = 𝑔 𝑜𝑓(𝑦).

⇒ |𝑥| = |𝑦|

Since 𝑥 and 𝑦 ∈ 𝑁, both are positive.

∴ |𝑥| = |𝑦| ⇒ 𝑥 = 𝑦
Hence, 𝑔𝑜𝑓 is injective.

7. Give examples of two functions 𝑓: 𝑁 → 𝑁 and 𝑔: 𝑁 → 𝑁 such that 𝑔𝑜𝑓 is onto but 𝑓 is
not onto.
(Hint: Consider 𝑓(𝑥) = 𝑥 + 1 and 𝑔(𝑥) = {𝑥 − 1, 𝑖𝑓𝑥 > 1
1, 𝑖𝑓𝑥 = 1 }

Solution:
Define 𝑓: 𝑁 → 𝑁 by 𝑓(𝑥) = 𝑥 + 1
and 𝑔: 𝑁 → 𝑁 by 𝑔(𝑥) = {𝑥 − 1, 𝑖𝑓 𝑥 > 1
1, 𝑖𝑓 𝑥 = 1
We will first show that 𝑓 is not onto.
For this, consider element 1 in co-domain 𝑁. It is clear that this element is not an image
of any of the elements in domain 𝑁.
Therefore, 𝑓 is not onto function.
Now, 𝑔𝑜𝑓: 𝑁 → 𝑁 is defined by

𝑔𝑜𝑓(𝑥) = 𝑔(𝑓(𝑥)) = 𝑔(𝑥 + 1) = 𝑥 + 1 − 1 = 𝑥 [𝑥 ∈ 𝑁 ⇒ 𝑥 + 1 > 1]

Hence, it is clear that for 𝑦 ∈ 𝑁, there exists 𝑥 = 𝑦 ∈ 𝑁 such that 𝑔𝑜𝑓(𝑥) = 𝑦.

Hence, 𝑔𝑜𝑓 is onto function.

66
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

8. Given a non-empty set 𝑋, consider 𝑃(𝑋) which is the set of all subsets of 𝑋.
Define the relation 𝑅 in 𝑃(𝑋) as follows:
For subsets 𝐴, 𝐵 in 𝑃(𝑋), ARB if and only if 𝐴 ⊂ 𝐵. Is 𝑅 an equivalence relation on
𝑃(𝑋)?
Justify your answer.

Solution:
As we know that, every set is a subset of itself, 𝐴𝑅𝐴 for all 𝐴 ∈ 𝑃(𝑋).
∴ 𝑅 is reflexive.
Suppose 𝐴𝑅𝐵 ⇒ 𝐴 ⊂ 𝐵.
This cannot be implied to 𝐵 ⊂ 𝐴.
For instance, if 𝐴 = {1, 2} and 𝐵 = {1, 2, 3}, then it is observed that 𝐵 is not related to
𝐴.
∴ 𝑅 is not symmetric.
Again, if 𝐴𝑅𝐵 and 𝐵𝑅𝐶, then 𝐴 ⊂ 𝐵 and 𝐵 ⊂ 𝐶.
⇒𝐴⊂𝐶
⇒ 𝐴𝑅𝐶

∴ 𝑅 is transitive.
Hence, 𝑅 is not an equivalence relation as it is not symmetric.

9. Given a non‐empty set 𝑋, consider the binary operation ∗: 𝑃(𝑋) × 𝑃(𝑋) → 𝑃(𝑋) given
by
𝐴 ∗ 𝐵 = 𝐴 ∩ 𝐵 ∀𝐴, 𝐵 in 𝑃(𝑋), where 𝑃(𝑋) is the power set of 𝑋. Show that 𝑋 is the
identity element for this operation and 𝑋 is the only invertible element in 𝑃(𝑋) with
respect to the operation ∗.

Solution:
Given the binary operation ∗:

67
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

𝑃(𝑋) × 𝑃(𝑋) → 𝑃(𝑋) given by 𝐴 ∗ 𝐵 = 𝐴 ∩ 𝐵 ∀ 𝐴, 𝐵 in 𝑃(𝑋)

We know that 𝐴 ∩ 𝑋 = 𝐴 = 𝑋 ∩ 𝐴 for all 𝐴 ∈ 𝑃(𝑋)
⇒ 𝐴 ∗ 𝑋 = 𝐴 = 𝑋 ∗ 𝐴 for all 𝐴 ∈ 𝑃(𝑋)

Hence, 𝑋 is the identity element for the given binary operation ∗.

Now, an element 𝐴 ∈ 𝑃(𝑋) is invertible if there exists 𝐵 ∈ 𝑃(𝑋) such that
𝐴 ∗ 𝐵 = 𝑋 = 𝐵 ∗ 𝐴 [As 𝑋 is the identity element]
or
𝐴∩𝐵 =𝑋 =𝐵∩𝐴
This case is possible only when 𝐴 = 𝑋 = 𝐵.
Hence, 𝑋 is the only invertible element in 𝑃(𝑋) with respect to the given operation ∗.
Hence, the given result is proved.

10. Find the number of all onto functions from the set {1, 2, 3, … , 𝑛} to itself.

Solution:
Onto functions from the set {1, 2, 3, … , 𝑛} to itself is just a permutation on n symbols
1, 2, … , 𝑛.
Hence, the total number of onto maps from {1, 2, … , 𝑛} to itself is the same as the total
number of permutations on n symbols 1, 2, … , 𝑛, which is 𝑛!.

11. Let 𝑆 = {𝑎, 𝑏, 𝑐} and 𝑇 = {1, 2, 3}. Find 𝐹 −1 of the following functions 𝐹 from 𝑆 to 𝑇, if
it exists.
(i) 𝐹 = {(𝑎, 3), (𝑏, 2), (𝑐, 1)}
(ii) 𝐹 = {(𝑎, 2), (𝑏, 1), (𝑐, 1)}

68
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Solution:
Given, 𝑆 = {𝑎, 𝑏, 𝑐}, 𝑇 = {1, 2, 3}
(i) 𝐹: 𝑆 → 𝑇 has been defined as 𝐹 = {(𝑎, 3), (𝑏, 2), (𝑐, 1)}
⇒ 𝐹(𝑎) = 3, 𝐹 (𝑏) = 2, 𝐹(𝑐) = 1

We can see that 𝐹 is one-one and onto. Hence, inverse of 𝐹 exists.

Hence, 𝐹 −1 : 𝑇 → 𝑆 is given by 𝐹 −1 = {(3, 𝑎), (2, 𝑏), (1, 𝑐)}.
(ii) 𝐹: 𝑆 → 𝑇 has been defined as 𝐹 = {(𝑎, 2), (𝑏, 1), (𝑐, 1)}
Since 𝐹(𝑏) = 𝐹(𝑐) = 1. Hence, 𝐹 is not one-one function.
Hence, 𝐹 is not invertible i.e., 𝐹 −1 does not exist.

12. Consider the binary operations ∗: 𝑅 × 𝑅 → 𝑅 and 𝑜 : 𝑅 × 𝑅 → 𝑅 defined as 𝑎 ∗ 𝑏 = |𝑎 −

𝑏| and 𝑎𝑜𝑏 = 𝑎, ∀𝑎, 𝑏 ∈ 𝑅. Show that ∗ is commutative but not associative, 𝑜 is
associative but not commutative. Further, show that ∀𝑎, 𝑏, 𝑐 ∈ 𝑅, 𝑎 ∗ (𝑏𝑜𝑐) = (𝑎 ∗
𝑏)𝑜(𝑎 ∗ 𝑐). [If it is so, we say that the operation ∗ distributes over the operation 𝑜]. Does
𝑜 distribute over ∗? Justify your answer.

Solution:
Given that ∗ : 𝑅 × 𝑅 → 𝑅 and o: 𝑅 × 𝑅 → 𝑅 is defined as 𝑎 ∗ 𝑏 = |𝑎 − 𝑏| and
𝑎 𝑜 𝑏 = 𝑎, ∀ 𝑎, 𝑏 ∈ 𝑅
For 𝑎, 𝑏 ∈ 𝑅, we have
𝑎 ∗ 𝑏 = |𝑎 − 𝑏| and 𝑏 ∗ 𝑎 = |𝑏 − 𝑎| = |−(𝑎 − 𝑏)| = |𝑎 − 𝑏|
∴𝑎∗𝑏 =𝑏∗𝑎
Hence, the operation ∗ is commutative.
It is also observed that
(1 ∗ 2) ∗ 3 = (|1 − 2|) ∗ 3 = 1 ∗ 3 = |1 − 3| = 2
and
1 ∗ (2 ∗ 3) = 1 ∗ (|2 − 3|) = 1 ∗ 1 = |1 − 1| = 0
∴ (1 ∗ 2) ∗ 3 ≠ 1 ∗ (2 ∗ 3) where 1, 2, 3 ∈ 𝑅.

69
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Hence, the operation ∗ is not associative.

Again, consider the operation 𝑜
It is observed that 1 𝑜 2 = 1 and 2 𝑜 1 = 2.
∴ 1 𝑜 2 ≠ 2 𝑜 1 where 1, 2 ∈ 𝑅.
Hence, the operation 𝑜 is not commutative.
Suppose 𝑎, 𝑏, 𝑐 ∈ 𝑅. Then, we have
(𝑎 𝑜 𝑏)𝑜 𝑐 = 𝑎 𝑜 𝑐 = 𝑎
and
𝑎 𝑜 (𝑏 𝑜 𝑐) = 𝑎 𝑜 𝑏 = 𝑎
∴ 𝑎 𝑜 𝑏) 𝑜 𝑐 = 𝑎 𝑜 (𝑏 𝑜 𝑐), where 𝑎, 𝑏, 𝑐 ∈ 𝑅
Hence, the operation 𝑜 is associative.
Now, suppose a, b, c ∈ 𝑅, then we have
𝑎 ∗ (𝑏 𝑜 𝑐) = 𝑎 ∗ 𝑏 = |𝑎 − 𝑏|
(𝑎 ∗ 𝑏)𝑜(𝑎 ∗ 𝑐) = (|𝑎 − 𝑏|)𝑜(|𝑎 − 𝑐|) = |𝑎 − 𝑏|
Hence, 𝑎 ∗ (𝑏 𝑜 𝑐) = (𝑎 ∗ 𝑏)𝑜(𝑎 ∗ 𝑐).
Hence, the operation ∗ distribute over 𝑜.
Now,
1 𝑜 (2 ∗ 3) = 1𝑜(|2 − 3|) = 1𝑜1 = 1
(1 𝑜 2) ∗ (1 𝑜 3) = 1 ∗ 1 = |1 − 1| = 0
∴ 1 𝑜 (2 ∗ 3) ≠ (1 𝑜 2) ∗ (1 𝑜 3) where 1, 2, 3 ∈ 𝑅
Hence, the operation 𝑜 does not distribute over ∗.

13. Given a non‐empty set 𝑋, let ∗ : 𝑃(𝑋) × 𝑃(𝑋) → 𝑃(𝑋) be defined as 𝐴 ∗ 𝐵 = (𝐴 − 𝐵) ∪

(𝐵 − 𝐴), ∀ 𝐴, 𝐵 ∈ 𝑃(𝑋). Show that the empty set 𝜙 is the identity for the operation ∗ and
all the elements 𝐴 of 𝑃(𝑋) are invertible with 𝐴−1 = 𝐴. (Hint: (𝐴 − 𝜙) ∪ (𝜙 − 𝐴) = 𝐴
and (𝐴 − 𝐴) ∪ (𝐴 − 𝐴) = 𝐴 ∗ 𝐴 = 𝜙).

70
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

Solution:
Given that ∗ : 𝑃(𝑋) × 𝑃(𝑋) → 𝑃(𝑋) is defined as 𝐴 ∗ 𝐵 = (𝐴 − 𝐵) ∪ (𝐵 − 𝐴) ∀ 𝐴, 𝐵 ∈
𝑃(𝑋).
Suppose 𝐴 ∈ 𝑃(𝑋). Then, we have
𝐴 ∗ 𝜙 = (𝐴 − 𝜙) ∪ (𝜙 − 𝐴) = 𝐴 ∪ 𝜙 = 𝐴
𝜙 ∗ 𝐴 = (𝜙 − 𝐴) ∪ (𝐴 − 𝜙) = 𝜙 ∪ 𝐴 = 𝐴
∴ 𝐴 ∗ 𝜙 = 𝐴 = 𝜙 ∗ 𝐴 for all 𝐴 ∈ 𝑃(𝑋)
Thus, 𝜙 is the identity element for the given operation ∗.
Now, again an element 𝐴 ∈ 𝑃(𝑋) will be invertible if there exists 𝐵 ∈ 𝑃(𝑋) such that
𝐴 ∗ 𝐵 = 𝜙 = 𝐵 ∗ 𝐴. [As 𝛷 is the identity element]
Now, we have observed that

𝐴 ∗ 𝐴 = (𝐴– 𝐴) ∪ (𝐴 – 𝐴) = 𝜙 ∪ 𝜙 = 𝜙 for all 𝐴 ∈ 𝑃(𝑋).

Hence, all the elements 𝐴 of 𝑃(𝑋) are invertible with 𝐴−1 = 𝐴.

14. Define a binary operation ∗ on the set {0, 1, 2, 3, 4, 5} as

𝑎 ∗ 𝑏 = {𝑎 + 𝑏, 𝑖𝑓 𝑎 + 𝑏 < 6
𝑎 + 𝑏 − 6 𝑖𝑓 𝑎 + 𝑏 ≥ 6 }
Show that zero is the identity for this operation and each element 𝑎 ≠ 0 of the set is
invertible with 6 − 𝑎 being the inverse of 𝑎.

Solution:
Given, 𝑋 = {0, 1, 2, 3, 4, 5}.
Here the operation ∗ on 𝑋 is defined as 𝑎 ∗ 𝑏 = {𝑎 + 𝑏, 𝑖𝑓 𝑎 + 𝑏 < 6
𝑎 + 𝑏 − 6, 𝑖𝑓 𝑎 + 𝑏 ≥ 6 }
An element 𝑒 ∈ 𝑋 is the identity element for the operation ∗, if
𝑎 ∗ 𝑒 = 𝑎 = 𝑒 ∗ 𝑎 for all 𝑎 ∈ 𝑋

71
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

For 𝑎 ∈ 𝑋, we have
𝑎 ∗ 0 = 𝑎 + 0 = 𝑎 [𝑎 ∈ 𝑋 ⇒ 𝑎 + 0 < 6]
0 ∗ 𝑎 = 0 + 𝑎 = 𝑎 [𝑎 ∈ 𝑋 ⇒ 0 + 𝑎 < 6]
∴ 𝑎 ∗ 0 = 𝑎 = 0 ∗ 𝑎 for all 𝑎 ∈ 𝑋
Hence, 0 is the identity element for the given operation ∗.
An element 𝑎 ∈ 𝑋 is invertible if there exists 𝑏 ∈ 𝑋 such that 𝑎 ∗ 𝑏 = 0 = 𝑏 ∗ 𝑎.
i.e., 𝑎 + 𝑏 = 0 = 𝑏 + 𝑎, 𝑖𝑓 𝑎 + 𝑏 < 6 and
𝑎 + 𝑏 − 6 = 0 = 𝑏 + 𝑎 − 6, 𝑖𝑓 𝑎 + 𝑏 ≥ 6
⇒ 𝑎 = −𝑏 or 𝑏 = 6 − 𝑎

But, 𝑋 = {0, 1, 2, 3, 4, 5} and 𝑎, 𝑏 ∈ 𝑋

Hence, 𝑎 ≠ −𝑏.
∴ 𝑏 = 6 − 𝑎 is the inverse of 𝑎 for all 𝑎 ∈ 𝑋.
Hence, the inverse of an element 𝑎 ∈ 𝑋, 𝑎 ≠ 0 is 6 − 𝑎 𝑖. 𝑒. , 𝑎−1 = 6 − 𝑎.

15. Let 𝐴 = {−1, 0, 1, 2}, 𝐵 = {−4, −2, 0, 2} and 𝑓, 𝑔: 𝐴 → 𝐵 be functions defined by

1
𝑓(𝑥) = 𝑥 2 − 𝑥, 𝑥 ∈ 𝐴 and 𝑔(𝑥) = 2 |𝑥 − 2| − 1, 𝑥 ∈ 𝐴. Are 𝑓 and 𝑔 equal? Justify your
answer. (Hint: One may note that two functions 𝑓: 𝐴 → 𝐵 and 𝑔: 𝐴 → 𝐵 such that 𝑓(𝑎) =
𝑔(𝑎) ∀ 𝑎 ∈ 𝐴, are called equal functions).

Solution:
Given that 𝐴 = {−1, 0, 1, 2}, 𝐵 = {−4, −2, 0, 2}.
Also, it is given that 𝑓, 𝑔: 𝐴 → 𝐵 are defined by
1
𝑓(𝑥) = 𝑥 2 − 𝑥, 𝑥 ∈ 𝐴 and 𝑔(𝑥) = 2 |𝑥 − 2 | − 1, 𝑥 ∈ 𝐴

It is observed that
𝑓(−1) = (−1)2 − (−1) = 1 + 1 = 2

72
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

1 3
and 𝑔(−1) = 2 |(−1) − 2| − 1 = 2 (2) − 1 = 3 − 1 = 2

⇒ 𝑓(−1) = 𝑔(−1)
𝑓(0) = (0)2 − (0) = 0
1 1
and 𝑔(0) = 2 |0 − 2| − 1 = 2 (2) − 1 = 1 − 1 = 0

⇒ 𝑓(0) = 𝑔(0)

𝑓(1) = (1)2 − (1) = 1 − 1 = 0

1 1
and 𝑔(1) = 2 |(1) − 2| − 1 = 2 (2) − 1 = 1 − 1 = 0

⇒ 𝑓(1) = 𝑔(1)
𝑓(2) = (2)2 − (2) = 4 − 2 = 2
1 3
And 𝑔(2) = 2 |(2) − 2| − 1 = 2 (2) − 1 = 3 − 1 = 2

⇒ 𝑓(2) = 𝑔(2)

∴ 𝑓(𝑎) = 𝑔(𝑎) for all 𝑎 ∈ 𝐴

Hence, the functions 𝑓 and 𝑔 are equal.

16. Let 𝐴 = {1 , 2, 3} . Then number of relations containing (1, 2) and (1, 3) which are
reflexive and symmetric but not transitive is
(A) 1
(B) 2
(C) 3
(D) 4

Solution:
The given set is 𝐴 = {1, 2, 3}.
The smallest relation containing (1, 2) and (1, 3) which is reflexive and symmetric, but
not transitive is given by:

73
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

𝑅 = {(1, 1), (2, 2), (3, 3), (1, 2), (1, 3), (2, 1), (3, 1)}
This is because relation 𝑅 is reflexive as (1, 1), (2, 2), (3, 3) ∈ 𝑅.
Relation 𝑅 is symmetric since (1, 2), (2, 1) ∈ 𝑅 and (1, 3), (3, 1) ∈ 𝑅
But relation 𝑅 is not transitive as (3, 1), (1, 2) ∈ 𝑅, but (3, 2) ∉ 𝑅.
Now we can observe that adding any element to it will make the relation transitive or not
symmetric.
Hence, the total number of desired relations is one.
The correct answer is A.

17. Let 𝐴 = {1 , 2, 3}. Then number of equivalence relations containing (1, 2) is

(A) 1
(B) 2
(C) 3
(D) 4
Solution:
It is given that 𝐴 = {1, 2, 3}.
The smallest equivalence relation containing (1, 2) is given by,
𝑅1 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
Now, we are left with only four pairs i.e., (2, 3), (3, 2), (1, 3), and (3, 1).
If we odd any ordered pair [say (2, 3)] to 𝑅1 , then for symmetry, we must add (3, 2).
Also, for transitivity we need to add (1, 3) and (3, 1).
Hence, the only equivalence relation (bigger than 𝑅1 ) is the universal relation.
Hence, the total number of equivalence relations containing (1, 2) is two.
The correct answer is 𝐵.

74
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

18. Let 𝑓: 𝑅 → 𝑅 be the Signum Function defined as

𝑓(𝑥) = {1, 𝑥 > 0
0, 𝑥 = 0
−1, 𝑥 < 0}
and 𝑔: 𝑅 → 𝑅 be the Greatest Integer Function given by 𝑔(𝑥) = [𝑥], where [𝑥] is greatest
integer less than or equal to 𝑥. Then, does 𝑓𝑜𝑔 and 𝑔𝑜𝑓 coincide in (0,1]?

Solution:
Given that,
𝑓: 𝑅 → 𝑅 is defined as 𝑓(𝑥) = {1, 𝑥 > 0
0, 𝑥 = 0
−1, 𝑥 < 0}
Again, 𝑔: 𝑅 → 𝑅 is defined as 𝑔(𝑥) = [𝑥], where [𝑥] is the greatest integer less than or
equal to 𝑥.
Now, suppose 𝑥 ∈ (0, 1].
Then, we have
[𝑥] = 1 if 𝑥 = 1 and [𝑥] = 0 if 0 < 𝑥 < 1.

𝑓𝑜𝑔(𝑥) = 𝑓(𝑔(𝑥)) = 𝑓([𝑥]) = {𝑓(1), 𝑖𝑓 𝑥 = 1

𝑓(0), 𝑖𝑓 𝑥 ∈ (0,1)
= {1, 𝑖𝑓 𝑥 = 1
0, 𝑖𝑓 𝑥 ∈ (0,1)

𝑔𝑜𝑓(𝑥) = 𝑔(𝑓(𝑥)) = 𝑔(1) [ 𝑎𝑠 𝑥 > 0]

= [1] = 1
Hence, when 𝑥 ∈ (0, 1), we have 𝑓𝑜𝑔(𝑥) = 0 and 𝑔𝑜𝑓 (𝑥) = 1.
Hence, 𝑓𝑜𝑔 and 𝑔𝑜𝑓 do not coincide in (0, 1].

75
Practice more on Relations and Functions www.embibe.com
Class-XII-Maths Relations and Functions

19. Number of binary operations on the set {𝑎, 𝑏} are

(A) 10
(B) 16
(C) 20
(D) 8

Solution:
As we know that a binary operation ∗ on {𝑎, 𝑏} is a function from {𝑎, 𝑏} × {𝑎, 𝑏} →
{𝑎, 𝑏}
i.e., ∗ is a function from {(𝑎, 𝑎), (𝑎, 𝑏), (𝑏, 𝑎), (𝑏, 𝑏)} → {𝑎, 𝑏}.
Hence, every element of {𝑎, 𝑏} × {𝑎, 𝑏} has two options 𝑎 or 𝑏.
Hence, the total number of binary operations on the set {𝑎, 𝑏} is 24 𝑖. 𝑒. , 16.
The correct answer is 𝐵.

76
Practice more on Relations and Functions www.embibe.com