www.kalviexpress.in www.kalviexpress.

in

Pg-1
BASED ON REDUCED SYLLABUS 2020-21

11 mathematics
th

Chapter 1- Sets, Relations anf Functions

Exercise
and
Example sum Solutions

in
s.
2020-21

Prepared by : es
M.venkatesh, G.B.H.S.S,
pr
Elavanasur, Kallakurichi Dt.
ex

Mobile: 7339252602, Mail : Kalvithugal@gmail.com

l vi
ka
w.
ww

NAME :
STD : SEC :
SUBJECT :
MATERIAL NAME :
SCHOOL :

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

If any errors notify to me
www.kalviexpress.in www.kalviexpress.in
Pg-2
Chapter 1-Sets, Relations and Functions
Example 1.1
Find the number of subsets of A if 𝑨 = {𝒙 ∶ 𝒙 = 𝟒𝒏 + 𝟏, 𝟐 ≤ 𝒏 ≤ 𝟓, 𝒏 ∈ ℕ}.
Solution:
𝐴 = {𝑥 ∶ 𝑥 = 4𝑛 + 1, 2 ≤ 𝑛 ≤ 5, 𝑛 ∈ ℕ}.
𝐴 = {𝑥 ∶ 𝑥 = 4𝑛 + 1, 𝑛 = 2, 3, 4, 5}
𝑛 = 2, 𝑥 = 4(2) + 1 = 9
𝑛 = 3, 𝑥 = 4(3) + 1 = 13
𝑛 = 4, 𝑥 = 4(4) + 1 = 17
𝑛 = 5, 𝑥 = 4(5) + 1 = 21
𝐴 = {9, 13, 17, 21}. 𝑛(𝐴) = 4
Number of subsets of A,
𝑛[𝑝(𝐴)] = 2𝑛(𝐴) = 24

𝑛[𝑝(𝐴)] = 16

Example 1.2

in
In a survey of 5000 persons in a town, it was found that 45% of the persons know Language A, 25% know
Language B, 10% know Language C, 5% know Languages A and B, 4% know Languages B and C, and 4% know

s.
Languages A and C. If 3% of the persons know all the three Languages, find the number of persons who knows

es
only Language A.
Solution:
Given :
pr
𝑁𝑜. 𝑜𝑓 𝑃𝑒𝑟𝑠𝑜𝑛𝑠 𝑛(𝑈) = 5000, 𝑛(𝐴) = 45%, 𝑛(𝐵) = 25%, 𝑛(𝐶) = 10%, 𝑛(𝐴 ∩ 𝐵) = 5%, 𝑛(𝐵 ∩ 𝐶) = 4%,
𝑛(𝐴 ∩ 𝐶) = 4%, 𝑛(𝐴 ∩ 𝐵 ∩ 𝐶) = 3%
ex

𝑇ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑝𝑒𝑟𝑠𝑜𝑛𝑠 𝑤ℎ𝑜 𝑘𝑛𝑜𝑤𝑠 𝑜𝑛𝑙𝑦 𝑙𝑎𝑛𝑔𝑢𝑎𝑔𝑒 𝐴 𝑖𝑠

𝑛(𝐴 ∩ 𝐵′ ∩ 𝐶 ′ ) = 𝑛[𝐴 ∩ (𝐵 ∪ 𝐶)′ ] [∵ (𝐵 ∪ 𝐶)′ = 𝐵′ ∩ 𝐶 ′ ]
vi

= 𝑛(𝐴) − 𝑛(𝐴 ∩ (𝐵 ∪ 𝐶)) [∵ (𝐴 ∩ 𝐵′ ) = 𝑛(𝐴) − 𝑛(𝐴 ∩ 𝐵)]

l

= 𝑛(𝐴) − 𝑛[(𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶)] [∵ 𝐴 ∩ (𝐵 ∪ 𝐶) = (𝐴 ∩ 𝐵) ∪ (𝐴 ∩ 𝐶)]

ka

= 𝑛(𝐴) − [𝑛(𝐴 ∩ 𝐵) + 𝑛(𝐴 ∩ 𝐶) − 𝑛(𝐴 ∩ 𝐵 ∩ 𝐶)] [∵ 𝑛(𝐴 ∪ 𝐵) = 𝑛(𝐴) + 𝑛(𝐵) − 𝑛(𝐴 ∩ 𝐵)]
= 𝑛(𝐴) − 𝑛(𝐴 ∩ 𝐵) − 𝑛(𝐴 ∩ 𝐶) + 𝑛(𝐴 ∩ 𝐵 ∩ 𝐶)
= 45 − 5 − 4 + 3
w.

= 39%
The percentage of persons who knows only language A is 39.
ww

39
∴The required Number of persons is 100 × 5000 = 1950.
Venn diagram:

A B
45-2-3-1 5-3
39 2
3
4-3
1

The percentage of persons who knows only language A is 39%.

39
∴The required Number of persons is × 5000 = 1950.
100

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

 www.kalviexpress.in www.kalviexpress.in
Pg-3

Example 1.3
Prove that ((𝑨 ∪ 𝑩′ ∪ 𝑪) ∩ (𝑨 ∩ 𝑩′ ∩ 𝑪′ )) ∪ ((𝑨 ∪ 𝑩 ∪ 𝑪′ ) ∩ (𝑩′ ∩ 𝑪′ )) = 𝑩′ ∩ 𝑪′
Solution:
𝐴 ∩ 𝐵′ ∩ 𝐶 ′ ⊆ 𝐴 ⊆ 𝐴 ∪ 𝐵′ ∪ 𝐶
𝐴 ∩ 𝐵′ ∩ 𝐶 ′ ⊆ 𝐴 ∪ 𝐵′ ∪ 𝐶
(𝐴 ∪ 𝐵′ ∪ 𝐶) ∩ (𝐴 ∩ 𝐵′ ∩ 𝐶 ′ ) = 𝐴 ∩ 𝐵′ ∩ 𝐶 ′ --------------------①
𝐵′ ∩ 𝐶 ′ ⊆ 𝐶 ′ ⊆ 𝐴 ∪ 𝐵 ∪ 𝐶 ′
𝐵′ ∩ 𝐶 ′ ⊆ 𝐴 ∪ 𝐵 ∪ 𝐶 ′
(𝐴 ∪ 𝐵 ∪ 𝐶 ′ ) ∩ (𝐵′ ∩ 𝐶 ′ ) = 𝐵′ ∩ 𝐶 ′ --------------------②
From ① & ②
𝐴 ∩ 𝐵′ ∩ 𝐶 ′ ⊆ 𝐵′ ∩ 𝐶 ′
((𝐴 ∪ 𝐵′ ∪ 𝐶) ∩ (𝐴 ∩ 𝐵′ ∩ 𝐶 ′ )) ∪ ((𝐴 ∪ 𝐵 ∪ 𝐶 ′ ) ∩ (𝐵′ ∩ 𝐶 ′ ))
(𝐴 ∩ 𝐵′ ∩ 𝐶 ′ ) ∪ (𝐵′ ∩ 𝐶 ′ ) = 𝐵′ ∩ 𝐶 ′
((𝐴 ∪ 𝐵′ ∪ 𝐶) ∩ (𝐴 ∩ 𝐵′ ∩ 𝐶 ′ )) ∪ ((𝐴 ∪ 𝐵 ∪ 𝐶 ′ ) ∩ (𝐵′ ∩ 𝐶 ′ )) = 𝐵′ ∩ 𝐶 ′

in
Hence proved.

s.
Venn diagram: ((𝑨 ∪ 𝑩′ ∪ 𝑪) ∩ (𝑨 ∩ 𝑩′ ∩ 𝑪′ )) ∪ ((𝑨 ∪ 𝑩 ∪ 𝑪′ ) ∩ (𝑩′ ∩ 𝑪′ )) = 𝑩′ ∩ 𝑪′
LHS :

A B
A
es B A B
pr
ex

C
vi

C C

𝐴 ∪ 𝐵′ ∪ 𝐶 (𝐴 ∪ 𝐵′ ∪ 𝐶) ∩ (𝐴 ∩ 𝐵′ ∩ 𝐶 ′ )
l

𝐴 ∩ 𝐵′ ∩ 𝐶 ′
ka

A B A B B
A
w.
ww

C C C

𝐴 ∪ 𝐵 ∪ 𝐶′ 𝐵′ ∩ 𝐶 ′ (𝑨 ∪ 𝑩 ∪ 𝑪′ ) ∩ (𝑩′ ∩ 𝑪′ )

B
RHS :
A A B

----------① ----------②

C C

((𝑨 ∪ 𝑩′ ∪ 𝑪) ∩ (𝑨 ∩ 𝑩′ ∩ 𝑪′ )) ∪ ((𝑨 ∪ 𝑩 ∪ 𝑪′ ) ∩ (𝑩′ ∩ 𝑪′ )) 𝐵′ ∩ 𝐶 ′

From ① & ② ((𝐴 ∪ 𝐵′ ∪ 𝐶) ∩ (𝐴 ∩ 𝐵′ ∩ 𝐶 ′ )) ∪ ((𝐴 ∪ 𝐵 ∪ 𝐶 ′ ) ∩ (𝐵′ ∩ 𝐶 ′ )) = 𝐵′ ∩ 𝐶 ′
Hence Proved

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-4

Example 1.4
If 𝑿 = {𝟏, 𝟐, 𝟑, . . . 𝟏𝟎} and 𝑨 = {𝟏, 𝟐, 𝟑, 𝟒, 𝟓}, find the number of sets 𝑩 ⊆ 𝑿 such that 𝑨 − 𝑩 = {𝟒}
Solution:
Given:
𝑋 = {1, 2, 3, 4,5,6,7,8,9,10}
𝐴 = {1, 2, 3, 4, 5}
𝐴 − 𝐵 = {4} , 𝐵 ⊆ 𝑋
Therefore, possible sets of B
𝐵 = {1, 2, 3, 5} ∪ 𝑠𝑢𝑏𝑠𝑒𝑡𝑠 𝑜𝑓 {6,7,8,9,10} 25 = 2 × 2 × 2 × 2 × 2
𝐶 = {6,7,8,9,10} 𝑛(𝑐) = 5 = 32
The number of subsets 𝑛[𝑝(𝑐)] = 2𝑛(𝑐)
= 25 = 32

