ANSWERS TO QUESTION FOR REVISION

CLASS XII : MATHEMATICS

TOPICS: RELATIONS, FUNCTIONS

PREPARED BY
M SRINIVASAN, PGT(MATHS), KVS
1. Let a finite set A containing 𝒏 elements. The number of reflexive relations on set A is
given by
𝟐 𝟐 −𝒏 𝟐 +𝒏
a) 𝟐𝒏 b) 𝟐 𝒏 c) 𝟐 𝒏 d) 𝟐 𝒏

Let the relation has ordered pair (𝒂 , 𝒃)

The element ‘a’ can be chosen in ‘n’ ways and ‘b’ can be chosen in ‘n’ ways
The set of ordered pairs comprises n2 pairs.
These pair includes the ordered pair (𝒂, 𝒂) also
There are 𝒏 pair of (𝒂, 𝒂)
𝟐
The number of ordered pairs = 𝒏 − 𝒏
𝒏𝟐 −𝒏
Number of reflexive relations = 𝟐
𝒏𝟐 −𝒏
c) 𝟐
2. The relation R on the set A = {1, 2, 3} is defined as {(1 , 2), (2 , 1), (3 , 3)} is
a) Symmetric and Transitive but not reflexive
b) reflexive, symmetric, not transitive
c) symmetric, not reflexive, not transitive
d) an equivalence relation
R = {(1 , 2), (2 , 1), (3 , 3)}
Reflexive (1,1) R R is not Reflexive

Symmetric (1,2) R, (2,1)R R is Symmetric

Transitive (1,2) R, (2,1)R. But (1 , 1)R

R is not Transitive
c) symmetric, not reflexive, not transitive
3.The function 𝒇: 𝑹 → 𝑹 given by 𝒇 𝒙 = 𝟒 + 𝟑 𝒔𝒊𝒏 𝒙 is
a) bijective b) one-one but not onto
c) not one-one but onto d) neither one-one nor onto
𝒇 𝒙 = 𝟒 + 𝟑 𝒔𝒊𝒏 𝒙
To check one-one
For 𝒙 = 𝟎 , 𝝅
𝒇 𝟎 = 𝟒 + 𝟑 𝐬𝐢𝐧 𝟎 = 𝟒 𝒇 𝝅 = 𝟒 + 𝟑 𝐬𝐢𝐧 𝝅 = 𝟒

𝟎 ≠ 𝝅, 𝒃𝒖𝒕 𝒇 𝟎 = 𝒇(𝝅)
𝒇(𝒙) is not one-one
To check onto
𝒇 𝒙 = 𝟒 + 𝟑 𝒔𝒊𝒏 𝒙

−𝟏 ≤ 𝐬𝐢𝐧 𝒙 ≤ 𝟏
−𝟑 ≤ 𝟑𝐬𝐢𝐧 𝒙 ≤ 𝟑
𝟑 ≤ 𝟒 + 𝟑𝐬𝐢𝐧 𝒙 ≤ 𝟕 Range of 𝒇(𝒙) = [𝟑 𝟕] ≠ 𝑹
𝒇(𝒙) is not onto

d) neither one-one nor onto

𝒇 𝒙 = 𝟒 + 𝟑 𝒔𝒊𝒏𝒙 is neither one-one nor onto
4. 𝒔𝒊𝒏 𝒄𝒐𝒕−𝟏 𝒙 is equal to
𝟑
𝟏 −𝟐
a) 𝟏 + 𝒙𝟐 b) 𝒙 c) d) 𝟏 +𝒙𝟐
𝟏+𝒙𝟐
𝒚 = 𝒔𝒊𝒏 𝒄𝒐𝒕−𝟏 𝒙
𝑳𝒆𝒕 = 𝒄𝒐𝒕−𝟏 𝒙 𝒚 = 𝒔𝒊𝒏
⟹ 𝒙 = 𝐜𝐨𝐭 
𝟏 𝟏 𝟏
𝐬𝐢𝐧 𝜽 = ⟹ 𝐬𝐢𝐧 𝜽 = ⟹ 𝐬𝐢𝐧 𝜽 =
𝒄𝒐𝒔𝒆𝒄 𝜽 𝟏 + 𝒄𝒐𝒕𝟐 𝜽 𝟏 + 𝒙𝟐
𝟏
𝒚 = 𝒔𝒊𝒏 =
𝟏 + 𝒙𝟐
𝟏
c)
𝟏+𝒙𝟐
5. The domain of the function 𝒔𝒊𝒏−𝟏 𝒙 − 𝟏 is
a) [1 2] b) [0 1] c) [−𝟏 1] d) [0 2]
𝒇 𝒙 = 𝒔𝒊𝒏−𝟏 𝒙−𝟏
Domain of 𝒇 𝒙 = 𝒔𝒊𝒏−𝟏 𝒙 is [−𝟏 𝟏]
𝟏 − 𝒙 ≥ 𝟎 and −𝟏 ≤ 𝒙 − 𝟏 ≤ 𝟏
⟹𝟎≤ 𝒙−𝟏≤𝟏
⟹𝟎≤𝒙−𝟏≤𝟏
⟹𝟏≤𝒙≤𝟐 𝒙 ∈ [𝟏 𝟐]