Example 1.5
If A and B are two sets so that 𝒏(𝑩 − 𝑨) = 𝟐𝒏(𝑨 − 𝑩) = 𝟒𝒏(𝑨 ∩ 𝑩) and if 𝒏(𝑨 ∪ 𝑩) = 𝟏𝟒, then find 𝒏(𝑷(𝑨)).
Solution:

in
Given: 𝑛(𝐴 ∪ 𝐵) = 14 To find: 𝑛(𝑃(𝐴)), 𝑤𝑒 𝑛𝑒𝑒𝑑 𝑛(𝐴)
Let 𝑛(𝐴 ∩ 𝐵) = 𝐾

s.
2 𝐴∪𝐵
𝑛(𝐵 − 𝐴) = 4𝑛(𝐴 ∩ 𝐵) 2𝑛(𝐴 − 𝐵) = 4𝑛(𝐴 ∩ 𝐵)

es
𝑛(𝐵 − 𝐴) = 4𝑘 𝑛(𝐴 − 𝐵) = 2𝑘 A B
pr
𝑛(𝐴 ∪ 𝐵) = 𝑛(𝐴 − 𝑏) + 𝑛(𝐵 − 𝐴) + 𝑛(𝐴 ∩ 𝐵)
14 = 2𝑘 + 4𝑘 + 𝑘
14 = 7𝑘
ex

𝑘=2 𝐴−𝐵
𝑛(𝐴 ∩ 𝐵) = 𝐾 = 2 𝐵−𝐴 𝐴∪𝐵
vi

𝑛(𝐵 − 𝐴) = 4𝑘 = 4(2) = 8 𝐴∩𝐵

𝑛(𝐴 − 𝐵) = 2𝑘 = 2(2) = 4
l
ka

𝑛(𝐴) = 𝑛(𝐴 − 𝐵) + 𝑛(𝐴 ∩ 𝐵)

=4+2
𝑛(𝐴) = 6
w.

𝑛𝑃[(𝐴)] = 2𝑛(𝐴)
= 26
ww

𝑛𝑃[(𝐴)] = 64

Example 1.6
Two sets have 𝒎 and 𝒌 elements. If the total number of subsets of the first set is 𝟏𝟏𝟐 more than that of the
second set, find the values of 𝒎 and 𝒌.
Solution: Let A and B be the two sets 𝒂𝒎
𝑛(𝐴) = 𝑚 𝑛[𝑝(𝐴)] = 2 𝑚
𝑘 4 𝑚−𝑘 𝒏
= 𝒂𝒎−𝒏
2 = 2 [2 − 1] = 7 𝒂
𝑛(𝐵) = 𝑘 𝑛[𝑝(𝐵)] = 2𝑘 𝐾=4 2𝑚−𝑘 = 8
𝑚 𝑘
2 = 2 + 112 2𝑚−𝑘 = 23
2𝑚 − 2𝑘 = 112 𝑚−𝑘 =3 2 112 2 8
2𝑚
𝑘
2 [ 𝑘 − 1] = 112 𝑚−4=3 2 56 2 4
2 𝑚=7 2 28 2 2
2 14
2𝑘 [2𝑚−𝑘 − 1] = 112 1
7 07
01
2𝑘 [2𝑚−𝑘 − 1] = 24 × 7
Therefore the value of 𝒎 is 7 and 𝒌 is 4

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-5

Example 1.7
If 𝒏(𝑨) = 𝟏𝟎 and 𝒏(𝑨 ∩ 𝑩) = 𝟑, find 𝒏((𝑨 ∩ 𝑩)′ ∩ 𝑨).
Solution:
Given : 𝑛(𝐴) = 10
𝑛(𝐴 ∩ 𝐵) = 3
To find: 𝑛((𝐴 ∩ 𝐵)′ ∩ 𝐴). (𝐴 ∩ 𝐵)′ = 𝐴′ ∪ 𝐵′
𝑛((𝐴 ∩ 𝐵)′ ∩ 𝐴) = 𝑛(𝐴′ ∪ 𝐵′ ) ∩ 𝐴
= 𝑛(𝐴′ ∩ 𝐴) ∪ 𝑛(𝐵′ ∩ 𝐴) (𝐴 ∩ 𝐴)′ = ∅
= ∅ ∪ 𝑛(𝐵′ ∩ 𝐴)
(𝐵′ ∩ 𝐴) = 𝐴 − 𝐵
= 𝑛(𝐵′ ∩ 𝐴)
= 𝑛(𝐴 − 𝐵)
= 𝑛(𝐴) − 𝑛(𝐴 ∩ 𝐵)
= 10 − 3
′
𝑛((𝐴 ∩ 𝐵) ∩ 𝐴) = 7

in
Example 1.9 ∅ = {}
If 𝓟(𝑨) denotes the power set of 𝑨 , then find 𝒏(𝓟(𝓟(𝓟(∅)))) .

s.
𝑛(∅) = 0
Solution: 𝑎0 = 1

es
We know that 𝑛(∅) = 0
𝑛[𝑝(∅)] = 2𝑛(∅) = 20 = 1
𝑛[𝑝(𝑝(∅))] = 2𝑛[𝑝(∅)] = 21 = 2
pr
𝑛[𝑝(𝑝(𝑝(∅)))] = 2𝑛[𝑝(𝑝(∅))] = 22 = 4
𝑛(𝒫(𝒫(𝒫(∅)))) =4
ex

Exercise - 1.1
vi

1. Write the following in roster form.

l
ka

(𝒊) {𝒙 ∈ ℕ: 𝒙𝟐 < 𝟏𝟐𝟏 𝒂𝒏𝒅 𝒙 𝒊𝒔 𝒂 𝒑𝒓𝒊𝒎𝒆}.

Solution :
w.

𝐿𝑒𝑡 𝐴 = {𝑥 ∈ ℕ: 𝑥 2 < 121 𝑎𝑛𝑑 𝑥 𝑖𝑠 𝑎 𝑝𝑟𝑖𝑚𝑒}.

𝑥 2 < 121
𝑥 < 11
ww

𝐴 = {2,3,5,7}.

(𝒊𝒊)𝑻𝒉𝒆 𝒔𝒆𝒕 𝒐𝒇 𝒂𝒍𝒍 𝒑𝒐𝒔𝒊𝒕𝒊𝒗𝒆 𝒓𝒐𝒐𝒕𝒔 𝒐𝒇 𝒕𝒉𝒆 𝒆𝒒𝒖𝒂𝒕𝒊𝒐𝒏 (𝒙 − 𝟏)(𝒙 + 𝟏)(𝒙𝟐 − 𝟏) = 𝟎.

Solution :
(𝑥 − 1)(𝑥 + 1)(𝑥 2 − 1) = 0.
(𝑥 − 1) = 0 (𝑥 + 1) = 0 (𝑥 2 − 1) = 0
𝑥=1 𝑥 = −1 𝑥2 = 1
𝑥 = ±1
𝐵 = {1}

(𝒊𝒊𝒊){𝒙 ∈ ℕ ∶ 𝟒𝒙 + 𝟗 < 𝟓𝟐}.

Solution :
𝐿𝑒𝑡 𝐶 = {𝑥 ∈ ℕ ∶ 4𝑥 + 9 < 52}.
4𝑥 + 9 < 52
4𝑥 < 52 − 9
4𝑥 < 43
43
𝑥<
4

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-6

𝑥 < 10.75
𝐶 = {1,2,3,4,5,6,7,8,9,10}

𝒙−𝟒
(𝒊𝒗) {𝒙 ∶ = 𝟑, 𝒙 ∈ ℝ − {−𝟐}}.
𝒙+𝟐
Solution :
𝑥−4
=3
𝑥+2
𝑥 − 4 = 3(𝑥 + 2)
𝑥 − 4 = 3𝑥 + 6
𝑥 − 3𝑥 = 6 + 4
−2𝑥 = 10
10
𝑥 = −2
𝑥 = −5
𝐷 = {−5}

in
s.
2. Write the set {−𝟏, 𝟏} in set builder form. 𝑥 = −1 𝑥=1
(𝑥 + 1) = 0 (𝑥 − 1) = 0

es
Solution :
𝐿𝑒𝑡 𝐴 = {−1, 1} (𝑥 + 1)(𝑥 − 1) = 0
𝐴 = {𝑥: 𝑥 ∈ ℝ, 𝑥 2 = 1} 𝑥2 − 1 = 0
pr
𝑥2 = 1
ex

3. State whether the following sets are finite or infinite.

(𝒊) {𝒙 ∈ ℕ ∶ 𝒙 𝒊𝒔 𝒂𝒏 𝒆𝒗𝒆𝒏 𝒑𝒓𝒊𝒎𝒆 𝒏𝒖𝒎𝒃𝒆𝒓}.
vi

𝐿𝑒𝑡 𝐴 = {𝑥 ∈ ℕ ∶ 𝑥 𝑖𝑠 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑝𝑟𝑖𝑚𝑒 𝑛𝑢𝑚𝑏𝑒𝑟}. 𝐴 = {2}, Finite Set

l

(ii) {𝒙 ∈ ℕ ∶ 𝒙 𝒊𝒔 𝒂𝒏 𝒐𝒅𝒅 𝒑𝒓𝒊𝒎𝒆 𝒏𝒖𝒎𝒃𝒆𝒓}.

ka

𝐿𝑒𝑡 𝐵 = {𝑥 ∈ ℕ ∶ 𝑥 𝑖𝑠 𝑎𝑛 𝑜𝑑𝑑 𝑝𝑟𝑖𝑚𝑒 𝑛𝑢𝑚𝑏𝑒𝑟}. 𝐵 = {3,5,7,11,13 … … } Infinite Set

(iii) {𝒙 ∈ ℤ ∶ 𝒙 𝒊𝒔 𝒆𝒗𝒆𝒏 𝒂𝒏𝒅 𝒍𝒆𝒔𝒔 𝒕𝒉𝒂𝒏 𝟏𝟎}.
w.

𝐿𝑒𝑡 𝐶 = {𝑥 ∈ ℤ ∶ 𝑥 𝑖𝑠 𝑒𝑣𝑒𝑛 𝑎𝑛𝑑 𝑙𝑒𝑠𝑠 𝑡ℎ𝑎𝑛 10}. 𝐶 = {8,6,4,2,0, −2, −4, … } Infinite Set
(iv) {𝒙 ∈ ℝ ∶ 𝒙 𝒊𝒔 𝒂 𝒓𝒂𝒕𝒊𝒐𝒏𝒂𝒍 𝒏𝒖𝒎𝒃𝒆𝒓}.
ww

𝐿𝑒𝑡 𝐷 = {𝑥 ∈ ℝ ∶ 𝑥 𝑖𝑠 𝑎 𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟}. The set of all rational numbers are Infinite.
The given Set is also an Infinite Set
(v) {𝒙 ∈ ℕ ∶ 𝒙 𝒊𝒔 𝒂 𝒓𝒂𝒕𝒊𝒐𝒏𝒂𝒍 𝒏𝒖𝒎𝒃𝒆𝒓}.
𝐿𝑒𝑡 𝐸 = {𝑥 ∈ ℕ ∶ 𝑥 𝑖𝑠 𝑎 𝑟𝑎𝑡𝑖𝑜𝑛𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟}. It is an Infinite set

4. By taking suitable sets A, B, C, verify the following results:

(𝒊𝒗) 𝑪 − (𝑩 − 𝑨) = (𝑪 ∩ 𝑨) ∪ (𝑪 ∩ 𝑩′ ).
Solution :
𝐿𝑒𝑡 𝐴 = {1,2} 𝐵 = {2,3} 𝐶 = {1,3} 𝑈 = {1,2,3,4}
LHS : 𝐶 − (𝐵 − 𝐴)
𝐵 − 𝐴 = {2,3} − {1,2}
=3
𝐶 − (𝐵 − 𝐴) = {1,3} − {3}
= {1} ---------------------①
RHS : (𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵′ )
𝐶 ∩ 𝐴 = {1,3 } ∩ {1,2}
=1

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-7

𝐵′ = 𝑈 − 𝐵
= {1,2,3,4} − {2,3}
= {1,4}
𝐶 ∩ 𝐵′ = {1,3} ∩ {1,4}
= {1}
(𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵′ ) = {1} ∪ {1}
= {1} ----------------------②
From ①&② LHS=RHS
𝐶 − (𝐵 − 𝐴) = (𝐶 ∩ 𝐴) ∪ (𝐶 ∩ 𝐵′ ) Hence verified

(𝒗) (𝑩 − 𝑨) ∩ 𝑪 = (𝑩 ∩ 𝑪) − 𝑨 = 𝑩 ∩ (𝑪 − 𝑨).
Solution :
𝐿𝑒𝑡 𝐴 = {1,2} 𝐵 = {2,3} 𝐶 = {1,3}
𝐵 − 𝐴 = {2,3} − {1,2}
= {3}

in
(𝐵 − 𝐴) ∩ 𝐶 = {3} ∩ {1,3}
= {3} ---------------------①

s.
𝐵∩𝐶 = {2,3} ∩ {1,3}
= {3}

es
(𝐵 ∩ 𝐶) − 𝐴 = {3} − {1,2}
= {3} ----------------------②
pr
𝐶 − 𝐴 = {1,3} − {1,2}
= {3}
𝐵 ∩ (𝐶 − 𝐴) = {2,3} ∩ {3}
ex

= {3} ----------------------③
From ①&②&③
vi

(𝐵 − 𝐴) ∩ 𝐶 = (𝐵 ∩ 𝐶) − 𝐴 = 𝐵 ∩ (𝐶 − 𝐴)
l

(𝒗𝒊) (𝑩 − 𝑨) ∪ 𝑪 = (𝑩 ∪ 𝑪) − (𝑨 − 𝑪).
ka

Solution :
𝐿𝑒𝑡 𝐴 = {1,2} 𝐵 = {2,3} 𝐶 = {1,3}
w.

LHS : (𝐵 − 𝐴) ∪ 𝐶
𝐵 − 𝐴 = {2,3} − {1,2}
ww

= {3}
(𝐵 − 𝐴) ∪ 𝐶 = {3} ∪ {1,3}

= {1,3} ---------------------①

RHS : (𝐵 ∪ 𝐶) − (𝐴 − 𝐶).
𝐵 ∪ 𝐶 = {2,3} ∪ {1,3}
= {1,2,3}
𝐴 − 𝐶 = {1,2} − {1,3}
= {2}
(𝐵 ∪ 𝐶) − (𝐴 − 𝐶) = {1,2,3} − {2}

= {1,3} ----------------------②
From ①&② LHS=RHS
(𝐵 − 𝐴) ∪ 𝐶 = (𝐵 ∪ 𝐶) − (𝐴 − 𝐶)
Hence verified

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-8

5. Justify the trueness of the statement:

“𝑨𝒏 𝒆𝒍𝒆𝒎𝒆𝒏𝒕 𝒐𝒇 𝒂 𝒔𝒆𝒕 𝒄𝒂𝒏 𝒏𝒆𝒗𝒆𝒓 𝒃𝒆 𝒂 𝒔𝒖𝒃𝒔𝒆𝒕 𝒐𝒇 𝒊𝒕𝒔𝒆𝒍𝒇. ”
Any element of set cannot be a subset of the set as only a set can be a subset.
𝐿𝑒𝑡 𝐴 = {1,2,3, 𝑎}
1 ∈ A it means 1 is an element of A. 1 is not a subset of A
∴ 𝑇ℎ𝑒 𝑔𝑖𝑣𝑒𝑛 𝑠𝑡𝑎𝑡𝑒𝑚𝑒𝑛𝑡 𝑖𝑠 𝑡𝑟𝑢𝑒.

𝟔. 𝑰𝒇 𝒏(𝑷(𝑨)) = 𝟏𝟎𝟐𝟒, 𝒏(𝑨 ∪ 𝑩) = 𝟏𝟓 𝒂𝒏𝒅 𝒏(𝑷(𝑩)) = 𝟑𝟐, 𝒕𝒉𝒆𝒏 𝒇𝒊𝒏𝒅 𝒏(𝑨 ∩ 𝑩).
Solution :
Given : 𝑛(𝑃(𝐴)) = 1024
𝑛(𝐴 ∪ 𝐵) = 15 2 1024 2 32
𝑛(𝑃(𝐵)) = 32 2 512 2 16
To find: 𝑛(𝐴 ∩ 𝐵). We need 𝑛(𝐴) 𝑎𝑛𝑑 𝑛(𝐵) 2 256 2 8
2 128 2 4
𝑛(𝑃(𝐴)) = 1024 𝑛(𝑃(𝐵)) = 32 2 64 2 2

in
2𝑛(𝐴) = 1024 2𝑛(𝐵) = 32 2 32 1
n(A) 10 𝑛(𝐵) 5
2 =2 2 =2 2 16

s.
𝑛(𝐴) = 10 𝑛(𝐵) = 5 2 8
2 4

es
2 2
𝑛(𝐴 ∪ 𝐵) = 𝑛(𝐴) + 𝑛(𝐵) − 𝑛(𝐴 ∩ 𝐵) 1
𝑛(𝐴 ∩ 𝐵) = 𝑛(𝐴) + 𝑛(𝐵) − 𝑛(𝐴 ∪ 𝐵)
pr
= 10 + 5 − 15
𝑛(𝐴 ∩ 𝐵) = 0
ex

𝟕. 𝑰𝒇 𝒏(𝑨 ∩ 𝑩) = 𝟑 𝒂𝒏𝒅 𝒏(𝑨 ∪ 𝑩) = 𝟏𝟎, 𝒕𝒉𝒆𝒏 𝒇𝒊𝒏𝒅 𝒏(𝑷(𝑨∆𝑩)).

Solution:
vi

Given: 𝑛(𝐴 ∩ 𝐵) = 3
l

𝑛(𝐴 ∪ 𝐵) = 10
ka

To find : 𝒏(𝑷(𝑨∆𝑩))
(𝐴∆𝐵) = (𝐴 ∪ 𝐵) − (𝐴 ∩ 𝐵)
𝑛(𝐴∆𝐵) = 𝑛(𝐴 ∪ 𝐵) − 𝑛(𝐴 ∩ 𝐵)
= 10 − 3
w.

𝑛(𝐴∆𝐵) = 7
ww

𝑛(𝑃(𝐴∆𝐵)) = 2𝑛(𝐴∆𝐵)
= 27
𝑛(𝑃(𝐴∆𝐵)) = 128

Example 1.10
𝑪𝒉𝒆𝒄𝒌 𝒕𝒉𝒆 𝒓𝒆𝒍𝒂𝒕𝒊𝒐𝒏 𝑹 = {(𝟏, 𝟏), (𝟐, 𝟐), (𝟑, 𝟑), . . . , (𝒏, 𝒏)} 𝒅𝒆𝒇𝒊𝒏𝒆𝒅 𝒐𝒏 𝒕𝒉𝒆 𝒔𝒆𝒕 𝑺 = {𝟏, 𝟐, 𝟑, . . . , 𝒏} 𝒇𝒐𝒓 𝒕𝒉𝒆
𝒕𝒉𝒓𝒆𝒆 𝒃𝒂𝒔𝒊𝒄 𝒓𝒆𝒍𝒂𝒕𝒊𝒐𝒏𝒔.
Solution:
i) Reflexive : (𝑎, 𝑎) ∈ 𝑅 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑎 ∈ 𝑆
(1,1) ∈ 𝑅, (2,2) ∈ 𝑅, (3,3) ∈ 𝑅 … . . (𝑛, 𝑛) ∈ 𝑅
∴ 𝑅 𝑖𝑠 𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛
ii) Symmetric : (𝑎, 𝑏) ∈ 𝑅 ⟹ (𝑏, 𝑎) ∈ 𝑅 (or) (𝑎, 𝑏) ∉ 𝑅 ⟹ (𝑏, 𝑎) ∉ 𝑅
𝑇ℎ𝑒𝑟𝑒 𝑖𝑠 𝑛𝑜 𝑝𝑎𝑖𝑟 (𝑎, 𝑏) ∈ 𝑅
𝑆𝑜 (𝑏, 𝑎) 𝑛𝑒𝑒𝑑 𝑛𝑜𝑡 𝑖𝑛 𝑅
∴ 𝑅 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛
iii) Transitive : (𝑎, 𝑏), (𝑏, 𝑐) ∈ 𝑅 ⟹ (𝑎, 𝑐) ∈ 𝑅 (or) (𝑎, 𝑏), (𝑏, 𝑐) ∉ 𝑅 ⟹ (𝑎, 𝑐) ∉ 𝑅
𝑇ℎ𝑒𝑟𝑒 𝑖𝑠 𝑛𝑜 𝑝𝑎𝑖𝑟 (𝑎, 𝑏), (𝑏, 𝑐) ∈ 𝑅

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-9