a) [1 2]
The domain of the function 𝒔𝒊𝒏−𝟏 𝒙 − 𝟏 is [1 2]
 𝒙
6. Assertion : 𝒇 𝒙 = is a bijection
𝒙
Reason : A function 𝒇(𝒙) is a bijection is if it one-one and onto
𝒙
𝒙 ,𝒙 > 𝟎 𝒙 𝟏, 𝒙 > 𝟎
𝒇 𝒙 = = 𝒙 𝒙 =ቊ
Assertion 𝒙 𝒙 −𝟏, 𝒙 < 𝟎
,𝒙 < 𝟎
−𝒙
For 𝒙 = 𝟏, 𝟐 𝒇 𝟏 = 𝟏 ;𝒇 𝟐 = 𝟏
𝟏 ≠ 𝟐 𝒃𝒖𝒕 𝒇 𝟏 = 𝒇(𝟐) 𝒇(𝒙) is not one-one
⟹ 𝒇(𝒙) is not a bijection Assertion is False
Reason A function 𝒇(𝒙) is a bijection is if it one-one and onto

Reason is True
d) A is False but R is True
 𝟐
7. Assertion : Maximum value of −𝟏
𝒄𝒐𝒔 𝒙 is 𝝅 𝟐

𝝅 𝝅
Reason : Range of the Principal value branch of 𝒄𝒐𝒔−𝟏 𝒙 is −
𝟐 𝟐

Assertion Principal value of 𝒄𝒐𝒔−𝟏 𝒙 is [𝟎 𝝅]

−𝟏
𝟎 ≤ 𝒄𝒐𝒔 𝒙≤𝝅
−𝟏 𝟐 𝟐
𝟎 ≤ 𝒄𝒐𝒔 𝒙 ≤ 𝝅
𝟐
Maximum value of 𝒄𝒐𝒔 −𝟏
𝒙 is 𝝅 𝟐 Assertion is True
Reason Range of Principal value branch of 𝐜𝐨𝐬 −𝟏 𝒙 is [0 ]
Reason is False
c) A is True but R is False
 𝟐
Maximum value of 𝒄𝒐𝒔
−𝟏
𝒙 is 𝝅 𝟐
8. Show that 𝒇: 𝑵 → 𝑵, given by 𝒇(𝟏) = 𝒇(𝟐) = 𝟏 and 𝒇(𝒙) = 𝒙 – 𝟏 for
every 𝒙 > 𝟐 is onto but not one-one.
To check one-one
For 1, 2 N, 𝒇(𝟏) = 𝒇(𝟐) = 𝟏
1  2, but 𝒇(𝟏) = 𝒇(𝟐) = 𝟏
𝒇(𝒙) is not one-one
To check onto
Given 𝒇(𝟏) = 𝒇(𝟐) = 𝟏 and 𝒇(𝒙) = 𝒙 – 𝟏 for every 𝒙 > 𝟐
For every 𝒙 ∈ 𝑵(𝑪𝒐𝒅𝒐𝒎𝒂𝒊𝒏) there exist pre-image in N (Domain)
𝒇(𝒙) is onto
9. Find the domain of the function 𝒇 𝒙 = 𝒔𝒊𝒏 −𝟏 −𝒙𝟐
𝒇 𝒙 = 𝒔𝒊𝒏 −𝟏 −𝒙𝟐
Domain of 𝒔𝒊𝒏−𝟏 𝒙 is [-1 1]
𝟐
⟹ −𝟏 ≤ −𝒙 ≤ 𝟏
⟹ 𝟏 ≥ 𝒙𝟐 ≥ −𝟏
⟹ 𝟎 ≤ 𝒙𝟐 ≤ 𝟏 ⟹ 𝒙𝟐 − 𝟏 ≤ 𝟎
⟹ (𝒙 + 𝟏)(𝒙 − 𝟏) ≤ 𝟎
⟹ −𝟏 ≤ 𝒙 ≤ 𝟏
The domain of the function 𝒇 𝒙 = 𝒔𝒊𝒏 −𝟏 −𝒙𝟐 is [-1 1]
The domain of the function 𝒇 𝒙 = 𝒔𝒊𝒏 −𝟏 −𝒙𝟐 is [-1 1]
10. Let 𝒇: 𝑵 – {𝟏} → 𝑵 defined by 𝒇 𝒏 = 𝒕𝒉𝒆 𝒉𝒊𝒈𝒉𝒆𝒕 𝒑𝒓𝒊𝒎𝒆 𝒇𝒂𝒄𝒕𝒐𝒓 𝒐𝒇 𝒏.
Show that 𝒇(𝒙) is neither one nor onto
To check one-one
Consider 4 , 6  𝑵 – {𝟏}
𝒇 𝟒 = 𝒕𝒉𝒆 𝒉𝒊𝒈𝒉𝒆𝒕 𝒑𝒓𝒊𝒎𝒆 𝒇𝒂𝒄𝒕𝒐𝒓 𝒐𝒇 𝟒 = 𝟐
𝒇 𝟔 = 𝒕𝒉𝒆 𝒉𝒊𝒈𝒉𝒆𝒕 𝒑𝒓𝒊𝒎𝒆 𝒇𝒂𝒄𝒕𝒐𝒓 𝒐𝒇 𝟔 = 𝟐
4  6, but 𝒇(𝟒) = 𝒇(𝟔) = 𝟐
𝒇(𝒙) is not one-one
To check onto
𝒇: 𝑵 – {𝟏} → 𝑵 defined by 𝒇 𝒏 = 𝒕𝒉𝒆 𝒉𝒊𝒈𝒉𝒆𝒕 𝒑𝒓𝒊𝒎𝒆 𝒇𝒂𝒄𝒕𝒐𝒓 𝒐𝒇 𝒏

Range of 𝒇(𝒙) = Set of Prime Numbers

Non-prime Numbers in N(codomain) will not have pre-image
Range of 𝒇(𝒙)  N (Codomain)
𝒇(𝒙) is not onto
𝒇: 𝑵 – {𝟏} → 𝑵 defined by 𝒇 𝒏 = 𝒕𝒉𝒆 𝒉𝒊𝒈𝒉𝒆𝒕 𝒑𝒓𝒊𝒎𝒆 𝒇𝒂𝒄𝒕𝒐𝒓 𝒐𝒇 𝒏
is neither one-one nor onto
11. Let 𝒇: 𝑿 → 𝒀 be a function. Define a relation on A by
𝑹 = {(𝒂 , 𝒃) ∶ 𝒇(𝒂) = 𝒇(𝒃)}. Show that R is an equivalence relation.
Reflexive
For 𝒂 ∈ 𝑿, 𝒂, 𝒂 ∈ 𝑹 ⟹ 𝒇 𝒂 = 𝒇(𝒂)
R is Reflexive

Symmetric For 𝒂, 𝒃 ∈ 𝑿
𝒂, 𝒃 ∈ 𝑹 ⟹ 𝒇 𝒂 = 𝒇(𝒃)
𝒃, 𝒂 ∈ 𝑹 ⟹ 𝒇 𝒃 = 𝒇(𝒂)
R is Symmetric
Transitive
For 𝒂, 𝒃, 𝒄 ∈ 𝑿
Let 𝒂, 𝒃 ∈ 𝑹 ⟹ 𝒇 𝒂 = 𝒇(𝒃)
Let 𝒃, 𝒄 ∈ 𝑹 ⟹ 𝒇 𝒃 = 𝒇(𝒄)
⟹ 𝒇 𝒂 = 𝒇(𝒄)
⟹ 𝒂, 𝒄 ∈ 𝑹
R is Transitive
R is Reflexive, Symmetric and Transitive

R is an equivalence relation
 𝟑𝝅