𝑆𝑜 (𝑎, 𝑐) 𝑛𝑒𝑒𝑑 𝑛𝑜𝑡 𝑖𝑛 𝑅

∴ 𝑅 𝑖𝑠 𝑇𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛
∵ 𝑅 𝑖𝑠 𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒, 𝑆𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 𝑎𝑛𝑑 𝑇𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒
∴ 𝑅 𝑖𝑠 𝑎𝑛 𝐸𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛.

Example 1.11
𝑳𝒆𝒕 𝑺 = {𝟏, 𝟐, 𝟑} 𝒂𝒏𝒅 𝝆 = {(𝟏, 𝟏), (𝟏, 𝟐), (𝟐, 𝟐), (𝟏, 𝟑), (𝟑, 𝟏)}.
(i) Is ρ reflexive? If not, state the reason and write the minimum set of ordered pairs to be
included to ρ so as to make it reflexive.
(ii) Is ρ symmetric? If not, state the reason, write minimum number of ordered pairs to be included to ρ so as to
make it symmetric and write minimum number of ordered pairs to be deleted from ρ so as to make it
symmetric.
(iii) Is ρ transitive? If not, state the reason, write minimum number of ordered pairs to be included to ρ so as to
make it transitive and write minimum number of ordered pairs to be deleted from ρ so as to make it
transitive.

in
(iv) Is ρ an equivalence relation? If not, write the minimum ordered pairs to be included to ρ so as to make it an
equivalence relation.

s.
Solution:
𝑆 = {1, 2, 3}

es
𝜌 = {(1, 1), (1, 2), (2, 2), (1, 3), (3, 1)}.
i) Reflexive : 𝜌 is not Reflective
since (3,3) ∉ 𝜌
pr
We have to include (3,3) to make it reflexive
ii) Symmetric : 𝜌 is not Symmetric since (2,1) ∉ 𝜌
ex

We have to include (2,1) to make it symmetric

We have to remove (1,2) to make it symmetric
vi

iii) Transitive : 𝜌 is not Transitive

since (3,1) 𝑎𝑛𝑑 (1,2) ∈ 𝜌 𝑏𝑢𝑡 (3,2) ∉ 𝜌
l
ka

(3,1) 𝑎𝑛𝑑 (1,3) ∈ 𝜌 𝑏𝑢𝑡 (3,3) ∉ 𝜌

We have to include (3,2) and (3,3) to make it Transitive
We have to remove (3,1) 𝑓𝑟𝑜𝑚 𝜌 to make it Transitive
w.

iv) Equivalence : 𝜌 is not Equivalence

ww

𝑠𝑖𝑛𝑐𝑒 (3,3) ∉ 𝜌 (2,1) ∉ 𝜌 (3,2) ∉ 𝜌

To make 𝜌 reflexive, we have to include (3,3)
To make 𝜌 Symmetric, we have to include (2,1)
To make 𝜌 Transitive, we have to include (3,3) (3,2)
∴ 𝑇ℎ𝑒 𝑛𝑒𝑤 𝜌 = {(1, 1), (1, 2), (2, 2), (1, 3), (3, 1), (3,3), (2,1), (3,2)}
(3,2) does not have symmetric we have to include (2,3) to 𝜌 to make it Equivalence relation.
𝜌 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (1,3), (3,1), (2,3), (3,2)}
∴ We have to include (3,3), (2,1), (3,2) and (2,3) to 𝜌 to make it an Equivalence Relation.

Example 1.12
Let 𝑨 = {𝟎, 𝟏, 𝟐, 𝟑}. Construct relations on A of the following types:
(i) not reflexive, not symmetric, not transitive.
(ii) not reflexive, not symmetric, transitive.
(iii) not reflexive, symmetric, not transitive.
(iv) not reflexive, symmetric, transitive.
(v) reflexive, not symmetric, not transitive.
(vi) reflexive, not symmetric, transitive.

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-10

(vii) reflexive, symmetric, not transitive.

(viii) reflexive, symmetric, transitive.
Solution:
Given : 𝐴 = {0, 1, 2, 3}

i) 𝑅1 = {(1,2), (2,3)} is not reflexive, not symmetric, not transitive.

ii) 𝑅2 = {(1,2)} is not reflexive, not symmetric, transitive.
iii) 𝑅3 = {(1,2), (2,1)} is not reflexive, symmetric, not transitive.
iv) 𝑅4 = {(1,1)} is not reflexive, symmetric, transitive.
v) 𝑅5 = {(0,0), (1,1), (2,2), (3,3), (1,2), (2,3)} is reflexive, not symmetric, not transitive.
vi) 𝑅6 = {(0,0), (1,1), (2,2), (3,3), (1,2)} is reflexive, not symmetric, transitive.
vii) 𝑅7 = {(0,0), (1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)} is reflexive, symmetric, not transitive.
viii) 𝑅8 = {(0,0), (1,1), (2,2), (3,3)} is reflexive, symmetric, transitive.

in
Example 1.13
In the set Z of integers, define 𝒎𝑹𝒏 if 𝒎 − 𝒏 is a multiple of 𝟏𝟐. Prove that 𝑹 is an equivalence relation.

s.
Solution:

es
Reflexive :
mRm ⟹ 𝑚 − 𝑚 = 0 (multiple of 12)
∴ 𝑅 𝑖𝑠 𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒
pr
Symmetric
mRn ⟹ 𝑚 − 𝑛 = 12𝑘
ex

nRm ⟹ 𝑛 − 𝑚 = −(𝑚 − 𝑛)
= −12𝑘
vi

∴ 𝑅 𝑖𝑠 𝑆𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐
Transitive
l
ka

mRn ⟹ 𝑚 − 𝑛 = 12𝑙 ---------①

nRo ⟹ 𝑛 − 𝑜 = 12𝑘 ---------②
①+②
w.

(𝑚 − 𝑛) + (𝑛 − 𝑜) = 12𝑙 + 12𝑘
𝑚 − 𝑜 = 12(𝑙 + 𝑘)
ww

⟹mRo
∴ 𝑅 𝑖𝑠 𝑇𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒
R is an Equivalence Relation

Exercise - 1.2
1. Discuss the following relations for reflexivity, symmetricity and transitivity:
(i) The relation 𝑹 defined on the set of all positive integers by “𝒎𝑹𝒏 𝒊𝒇 𝒎 𝒅𝒊𝒗𝒊𝒅𝒆𝒔 𝒏”.
Solution:
Reflexive :
𝐿𝑒𝑡 (𝑚, 𝑚) ∈ 𝑅
𝑚
𝑚
= 1 (positive integer)
∴ 𝑚𝑅𝑚
∴ 𝑅 𝑖𝑠 𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒
Symmetric
𝐿𝑒𝑡 (𝑚, 𝑛) ∈ 𝑅
𝑛
𝑚
= 𝑘 for some k

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-11

𝑛 = 𝑚𝑘
Also, (𝑛, 𝑚) ∈ 𝑅
𝑚 𝑚 1
𝑛
= 𝑚𝑘 = 𝑘 (not a positive integer)
𝑛𝑅𝑚
∴ 𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑆𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐
Transitive
𝐿𝑒𝑡 (𝑚, 𝑛) ∈ 𝑅 𝑎𝑛𝑑 (𝑛, 𝑝) ∈ 𝑅
𝑇𝑜 𝑝𝑟𝑜𝑣𝑒 (𝑚, 𝑝) ∈ 𝑅
𝑛
mRn ⟹ ‘𝑚’ 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 ‘𝑛’ ⟹ 𝑚 = 𝑘1, for some 𝑘1
Then 𝑛 = 𝑚𝑘1
𝑝
nRp ⟹ ‘𝑛’ 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 ‘𝑝’ ⟹ 𝑛 = 𝑘2 , for some 𝑘2
Then 𝑝 = 𝑛𝑘2
𝑝 = 𝑚𝑘1 𝑘2
∴ 𝑚𝑅𝑝
∴ 𝑅 𝑖𝑠 𝑇𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

in
s.
(ii) Let 𝑷 denote the set of all straight lines in a plane. The relation 𝑹 defined by “𝓵𝑹𝒎 if 𝓵 is perpendicular to 𝒎”.
Solution:
n

es
Reflexive : m
ℓ
𝐿𝑒𝑡 ℓ 𝑏𝑒 𝑎 𝑠𝑡𝑟𝑎𝑖𝑔ℎ𝑡 𝑖𝑛 𝑎 𝑝𝑙𝑎𝑛𝑒
∴ ℓ 𝑖𝑠 𝑛𝑜𝑡 𝑝𝑒𝑟𝑝𝑒𝑛𝑑𝑖𝑐𝑢𝑙𝑎𝑟 𝑡𝑜 ℓ
pr
(ℓ, ℓ) ∉ 𝑅
∴ 𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒
ex

Symmetric
𝐿𝑒𝑡 (ℓ, 𝑚) ∈ 𝑅 and (𝑚. ℓ) ∈ 𝑅
ℓ𝑅𝑚 ⟹ ℓ 𝑖𝑠 𝑝𝑒𝑟𝑝𝑒𝑛𝑑𝑖𝑐𝑢𝑙𝑎𝑟 𝑡𝑜 𝑚
vi

𝑚𝑅ℓ ⟹ 𝑚 𝑖𝑠 𝑝𝑒𝑟𝑝𝑒𝑛𝑑𝑖𝑐𝑢𝑙𝑎𝑟 𝑡𝑜 ℓ
∴ 𝑅 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑦
l
ka

Transitive
𝐿𝑒𝑡 (ℓ, 𝑚), (𝑚, 𝑛) ∈ 𝑅
ℓ𝑅𝑚 ⟹ ℓ 𝑖𝑠 𝑝𝑒𝑟𝑝𝑒𝑛𝑑𝑖𝑐𝑢𝑙𝑎𝑟 𝑡𝑜 𝑚
w.