12. Evaluate: 𝒔𝒊𝒏−𝟏 𝒔𝒊𝒏 + 𝒄𝒐𝒔−𝟏 𝒄𝒐𝒔𝝅 + 𝒕𝒂𝒏−𝟏 𝟏
𝟒
𝟑𝝅
𝒔𝒊𝒏−𝟏 𝒔𝒊𝒏 + 𝒄𝒐𝒔−𝟏 𝒄𝒐𝒔𝝅 + 𝒕𝒂𝒏−𝟏 𝟏
𝟒
𝝅
= 𝒔𝒊𝒏−𝟏 𝒔𝒊𝒏 𝝅 − + 𝒄𝒐𝒔−𝟏 −𝟏 + 𝒕𝒂𝒏−𝟏 𝟏 𝒄𝒐𝒔−𝟏 −𝒙 = 𝝅 − 𝒄𝒐𝒔−𝟏 𝒙
𝟒
−𝟏
𝝅
= 𝒔𝒊𝒏 𝒔𝒊𝒏 + 𝝅 − 𝒄𝒐𝒔−𝟏 𝟏 + 𝒕𝒂𝒏−𝟏 𝟏
𝟒
𝝅 𝝅
= +𝝅+𝟎+
𝟒 𝟒
𝝅
= +𝝅
𝟐
𝟑𝝅
=
𝟐
 13. Let N denote the set of all natural numbers and R be the relation on N  N
defined by 𝒂 , 𝒃 𝑹 𝒄 , 𝒅 𝒊𝒇 𝒂𝒅 𝒃 + 𝒄 = 𝒃𝒄 𝒂 + 𝒅 . Show that R is an
equivalence relation
Reflexive Relation Let (𝐚, 𝐛) ∈ N
Assume (𝐚, 𝐛)𝑹 (𝐚, 𝐛) ⟹ 𝒂𝒃 𝒃 + 𝒂 = 𝒃𝒂 𝒂 + 𝒃 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒂, 𝒃 ∈ 𝑵
As the statement is true, (𝐚, 𝐛)𝑹 𝐚, 𝐛 . Hence R is Reflexive
Symmetric Relation Let 𝐚, 𝐛 , (𝒄 , 𝒅) ∈ N ∈ N
Let (𝐚, 𝐛)𝑹 (𝐜, 𝐝)
⟹ 𝒂𝒅 𝒃 + 𝒄 = 𝒃𝒄 𝒂 + 𝒅 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒂, 𝒃, 𝒄, 𝒅 ∈ 𝑵
⟹ 𝒃𝒄 𝒂 + 𝒅 = 𝒂𝒅 𝒃 + 𝒄 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒂, 𝒃, 𝒄, 𝒅 ∈ 𝑵
⟹ 𝒄𝒃 𝒅 + 𝒂 = 𝒅𝒂 𝒄 + 𝒃 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒂, 𝒃, 𝒄, 𝒅 ∈𝑵
⟹ (𝐜, 𝐝)𝑹 (𝐚, 𝐛) Hence R is Symmetric
Transitive Relation Let 𝐚, 𝐛 , 𝒄 , 𝒅 , (𝒆, 𝒇) ∈ N ∈ N
Let (𝒂, 𝒃)𝑹 (𝐜, 𝐝) and (𝐜, 𝐝)𝑹 (𝐞, 𝒇)
𝒂𝒅 𝒃 + 𝒄 = 𝒃𝒄 𝒂 + 𝒅 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒂, 𝒃, 𝒄, 𝒅 ∈ 𝑵
𝒃+𝒄 𝒂+𝒅 𝟏 𝟏 𝟏 𝟏
⟹ = ⟹ + = +
𝒃𝒄 𝒂𝒅 𝒄 𝒃 𝒅 𝒂

𝒄𝒇 𝒅 + 𝒆 = 𝒅𝒆 𝒄 + 𝒇 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒄, 𝒅, 𝒆, 𝒇 ∈ 𝑵
𝒅+𝒆 𝒄+𝒇
⟹ =
𝒅𝒆 𝒄𝒇
𝟏 𝟏 𝟏 𝟏
⟹ + = +
𝒆 𝒅 𝒇 𝒄
 𝟏 𝟏 𝟏 𝟏