𝑚𝑅𝑛 ⟹ 𝑚 𝑖𝑠 𝑝𝑒𝑟𝑝𝑒𝑛𝑑𝑖𝑐𝑢𝑙𝑎𝑟 𝑡𝑜 𝑛
ℓ 𝑖𝑠 𝑛𝑜𝑡 𝑝𝑒𝑟𝑝𝑒𝑛𝑑𝑖𝑐𝑢𝑙𝑎𝑟 𝑡𝑜 𝑛
ww

ℓ𝑅𝑛
∴ 𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑇𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

(iii) Let 𝑨 be the set consisting of all the members of a family. The relation 𝑹 defined by “𝒂𝑹𝒃
if 𝒂 is not a sister of 𝒃”.
Solution:
Given Relation is "𝑎𝑅𝑏 𝑖𝑓 𝑎 is not a sister of 𝑏”.
𝐴 = {𝑓, 𝑚, 𝑠, 𝑑}
Reflexive :
No person can be a sister of himself or herself.
∴ 𝑎𝑅𝑎 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑎 ∈ 𝐴
∴ 𝑅 𝑖𝑠 𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒
Symmetric
𝑠𝑅𝑑 ⟹ s is not a sister of d
⟹ d is a sister of s
⟹ 𝑑𝑅𝑠
∴ 𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-12

Transitive
𝑑𝑅𝑚 ⟹ d is not a sister of m
𝑚𝑅𝑠 ⟹ m is not a sister of s
⟹ 𝑑 𝑖𝑠 𝑎 𝑠𝑖𝑠𝑡𝑒𝑟 𝑜𝑓 𝑠
⟹ 𝑑𝑅𝑠
∴ 𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑡𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

(iv) Let 𝑨 be the set consisting of all the female members of a family. The relation R defined by “𝒂𝑹𝒃 if a is not a
sister of 𝒃”.
Solution:
𝐴 = {𝐺, 𝑀, 𝐷}
Reflexive :
𝑎𝑅𝑎 ⟹ 𝑎 𝑖𝑠 𝑛𝑜𝑡 𝑎 𝑠𝑖𝑠𝑡𝑒𝑟 𝑜𝑓 𝑎
∴ 𝑅 𝑖𝑠 𝑟𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒
Symmetric
𝑔𝑅𝑚 ⟹ 𝑔 𝑖𝑠 𝑛𝑜𝑡 𝑎 𝑠𝑖𝑠𝑡𝑒𝑟 𝑜𝑓 𝑚

in
⟹ 𝑚 𝑖𝑠 𝑛𝑜𝑡 𝑎 𝑠𝑖𝑠𝑡𝑒𝑟 𝑜𝑓 𝑔
⟹ 𝑚𝑅𝑔

s.
∴ 𝑅 𝑖𝑠 𝑆𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

es
Transitive
𝑔𝑅𝑚 ⟹ 𝑔 𝑖𝑠 𝑛𝑜𝑡 𝑎 𝑠𝑖𝑠𝑡𝑒𝑟 𝑜𝑓 𝑚
𝑚𝑅𝑑 ⟹ 𝑚 𝑖𝑠 𝑛𝑜𝑡 𝑎 𝑠𝑖𝑠𝑡𝑒𝑟 𝑜𝑓 𝑑
pr
⟹ 𝑔 𝑖𝑠 𝑛𝑜𝑡 𝑎 𝑠𝑖𝑠𝑡𝑒𝑟 𝑜𝑓 𝑑
⟹ 𝑔𝑅𝑑
ex

𝑅 𝑖𝑠 𝑇𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

(v) On the set of natural numbers the relation R defined by “𝒙𝑹𝒚 𝒊𝒇 𝒙 + 𝟐𝒚 = 𝟏”.
vi

Solution:
Reflexive :
l

𝑥𝑅𝑦 ⟹ 𝑥 + 2𝑦 = 1.
ka

∴ 𝑅 𝑖𝑠 𝑎𝑛 𝑒𝑚𝑝𝑡𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛
𝑥𝑅𝑥 ⟹ 𝑥 + 2𝑥 = 1.
w.

3𝑥 = 1
1
𝑥=3∉𝑁
ww

∴ 𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑅𝑒𝑓𝑙𝑒𝑐𝑡𝑖𝑣𝑒
Symmetric
𝑅 𝑖𝑠 𝑎𝑛 𝑒𝑚𝑝𝑡𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 An empty relation can be considered
𝑅 𝑖𝑠 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐 (by defination) as symmetric and transitive.
Transitive
𝑅 𝑖𝑠 𝑎𝑛 𝑒𝑚𝑝𝑡𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛
𝑅 𝑖𝑠 𝑇𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒 (by defination)

𝟐. 𝑳𝒆𝒕 𝑿 = {𝒂, 𝒃, 𝒄, 𝒅} 𝒂𝒏𝒅 𝑹 = {(𝒂, 𝒂), (𝒃, 𝒃), (𝒂, 𝒄)}. 𝑾𝒓𝒊𝒕𝒆 𝒅𝒐𝒘𝒏 𝒕𝒉𝒆 𝒎𝒊𝒏𝒊𝒎𝒖𝒎 𝒏𝒖𝒎𝒃𝒆𝒓 𝒐𝒇 𝒐𝒓𝒅𝒆𝒓𝒆𝒅
𝒑𝒂𝒊𝒓𝒔 𝒕𝒐 𝒃𝒆 𝒊𝒏𝒄𝒍𝒖𝒅𝒆𝒅 𝒕𝒐 𝑹 𝒕𝒐 𝒎𝒂𝒌𝒆 𝒊𝒕
Solution:
Given : 𝑋 = {𝑎, 𝑏, 𝑐, 𝑑}
𝑅 = {(𝑎, 𝑎), (𝑏, 𝑏), (𝑎, 𝑐)}
(i) reflexive
(𝑎, 𝑎), (𝑏, 𝑏) ∈ 𝑅 but (𝑐, 𝑐), (𝑑, 𝑑) ∉ 𝑅
We have to include (𝑐, 𝑐), (𝑑, 𝑑) to make it Reflexive

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-13

(ii) symmetric
(𝑎, 𝑐) ∈ 𝑅 but (𝑐, 𝑎) ∉ 𝑅
We have to include (𝑐, 𝑎) to make it Symmetric
(iii) transitive
Already R is transitive. Nothing to include with R to make it transitive
(iv) equivalence
(𝑐, 𝑐), (𝑑, 𝑑), (𝑐, 𝑎) should be included to R to make it Equivalence.

𝟑. 𝑳𝒆𝒕 𝑨 = {𝒂, 𝒃, 𝒄} 𝒂𝒏𝒅 𝑹 = {(𝒂, 𝒂), (𝒃, 𝒃), (𝒂, 𝒄)}. 𝑾𝒓𝒊𝒕𝒆 𝒅𝒐𝒘𝒏 𝒕𝒉𝒆 𝒎𝒊𝒏𝒊𝒎𝒖𝒎 𝒏𝒖𝒎𝒃𝒆𝒓 𝒐𝒇 𝒐𝒓𝒅𝒆𝒓𝒆𝒅 𝒑𝒂𝒊𝒓𝒔
𝒕𝒐 𝒃𝒆 𝒊𝒏𝒄𝒍𝒖𝒅𝒆𝒅 𝒕𝒐 𝑹 𝒕𝒐 𝒎𝒂𝒌𝒆 𝒊𝒕
Solution:
Given : 𝐴 = {𝑎, 𝑏, 𝑐}
𝑅 = {(𝑎, 𝑎), (𝑏, 𝑏), (𝑎, 𝑐)}
(i) reflexive

in
(𝑎, 𝑎), (𝑏, 𝑏) ∈ 𝑅 but (𝑐, 𝑐) ∉ 𝑅
We have to include (𝑐, 𝑐) to make it Reflexive.

s.
(ii) symmetric
(𝑎, 𝑐) ∈ 𝑅 but (𝑐, 𝑎) ∉ 𝑅

es
We have to include (𝑐, 𝑎) to make it Symmetric
(iii) transitive
pr
Already R is transitive. Nothing to include with R to make it transitive
(iv) equivalence
ex

(𝑐, 𝑐), (𝑐, 𝑎) should be included to R to make it Equivalence.

vi

4. Let 𝑷 be the set of all triangles in a plane and 𝑹 be the relation defined on 𝑷 as 𝒂𝑹𝒃 if 𝒂 is similar to 𝒃.
Prove that R is an equivalence relation.
l

Solution:
ka

Let 𝑎, 𝑏, 𝑐 ∈ 𝑃
Reflexive:
w.

𝐿𝑒𝑡 𝑎𝑅𝑎 ⇒ 𝑎 𝑖𝑠 𝑠𝑖𝑚𝑖𝑙𝑎𝑟 𝑡𝑜 𝑎 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑎 ∈ 𝑃

𝑅 is reflexive
ww

Symmetric:
𝐼𝑓 𝑎𝑅𝑏 ⇒ 𝑏𝑅𝑎
Clearly w.k.that 𝑎 is similar to 𝑏. Which is always 𝑏 is similar to 𝑎
∴ 𝑅 is symmetric
Transitive:
Let 𝑎𝑅𝑏 and 𝑏𝑅𝑐 ⇒ 𝑎𝑅𝑐
That 𝑎 is similar to 𝑏, 𝑏 is similar to 𝑐
𝑎 is similar to 𝑐
𝑅 is transitive
∴ 𝑅 is reflexive, symmetric, transitive
∴ 𝑅 is equivalence

5. On the set of natural numbers let 𝑹 be the relation defined by 𝒂𝑹𝒃 if 𝟐𝒂 + 𝟑𝒃 = 𝟑𝟎. Write down the relation
by listing all the pairs. Check whether it is
Solution:
2𝑎 + 3𝑏 = 30
3𝑏 = 30 − 2𝑎

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-14

30 − 2𝑎
𝑏=
3
30−6 24
𝑤ℎ𝑒𝑛 𝑎 = 3, 𝑏 = 3 , 𝑏 = 3 = 8
30−12 18
𝑤ℎ𝑒𝑛 𝑎 = 6, 𝑏 = 3
,𝑏 = 3 = 6
30−18 12
𝑤ℎ𝑒𝑛 𝑎 = 9, 𝑏 = 3 , 𝑏 = 3 = 4
30−24 6
𝑤ℎ𝑒𝑛 𝑎 = 12, 𝑏 = 3 , 𝑏 = 3 = 2
𝑅 = {(3,8), (6,6), (9,4), (12,2)}

(i) reflexive
(3,3), (4,4), (9,9), (12,12) ∉ 𝑅
∴ 𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒
(ii) symmetric
(3,8) ∈ 𝑅 but (8,3) ∉ 𝑅
∴ 𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐

in
(iii) transitive
There is no relation like 𝑎𝑅𝑏 and 𝑏𝑅𝑐

s.
∴ 𝑅 𝑖𝑠 𝑇𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒

es
(iv) equivalence
𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒
pr
6. Prove that the relation “friendship” is not an equivalence relation on the set of all people in Chennai.
Solution:
ex

Let a,b,c are people in chennai

Reflexive:
vi

𝑎 𝑖𝑠 𝑛𝑜𝑡 𝑎 𝑓𝑟𝑖𝑒𝑛𝑑 𝑜𝑓 𝑎
𝑎𝑅𝑎
l

∴ 𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒
ka

Symmetric:
𝑎𝑅𝑏 ⟹ 𝑎 𝑖𝑠 𝑎 𝑓𝑟𝑖𝑒𝑛𝑑 𝑜𝑓 𝑏
w.

⟹ 𝑏 𝑖𝑠 𝑎 𝑓𝑟𝑖𝑒𝑛𝑑 𝑜𝑓 𝑎
∴ 𝑏𝑅𝑎
ww

∴ 𝑅 𝑖𝑠 𝑆𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐
Transitive:
𝑎𝑅𝑏 ⟹ 𝑎 𝑖𝑠 𝑎 𝑓𝑟𝑖𝑒𝑛𝑑 𝑜𝑓 𝑏
𝑏𝑅𝑐 ⟹ 𝑏 𝑖𝑠 𝑎 𝑓𝑟𝑖𝑒𝑛𝑑 𝑜𝑓 𝑐
𝑎 need not be a friend of 𝑐
∴ 𝑎𝑅𝑐
R is not Transitive
𝐻𝑒𝑛𝑐𝑒, 𝑡ℎ𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 "𝑓𝑟𝑖𝑒𝑛𝑑𝑠𝑖𝑝" 𝑖𝑠 𝑛𝑜𝑡 𝑎𝑛 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛.

7. On the set of natural numbers let R be the relation defined by aRb if 𝒂 + 𝒃 ≤ 𝟔. Write down the relation by
listing all the pairs. Check whether it is
Solution:
𝑎+𝑏 ≤6
𝑅 = {(1,1), (1,2), (1,3), (1,4), (1,5), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2), (3,3), (4,1), (4,2), (5,1)}
(i) reflexive
(4,4), (5,5) ∉ 𝑅
∴ 𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-15

(ii) symmetric
For every element of (1,2), (1,3), (1,4), (1,5), (2,3), (2,4) ∈ 𝑅
there exist (2,1), (3,1), (4,1), (5,1), (3,2), (4,2) ∈ 𝑅 respectively.
∴ 𝑅 𝑖𝑠 𝑆𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐
(iii) transitive
(4,2), (2,4) ∈ 𝑅 but (4,4) ∉ 𝑅
R is not Transitive
(iv) equivalence
R is not an equivalence
Since, R is not Symmetric and transitive

𝟖. 𝑳𝒆𝒕 𝑨 = {𝒂, 𝒃, 𝒄}. 𝑾𝒉𝒂𝒕 𝒊𝒔 𝒕𝒉𝒆 𝒆𝒒𝒖𝒊𝒗𝒂𝒍𝒆𝒏𝒄𝒆 𝒓𝒆𝒍𝒂𝒕𝒊𝒐𝒏 𝒐𝒇 𝒔𝒎𝒂𝒍𝒍𝒆𝒔𝒕 𝒄𝒂𝒓𝒅𝒊𝒏𝒂𝒍𝒊𝒕𝒚 𝒐𝒏 𝑨? 𝑾𝒉𝒂𝒕 𝒊𝒔 𝒕𝒉𝒆
𝒆𝒒𝒖𝒊𝒗𝒂𝒍𝒆𝒏𝒄𝒆 𝒓𝒆𝒍𝒂𝒕𝒊𝒐𝒏 𝒐𝒇 𝒍𝒂𝒓𝒈𝒆𝒔𝒕 𝒄𝒂𝒓𝒅𝒊𝒏𝒂𝒍𝒊𝒕𝒚 𝒐𝒏 𝑨?
Solution:
Given : 𝐴 = {𝑎, 𝑏, 𝑐}

in
𝐴 × 𝐴 = {𝑎, 𝑏, 𝑐) × {𝑎, 𝑏, 𝑐}
= {(𝑎, 𝑎), (𝑎, 𝑏), (𝑎, 𝑐), (𝑏, 𝑎), (𝑏, 𝑏), (𝑏, 𝑐), (𝑐, 𝑎), (𝑐, 𝑏), (𝑐, 𝑐)}

s.
𝑇ℎ𝑒 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 𝑠𝑚𝑎𝑙𝑙𝑒𝑠𝑡 𝑐𝑎𝑟𝑑𝑖𝑛𝑎𝑙𝑖𝑡𝑦 𝑜𝑛 𝐴

es
𝑅1 = {(𝑎, 𝑎), (𝑏, 𝑏), (𝑐, 𝑐)}
𝑛(𝑅1 ) = 3
pr
𝑇ℎ𝑒 𝑒𝑞𝑢𝑖𝑣𝑎𝑙𝑒𝑛𝑐𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 𝑙𝑎𝑟𝑔𝑒𝑠𝑡 𝑐𝑎𝑟𝑑𝑖𝑛𝑎𝑙𝑖𝑡𝑦 𝑜𝑛 𝐴
𝑅2 = {(𝑎, 𝑎), (𝑎, 𝑏), (𝑎, 𝑐), (𝑏, 𝑎), (𝑏, 𝑏), (𝑏, 𝑐), (𝑐, 𝑎), (𝑐, 𝑏), (𝑐, 𝑐)}
ex

𝑛(𝑅2 ) = 9
vi

𝟗. 𝑰𝒏 𝒕𝒉𝒆 𝒔𝒆𝒕 𝒁 𝒐𝒇 𝒊𝒏𝒕𝒆𝒈𝒆𝒓𝒔, 𝒅𝒆𝒇𝒊𝒏𝒆 𝒎𝑹𝒏 𝒊𝒇 𝒎 − 𝒏 𝒊𝒔 𝒅𝒊𝒗𝒊𝒔𝒊𝒃𝒍𝒆 𝒃𝒚 𝟕. 𝑷𝒓𝒐𝒗𝒆 𝒕𝒉𝒂𝒕 𝑹 𝒊𝒔 𝒂𝒏

𝒆𝒒𝒖𝒊𝒗𝒂𝒍𝒆𝒏𝒄𝒆 𝒓𝒆𝒍𝒂𝒕𝒊𝒐𝒏.
l
ka

Solution:
Reflexive :
𝑚 − 𝑚 = 0 (divisible by 7)
w.

⟹ mRm
∴ 𝑅 𝑖𝑠 𝑅𝑒𝑓𝑙𝑒𝑥𝑖𝑣𝑒
ww

Symmetric
mRn ⟹ 𝑚 − 𝑛 = 7𝑘
⟹ 𝑛 − 𝑚 = −(𝑚 − 𝑛) = −7𝑘
⟹ nRm
∴ 𝑅 𝑖𝑠 𝑆𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐
Transitive
mRn ⟹ 𝑚 − 𝑛 = 7𝑙 ---------①
nRo ⟹ 𝑛 − 𝒪 = 7𝑘 ---------②
①+②
(𝑚 − 𝑛) + (𝑛 − 𝒪) = 7𝑙 + 7𝑘
𝑚 − 𝒪 = 7(𝑙 + 𝑘)
⟹mR𝒪
∴ 𝑅 𝑖𝑠 𝑇𝑟𝑎𝑛𝑠𝑖𝑡𝑖𝑣𝑒
R is an Equivalence Relation

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-16

Example 1.30
𝑰𝒇 𝒇: 𝑹 → 𝑹 𝒊𝒔 𝒅𝒆𝒇𝒊𝒏𝒆𝒅 𝒃𝒚 𝒇(𝒙) = 𝟐𝒙 − 𝟑 𝒑𝒓𝒐𝒗𝒆 𝒕𝒉𝒂𝒕 𝒇 𝒊𝒔 𝒂 𝒃𝒊𝒋𝒆𝒄𝒕𝒊𝒐𝒏 𝒂𝒏𝒅 𝒇𝒊𝒏𝒅 𝒊𝒕𝒔 𝒊𝒏𝒗𝒆𝒓𝒔𝒆.
Solution:
Method 1:
One-to-one :
𝑓(𝑥) = 2𝑥 − 3
(𝑓𝑥) = 𝑓(𝑦)
2𝑥 − 3 = 2𝑦 − 3
𝑥=𝑦
∴ 𝐼𝑡 𝑖𝑠 𝑛𝑜𝑡 𝑜𝑛𝑒-𝑡𝑜-𝑜𝑛𝑒
Onto function :
𝐿𝑒𝑡 𝑦 = 2𝑥 − 3
2𝑥 − 3 = 𝑦
2𝑥 = 𝑦 + 3
𝑦+3
𝑥= 2
𝑦+3

in
𝑓(𝑥) = 2 ( )−3
2
=𝑦+3−3

s.
𝑓(𝑥) = 𝑦

es
∴ 𝐼𝑡 𝑖𝑠 𝑜𝑛𝑡𝑜 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛
𝐻𝑒𝑛𝑐𝑒 𝑓 𝑖𝑠 𝑏𝑖𝑗𝑒𝑐𝑡𝑖𝑜𝑛
Inverse of a function :
pr
𝑦+3
𝑓 −1 𝑦 =
2
ex