+ = +
𝒄 𝒃 𝒅 𝒂
𝟏 𝟏 𝟏 𝟏
+ = +
𝒆 𝒅 𝒇 𝒄
𝟏 𝟏 𝟏 𝟏 𝟏 𝟏 𝟏 𝟏
Adding we get + + + = + + +
𝒄 𝒃 𝒆 𝒅 𝒅 𝒂 𝒇 𝒄
𝟏 𝟏 𝟏 𝟏 𝒃+𝒆 𝒂+𝒇
⟹ + = + ⟹ =
𝒃 𝒆 𝒂 𝒇 𝒃𝒆 𝒂𝒇
⟹ 𝒂𝒇 𝒃 + 𝒆 = 𝒃𝒆(𝒂 + 𝒇)
⟹ (𝒂, 𝒃)𝑹 (𝐞, 𝐟) Hence R is Transitive
Relation R on N  N defined by 𝒂 , 𝒃 𝑹 𝒄 , 𝒅 𝒊𝒇 𝒂𝒅 𝒃 + 𝒄 = 𝒃𝒄 𝒂 + 𝒅
is an equivalence relation
 𝒙
14. Show that the function 𝒇: −∞ 𝟎 ⟶ −𝟏 𝟎 defined by 𝒇 𝒙 = is a
𝟏+ 𝒙
bijection.
To check one-one
Let 𝒙𝟏 , 𝒙𝟐 ∈ −∞ 𝟎 𝒙𝟏 = − 𝒙𝟏 𝒙𝟐 = − 𝒙𝟐
Assume 𝒇 𝒙𝟏 = 𝒇 𝒙𝟐
𝒙𝟏 𝒙𝟐
=
𝟏 + 𝒙𝟏 𝟏 + 𝒙𝟐
𝒙𝟏 𝒙𝟐
=
𝟏 − 𝒙𝟏 𝟏 − 𝒙𝟐
𝒙𝟏 − 𝒙𝟏 𝒙𝟐 = 𝒙𝟐 − 𝒙𝟏 𝒙𝟐 ⟹ 𝒙𝟏 = 𝒙𝟐
𝒇(𝒙) is one-one
To check onto
Let 𝒚 ∈ −𝟏 𝟎 (Codomain)
Assume 𝒚 = 𝒇(𝒙)
𝒙
𝒚= 𝒙 ∈ −∞ 𝟎
𝟏+ 𝒙
𝒙
𝒚=
𝟏−𝒙
⟹ 𝒚 − 𝒙𝒚 = 𝒙
⟹ 𝒙 + 𝒙𝒚 = 𝒚
⟹𝒙 𝟏+𝒚 =𝒚
𝒚
⟹𝒙=
𝟏+𝒚
 𝒚
𝒙=
𝟏+𝒚
For 𝒚 ∈ −𝟏 𝟎 , there exists 𝒙 ∈ −∞ 𝟎 such that
𝒚
𝒇 𝒙 =𝒇
𝟏+𝒚
𝒚 𝒚
𝟏+𝒚 𝟏+𝒚 𝒚
=
𝒚 = 𝒚 = 𝒇 𝒙 =𝒚
𝟏+
𝟏+𝒚
𝟏−
𝟏+𝒚
𝟏+𝒚−𝒚

𝒇(𝒙) is onto 𝒇(𝒙) is one-one and onto

𝒙
𝒇 𝒙 = is a bijection
𝟏+ 𝒙
 𝒙
𝒇 𝒙 = is a bijection
𝟏+ 𝒙
15. Student of class XII planned to plant saplings along straight lines, parallel to each
other to one side of the playground ensuing that they had enough play area. Let
us assume that they planted one of the rows of the saplings along the line
𝒚 = 𝒙 – 𝟒. Let L be the set of all lines which are parallel on the ground and R be
the relation on R.
a) Let the relation R be defined by 𝑹 = 𝑳𝟏 , 𝑳𝟐 , 𝑳𝟏 𝒑𝒂𝒓𝒂𝒍𝒍𝒆𝒍 𝒕𝒐 𝑳𝟐 . What is the type
of relation R?
Reflexive Let 𝑳𝟏 ∈ 𝑹
(L1, L1) ∈ R L1 is parallel to L1
Any line L1 is parallel to itself

R is Reflexive
Symmetric For (L1, L2) ∈ L
Let (L1, L2) ∈ R.
⇒ L1 is parallel to L2.
⇒ L2 is parallel to L1. ⇒ (L2, L1) ∈ R R is Symmetric
Transitive
For L1, L2, L3 ∈ R
Let (L1, L2)∈R ⇒ L1 is parallel to L2.
(L2, L3) ∈R  L2 is parallel to L3.
⇒ L1 is parallel to L3.
(L1, L3)∈R