𝐵𝑦 𝑟𝑒𝑝𝑙𝑎𝑐𝑖𝑛𝑔 𝑦 𝑎𝑠 𝑥, 𝑤𝑒 𝑔𝑒𝑡
𝑥+3
𝑓 −1 𝑥 = 2
Method 2:
vi

𝑓(𝑥) = 2𝑥 − 3
𝐿𝑒𝑡 𝑦 = 2𝑥 − 3
l
ka

2𝑥 − 3 = 𝑦
2𝑥 = 𝑦 + 3
𝑦+3
𝑥= 2
w.

𝑦+3
𝑔(𝑦) =
2
ww

𝑔 ∘ 𝑓(𝑥) = 𝑔(𝑓(𝑥))
= 𝑔(2𝑥 − 3)
2𝑥−3+3
= 2
2𝑥
= 2
=𝑥
𝑔 ∘ 𝑓 = 𝐼𝑥
𝑓 ∘ 𝑔(𝑦) = 𝑓(𝑔(𝑦))
𝑦+3
= 𝑓( 2
)
𝑦+3
= 2( 2 )− 3
=𝑦+3−3
=𝑦
𝑓 ∘ 𝑔 = 𝐼𝑦
∴ 𝑓 𝑖𝑠 𝑎𝑛 𝑏𝑖𝑗𝑒𝑐𝑡𝑖𝑜𝑛 𝑎𝑛𝑑 𝑓 𝑎𝑛𝑑 𝑔 𝑎𝑟𝑒 𝑖𝑛𝑣𝑒𝑟𝑠𝑒 𝑡𝑜 𝑒𝑎𝑐ℎ 𝑜𝑡ℎ𝑒𝑟
𝑦+3
𝑔(𝑦) = 2
𝑦+3
𝑓 −1 𝑦 =
2

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-17

𝑅𝑒𝑝𝑙𝑎𝑐𝑒 𝑦 𝑏𝑦 𝑥
𝑥+3
𝑓 −1 𝑥 =
2

Exercise - 1.3
1. Suppose that 120 students are studying in 4 sections of eleventh standard in a school. Let A denote the set of
students and B denote the set of the sections. Define a relation from 𝑨 to 𝑩 as “𝒙 𝒓𝒆𝒍𝒂𝒕𝒆𝒅 𝒕𝒐 𝒚 𝒊𝒇 𝒕𝒉𝒆 𝒔𝒕𝒖𝒅𝒆𝒏𝒕
𝒙 𝒃𝒆𝒍𝒐𝒏𝒈𝒔 𝒕𝒐 𝒕𝒉𝒆 𝒔𝒆𝒄𝒕𝒊𝒐𝒏 𝒚”. Is this relation a function? What can you say
about the inverse relation? Explain your answer.
Solution:
Given : 𝐴 = 𝑠𝑒𝑡 𝑜𝑓 𝑎𝑙𝑙 𝑠𝑡𝑢𝑑𝑒𝑛𝑡𝑠
𝐵 = 𝑠𝑒𝑡 𝑜𝑓 𝑠𝑒𝑐𝑡𝑖𝑜𝑛𝑠
𝑅 ∶ 𝐴 → 𝐵 𝑥 𝑟𝑒𝑙𝑎𝑡𝑒𝑑 𝑡𝑜 𝑦 𝑖𝑓 𝑡ℎ𝑒 𝑠𝑡𝑢𝑑𝑒𝑛𝑡 𝑥 𝑏𝑒𝑙𝑜𝑛𝑔𝑠 𝑡𝑜 𝑡ℎ𝑒 𝑠𝑒𝑐𝑡𝑖𝑜𝑛 𝑦”

in
B B A
𝑓: 𝐴 → 𝐵
𝑓: 𝐵 → 𝐴
S1 S1

s.
A1 A1
S2 S2

es
S3 A2 A2 S3
S4 S4
. A3 A3 .
pr
.. .
. A4 .
A4 .
S120 S120
ex
vi

Yes. It is a function from 𝐴 → B The inverse relation is not a function.

Since each element in the domain has an unique image By the rule of function, every element of domain
l
ka

has more than one images in codomain.

𝟐. 𝑾𝒓𝒊𝒕𝒆 𝒕𝒉𝒆 𝒗𝒂𝒍𝒖𝒆𝒔 𝒐𝒇 𝒇 𝒂𝒕 − 𝟒, 𝟏, −𝟐, 𝟕, 𝟎 𝒊𝒇

w.

−𝒙 + 𝟒 if − ∞ < 𝒙 ≤ −𝟑
𝒙+𝟒 if − 𝟑 < 𝒙 < −𝟐
𝒇(𝒙) = 𝒙𝟐 − 𝒙
ww