R is Transitive
R is an equivalence relation
b) Let 𝑹 = 𝑳𝟏 , 𝑳𝟐 , 𝑳𝟏 𝒑𝒆𝒑𝒆𝒏𝒅𝒊𝒄𝒖𝒍𝒂𝒓 𝒕𝒐 𝑳𝟐 . What is the type of relation R?

Reflexive Relation Let 𝑳𝟏 ∈ L 𝑳𝟏 𝑹𝑳𝟏 ⇔ 𝑳𝟏 ⊥ 𝑳𝟏

As a line cannot be perpendicular to itself, R is not Reflexive

Symmetric Relation

Let 𝑳𝟏 , 𝑳𝟐 ∈ L and 𝑳𝟏 𝑹𝑳𝟐

𝑳𝟐
𝑳𝟏 𝑹𝑳𝟐 ⇔ 𝑳𝟏 ⊥ 𝑳𝟐

⟹ 𝑳𝟐 ⊥ 𝑳𝟏 ⟹ 𝑳𝟐 𝑹𝑳𝟏 𝑳𝟏
R is Symmetric
Transitive Relation

Let 𝑳𝟏 , 𝑳𝟐 , 𝑳𝟑 ∈ L and 𝑳𝟏 𝑹𝑳𝟐 , 𝑳𝟐 𝑹𝑳𝟑

𝑳𝟏 𝑹𝑳𝟐 ⇔ 𝑳𝟏 ⊥ 𝑳𝟐 𝑳𝟐 𝑹𝑳𝟑 ⇔ 𝑳𝟐 ⊥ 𝑳𝟑
𝑳𝟏 ⊥ 𝑳𝟐 and 𝑳 ⊥ 𝑳𝟑  𝑳𝟏 is parallel to 𝑳𝟑 𝑳𝟐
R is not Transitive 𝑳𝟑

𝑳𝟏

R is symmetric and not Reflexive , not Transitive

c) Check whether the function 𝒇: 𝑹 → 𝑹 defined by 𝒇 𝒙 = 𝒙 – 𝟒 is a bijection or not

To check one-one To check onto

Let 𝒙𝟏 , 𝒙𝟐 ∈ 𝑹 (𝒅𝒐𝒎𝒂𝒊𝒏) Let 𝒚 ∈ 𝑹 (𝒄𝒐𝒅𝒐𝒎𝒂𝒊𝒏)
Assume 𝒇 𝒙𝟏 = 𝒇 𝒙𝟐 L𝐞𝐭 𝒚 = 𝒇(𝒙)
𝒙𝟏 − 𝟒 = 𝒙𝟐 − 𝟒 𝒚=𝒙 −𝟒
𝒙𝟏 = 𝒙𝟐 𝒙=𝒚+𝟒
𝒇(𝒙) is one-one For all 𝒚 ∈ 𝑹, there exist 𝒚 ∈ 𝑹 such that 𝒚 = 𝒙 − 𝟒

𝒇(𝒙) is onto
𝒇: 𝑹 → 𝑹 defined by 𝒇 𝒙 = 𝒙 – 𝟒 is a bijection
c) Let 𝒇: 𝑹 → 𝑹 defined by 𝒇 𝒙 = 𝒙 + 𝟒. Show that 𝒇(𝒙) is one-one and find the range of 𝒇(𝒙)

To check one-one To find range

Let 𝒙𝟏 , 𝒙𝟐 ∈ 𝑹 (𝒅𝒐𝒎𝒂𝒊𝒏) Let 𝒚 ∈ 𝑹 (𝒄𝒐𝒅𝒐𝒎𝒂𝒊𝒏)
Assume 𝒇 𝒙𝟏 = 𝒇 𝒙𝟐 L𝐞𝐭 𝒚 = 𝒇(𝒙)
𝒙𝟏 + 𝟒 = 𝒙𝟐 + 𝟒 𝒚=𝒙+𝟒
𝒙𝟏 = 𝒙𝟐 𝒙=𝒚−𝟒
For all 𝒚 ∈ 𝑹, there exist 𝒚 ∈ 𝑹 such that 𝒚 = 𝒙 + 𝟒
𝒇(𝒙) is one-one
Range of 𝒇(𝒙) = R