if − 𝟐 ≤ 𝒙 < 𝟏
𝟐
𝒙−𝒙 if 𝟏 ≤ 𝒙 < 𝟕
{𝟎 otherwise
Solution:
−𝑥 + 4 if − ∞ < 𝑥 ≤ −3 (… . −5, −4, −3)
𝑥+4 if − 3 < 𝑥 < −2
𝑓(𝑥) = 𝑥 2 − 𝑥 if − 2 ≤ 𝑥 < 1 (−2, −1, 0)
2
𝑥−𝑥 if 1 ≤ 𝑥 < 7 (1, 2, 3, 4, 5, 6)
{0 otherwise

𝑊ℎ𝑒𝑛 𝑥 = −4 𝑊ℎ𝑒𝑛 𝑥 = 1 𝑊ℎ𝑒𝑛 𝑥 = −2 𝑊ℎ𝑒𝑛 𝑥 = 7 𝑊ℎ𝑒𝑛 𝑥 = 0

𝑓(𝑥) = −𝑥 + 4 𝑓(𝑥) = 𝑥 − 𝑥 2 𝑓(𝑥) = 𝑥 2 − 𝑥 𝑓(𝑥) = 0 𝑓(𝑥) = 𝑥 2 − 𝑥
𝑓(−4) = −(−4) + 4 𝑓(1) = 1 − 12 𝑓(2) = (−2)2 − (−2) 𝑓(7) = 0 𝑓(0) = 02 − 0
=4+4 =1−1 =4+2 𝑓(0) = 0
𝑓(−4) = 8 𝑓(1) = 0 𝑓(2) = 6

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-18

𝟑. 𝑾𝒓𝒊𝒕𝒆 𝒕𝒉𝒆 𝒗𝒂𝒍𝒖𝒆𝒔 𝒐𝒇 𝒇 𝒂𝒕 − 𝟑, 𝟓, 𝟐, −𝟏, 𝟎 𝒊𝒇

𝒙𝟐 + 𝒙 − 𝟓 if 𝒙 ∈ (−∞, 𝟎)
𝟐
𝒙 + 𝟑𝒙 − 𝟐 if 𝒙 ∈ (𝟑, ∞)
𝒇(𝒙) =
𝒙𝟐 if 𝒙 ∈ (𝟎, 𝟐)
𝟐
{ 𝒙 − 𝟑 otherwise
Solution :
𝑥2 + 𝑥 − 5 if 𝑥 ∈ (−∞, 0) (… − 4, −3, −2, −1)
2
𝑥 + 3𝑥 − 2 if 𝑥 ∈ (3, ∞) (4, 5, 6, … . ∞)
𝑓(𝑥) =
𝑥2 if 𝑥 ∈ (0,2) (1)
2
{𝑥 − 3 otherwise (0, 2, 3)

𝑊ℎ𝑒𝑛 𝑥 = −3 𝑊ℎ𝑒𝑛 𝑥 = 5
𝑓(𝑥) = 𝑥 2 + 𝑥 − 5 𝑓(𝑥) = 𝑥 2 + 3𝑥 − 2
𝑓(−3) = (−3)2 + (−3) − 5 𝑓(5) = (5)2 + 3(5) − 2
=9−3−5 = 25 + 15 − 2
𝑓(−3) = 1

in
𝑓(5) = 38

s.
𝑊ℎ𝑒𝑛 𝑥 = 2 𝑊ℎ𝑒𝑛 𝑥 = −1 𝑊ℎ𝑒𝑛 𝑥 = 0

es
𝑓(𝑥) = 𝑥 2 − 3 𝑓(𝑥) = 𝑥 2 + 𝑥 − 5 𝑓(𝑥) = 𝑥 2 − 3
𝑓(2) = 22 − 3 𝑓(−1) = (−1)2 + (−1) − 5 𝑓(0) = 02 − 3
=4−3 =1−1−5 =0−3
pr
𝑓(2) = 1 𝑓(−1) = −5 𝑓(2) = −3
ex

𝟏𝟐. 𝑰𝒇 𝒇: ℝ → ℝ 𝒊𝒔 𝒅𝒆𝒇𝒊𝒏𝒆𝒅 𝒃𝒚 𝒇(𝒙) = 𝟑𝒙 − 𝟓, 𝒑𝒓𝒐𝒗𝒆 𝒕𝒉𝒂𝒕 𝒇 𝒊𝒔 𝒂 𝒃𝒊𝒋𝒆𝒄𝒕𝒊𝒐𝒏 𝒂𝒏𝒅 𝒇𝒊𝒏𝒅 𝒊𝒕𝒔 𝒊𝒏𝒗𝒆𝒓𝒔𝒆.
Solution:
vi

𝑓(𝑥) = 3𝑥 − 5
𝐿𝑒𝑡 𝑦 = 3𝑥 − 5
l
ka

3𝑥 − 5 = 𝑦
3𝑥 = 𝑦 + 5
𝑦+5
𝑥=
w.

3
𝑦+5
𝑔(𝑦) = 3
ww

𝑔 ∘ 𝑓(𝑥) = 𝑔(𝑓(𝑥))
= 𝑔(3𝑥 − 5)
3𝑥−5+5
= 3
3𝑥
= 3
=𝑥
𝑔 ∘ 𝑓 = 𝐼𝑥
𝑓 ∘ 𝑔(𝑦) = 𝑓(𝑔(𝑦))
𝑦+5
= 𝑓( 3
)
𝑦+5
= 3( 3 )− 5
=𝑦+5−5
=𝑦
𝑓 ∘ 𝑔 = 𝐼𝑦
∴ 𝐼𝑡 𝑖𝑠 𝑎𝑛 𝑏𝑖𝑗𝑒𝑐𝑡𝑖𝑜𝑛
𝑦+3
𝑔(𝑦) = 2
𝑦+5
𝑓 −1 𝑦 =
3

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-19

𝑅𝑒𝑝𝑙𝑎𝑐𝑒 𝑦 𝑏𝑦 𝑥
𝑥+5
𝑓 −1 𝑥 =
3

15. The total cost of airfare on a given route is comprised of the base cost 𝑪 and the fuel surcharge 𝑺 in rupee.
Both 𝑪 and 𝑺 are functions of the mileage 𝒎; 𝑪(𝒎) = 𝟎. 𝟒𝒎 + 𝟓𝟎 and 𝑺(𝒎) = 𝟎. 𝟎𝟑𝒎. Determine a function for
the total cost of a ticket in terms of the mileage and find the airfare for flying 1600 miles.
Solution:
Given:
𝐶(𝑚) = 0.4𝑚 + 50
𝑆(𝑚) = 0.03𝑚
𝑇𝑜𝑡𝑎𝑙 𝐶𝑜𝑠𝑡 𝑇(𝑚) = 𝐶(𝑚) + 𝑆(𝑚)
= 0.4𝑚 + 50 + 0.03𝑚
= 0.43𝑚 + 50
Given m=1600 miles
𝑇(1600) = 0.43(1600) + 50

in
= 688 + 50
𝑇(1600) = 738

s.
𝐴𝑖𝑟𝑓𝑎𝑟𝑒 = ₹738

es
16. A salesperson whose annual earnings can be represented by the function 𝑨(𝒙) = 𝟑𝟎, 𝟎𝟎𝟎 + 𝟎. 𝟎𝟒𝒙, where 𝒙 is
the rupee value of the merchandise he sells. His son is also in sales and his earnings are represented by the
function 𝑺(𝒙) = 𝟐𝟓, 𝟎𝟎𝟎 + 𝟎. 𝟎𝟓𝒙. Find (𝑨 + 𝑺)(𝒙) and determine the total family income if they each sell
pr
Rupees 𝟏, 𝟓𝟎, 𝟎𝟎, 𝟎𝟎𝟎 worth of merchandise.
Solution:
ex

Given:
𝐴(𝑥) = 30, 000 + 0.04𝑥
𝑆(𝑥) = 25, 000 + 0.05𝑥
vi

𝐴 + 𝑆(𝑥) = 𝐴(𝑥) + 𝑆(𝑥)

= 30, 000 + 0.04𝑥 + 25, 000 + 0.05𝑥
l
ka

𝐴 + 𝑆(𝑥) = 55,000 + 0.09𝑥

When 𝑥 = 1,50, 00, 000

w.

𝐴 + 𝑆(1,50, 00, 000) = 55,000 + 0.09(1,50, 00, 000)

= 55,000 + 13,50,000
ww

= 14,05,000
𝑇𝑜𝑡𝑎𝑙 𝑓𝑎𝑚𝑖𝑙𝑦 𝑖𝑛𝑐𝑜𝑚𝑒 = ₹14,05,000

17. The function for exchanging American dollars for Singapore Dollar on a given day is 𝒇(𝒙) = 𝟏. 𝟐𝟑𝒙, where 𝒙
represents the number of American dollars. On the same day the function for exchanging Singapore Dollar to
Indian Rupee is 𝒈(𝒚) = 𝟓𝟎. 𝟓𝟎𝒚, where 𝒚 represents the number of Singapore dollars. Write a function which will
give the exchange rate of American dollars in terms of Indian rupee.
Solution:
Given:
𝑓(𝑥)=1.23𝑥 𝑔(𝑦)=50.5𝑦
American dollars→ Singapore dollar → Indian Rupee
𝑔∘𝑓(𝑥)
American dollars→ Indian Rupee
𝑔 ∘ 𝑓(𝑥) = 𝑔[𝑓(𝑥)]
= 𝑔[1.23𝑥]
= 50.50𝑥 × 1.23
𝑔 ∘ 𝑓(𝑥) = 62.115𝑥
The function of exchange rate of American dollars in terms of Indian rupee is 𝑔 ∘ 𝑓(𝑥) = 62.115𝑥

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-20

18. The owner of a small restaurant can prepare a particular meal at a cost of Rupees 𝟏𝟎𝟎. He estimates that if the
menu price of the meal is 𝒙 rupees, then the number of customers who will order that meal at that price in an
evening is given by the function 𝑫(𝒙) = 𝟐𝟎𝟎 − 𝒙. Express his day revenue, total cost and profit on this meal as
functions of 𝒙.
Solution:
Given: Cost price of one meal = ₹100
Selling price of one meal = ₹ 𝑥
Number of customers 𝐷(𝑥) = 200 − 𝑥.
𝐷𝑎𝑦 𝑟𝑒𝑣𝑒𝑛𝑢𝑒 = (200 − 𝑥)𝑥
𝑇𝑜𝑡𝑎𝑙 𝑐𝑜𝑠𝑡 = (200 − 𝑥)100
𝑃𝑟𝑜𝑓𝑖𝑡 = 𝐷𝑎𝑦 𝑅𝑒𝑣𝑒𝑛𝑢𝑒 – 𝑇𝑜𝑡𝑎𝑙 𝑐𝑜𝑠𝑡
= (200 − 𝑥)𝑥 − (200 − 𝑥)100
= (200 − 𝑥)(𝑥 − 100)

𝟓𝒙 𝟏𝟔𝟎
19. The formula for converting from Fahrenheit to Celsius temperatures is 𝒚 = 𝟗
− 𝟗
Find the inverse of this

in
function and determine whether the inverse is also a function.
Solution:

s.
Given:
5𝑥 160
𝑦= − 9 = 𝑓(𝑥)

es
9
5𝑥−160
𝑦= 9
9𝑦 = 5𝑥 − 160
pr
5𝑥 = 9𝑦 + 160
9𝑦+160
𝑥=
ex

5
9𝑦+160
𝑔(𝑦) =
5
−1
𝑔=𝑓
vi

9𝑥+160
𝑓 −1 (𝑥) = 5
9𝑥
l

−1 (𝑥)
𝑓 = + 32
ka

5
𝑓 ∘ 𝑔(𝑦) = 𝑓(𝑔(𝑦))
9𝑦+160
= 𝑓( )
w.

5
9𝑦+160
5( )−160
5
= 9
ww

9𝑦+160−160
= 9
9𝑦
= 9
𝑓 ∘ 𝑔(𝑦) = 𝑦 = 𝐼𝑦

𝑔 ∘ 𝑓(𝑥) = 𝑔(𝑓(𝑥))
5𝑥−160
= 𝑔( 9
)
5𝑥−160
9( )+160
9
= 5
5𝑥−160+160
= 5
5𝑥
= 5
𝑔 ∘ 𝑓(𝑥) = 𝑥 = 𝐼𝑥
𝐻𝑒𝑛𝑐𝑒 𝑓 𝑎𝑛𝑑 𝑔 𝑎𝑟𝑒 𝑏𝑖𝑗𝑒𝑐𝑡𝑖𝑜𝑛 𝑎𝑛𝑑 𝑖𝑛𝑣𝑒𝑟𝑠𝑒 𝑡𝑜 𝑒𝑎𝑐ℎ 𝑜𝑡ℎ𝑒𝑟.
9𝑥
𝑓 −1 (𝑥) = 5 + 32

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com

www.kalviexpress.in www.kalviexpress.in
Pg-21

20. A simple cipher takes a number and codes it, using the function 𝒇(𝒙) = 𝟑𝒙 − 𝟒. Find the inverse of this
function, determine whether the inverse is also a function and verify the symmetrical property about the line
𝒚 = 𝒙 (by drawing the lines).
Solution:
Given:
𝑓(𝑥) = 3𝑥 − 4
𝑦 = 3𝑥 − 4
3𝑥 = 𝑦 + 4
𝑦+4
𝑥=
3
𝑦+4
𝑔(𝑦) = 3
−1
𝑔=𝑓
𝑥+4
𝑓 −1 (𝑥) = 3
𝑓 ∘ 𝑔(𝑦) = 𝑓(𝑔(𝑦))
𝑦+4
= 𝑓( 3
)

in
𝑦+4
= 3( 3 ) −4
= 𝑦+4−4

s.
𝑓 ∘ 𝑔(𝑦) = 𝑦 = 𝐼𝑦

𝑔 ∘ 𝑓(𝑥) = 𝑔(𝑓(𝑥))
= 𝑔(3𝑥 − 4) es
pr
(3𝑥−4)+4
= 3
3𝑥
ex

= 3
𝑔 ∘ 𝑓(𝑥) = 𝑥 = 𝐼𝑥
𝐻𝑒𝑛𝑐𝑒 𝑓 𝑎𝑛𝑑 𝑔 𝑎𝑟𝑒 𝑏𝑖𝑗𝑒𝑐𝑡𝑖𝑜𝑛 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛 𝑎𝑛𝑑 𝑖𝑛𝑣𝑒𝑟𝑠𝑒 𝑡𝑜 𝑒𝑎𝑐ℎ 𝑜𝑡ℎ𝑒𝑟.
vi

𝑓(𝑥) = 3𝑥 − 4
l
ka

𝑥 −1 1
𝑓(𝑥) −7 −1
−1 (𝑥) 𝑥+4 8
𝑓 =
w.

3 7
𝑥 −1 2 6
𝑓 −1 (𝑥) 1 2 5
ww

4
3
2
𝑦=𝑥 1
0
𝑥 −1 1 -8 -7 -6 -5 -4 -3 -2 -1-1 0 1 2 3 4 5 6 7 8
𝑦 −1 1 -2
-3
-4
-5
-6
-7
-8

𝐻𝑒𝑛𝑐𝑒 𝑡ℎ𝑒 𝑑𝑖𝑎𝑔𝑟𝑎𝑚 𝑠𝑎𝑡𝑖𝑠𝑓𝑖𝑒𝑠 𝑡ℎ𝑒 𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑖𝑐𝑎𝑙 𝑝𝑟𝑜𝑝𝑒𝑟𝑡𝑦 𝑎𝑏𝑜𝑢𝑡 𝑡ℎ𝑒 𝑙𝑖𝑛𝑒 𝑦 = 𝑥

Send Your Material &Question Answer Our Email ID -kalviexpress@gmail.com