Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

1.Check whether the relation 𝑆 in the set of all real number (ℝ) defined by 𝑆 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏 2 } is reflexive,
symmetric or transitive. Also, determine all 𝑥 ∈ ℝ such that (𝑥, 𝑥) ∈ 𝑆.

1 1 2
Sol. For reflexivity : Observe that 2 ≤ (2) is not true.
1 1
That is, (2 , 2) ∉ S.
So, S is not reflexive.
For symmetry: Observe that −1 ≤ (3)2 is true but 3 ≤ (−1)2 is not true.
That is, (−1,3) ∈ 𝑆 but (3, −1) ∉ S.
So, S is not symmetric.
For transitivity: Observe that 1 ≤ (−2)2 and −2 ≤ 02 are both true but 1 ≤ 02 is not true. That is, (1, −2) ∈ 𝑆
and (−2,0) ∈ 𝑆 but (1,0) ∉ 𝑆.
So, S is not transitive.
Now when (𝑥, 𝑥) ∈ 𝑆, then 𝑥 ≤ 𝑥 2 i.e., 𝑥 2 − 𝑥 ≥ 0 i.e., 𝑥(𝑥 − 1) ≥ 0.
Clearly, it is possible only when 𝑥 ≤ 0 or 𝑥 ≥ 1 i.e., when 𝑥 ∈ ℝ − (0,1).

2.Check whether the relation 𝑆 in the set of all real number (ℝ) defined by 𝑆 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏 3 } is reflexive,
symmetric or transitive.

1 1 3
Sol. For reflexivity : Observe that ≤ ( ) is not true.
2 2
1 1
That is, (2 , 2) ∉ S.
So, S is not reflexive.
For symmetry: Observe that −1 ≤ (3)3 is true but 3 ≤ (−1)3 is not true.
That is, (−1,3) ∈ 𝑆 but (3, −1) ∉ S.
So, 𝑆 is not symmetric.
3 3 3 4 3 4 3
For transitivity : Observe that 3 ≤ ( ) and ≤ ( ) are both true but 3 ≤ ( ) is not true.
2 2 3 3
3 3 4 4
That is, (3, 2) ∈ 𝑆 and (2 , 3) ∈ 𝑆 but (3, 3) ∉ 𝑆.
So, 𝑆 is not transitive.

3.Prove that the relation R in the set of integers Z defined as

R = {(a, b): 2 divides (a + b)} is an equivalence relation. Also, determine [3].

Sol. Since 𝑎 + 𝑎 = 2𝑎 is always divisible by 2 for all 𝑎 ∈ 𝑍. So, (𝑎, 𝑎) ∈ 𝑅. Therefore, 𝑅 is reflexive. Let
(𝑎, 𝑏) ∈ 𝑅 for all 𝑎, 𝑏 ∈ 𝑍. Then 2 divides (𝑎 + 𝑏).
It clearly means that 2 divides (𝑏 + 𝑎). That further implies that (𝑏, 𝑎) ∈ 𝑅.
Therefore, R is symmetric.
Let (𝑎, 𝑏) ∈ 𝑅 and (𝑏, 𝑐) ∈ 𝑅 for all 𝑎, 𝑏, 𝑐 ∈ 𝑍.
Now (a, b) ∈ R implies, 2 divides (a + b) i.e., either a and b both are even or odd integers. and; (b, c) ∈ R
implies, 2 divides (b + c) i.e., either b and c both are even or odd integers. When a is even, then c is even
implies that 2 divides (a + c) i.e., (a, c) ∈ R; when a is odd, then c is odd implies that 2 divides (𝑎 + 𝑐) i.e.,
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

(𝑎, 𝑐) ∈ 𝑅.
Therefore, R is transitive.
Hence, 𝑅 is equivalence relation as 𝑅 is reflexive, symmetric and transitive.
For the equivalence class [3], let (3, 𝑝) ∈ 𝑅 ∀𝑝 ∈ 𝑍.
That implies, 2 divides (3 + p).
Clearly, p±= 1 ± ,3 ± ,5, … i.e., p is an odd integer.
Hence, [3] ± {= 1 ± ,3 ± ,5, … }.

4.A relation 𝑅 defined on set 𝐴 = {𝑥: 𝑥 ∈ 𝑍 and 0 ≤ 𝑥 ≤ 10} as 𝑅 = {(𝑥, 𝑦): 𝑥 = 𝑦} is given to be an
equivalence relation. The number of equivalence classes is :
(A) 1 (B) 2 (C) 10 (D) 11

Explanation:The equivalence classes will be [0], [1], [2], [3], [4], [5], [6], [7], [8], [9] and [10].

5.Which of the following statements is not true about equivalence classes Ai (i = 1,2, … n) formed by an
equivalence relation R defined on a set A ?
(A) ⋃ni=1 Ai = A (B) 𝐀𝐢 ∩ 𝐀𝐣 ≠ 𝝓, 𝐢 ≠ 𝐣
(C) x ∈ Ai and x ∈ Aj ⇒ Ai = Aj (D) All elements of Ai are related to each other, for all i

6.Assertion (A) : The relation R = {(𝑥, y): (𝑥 + y) is a prime number and 𝑥, y ∈ N} is not a reflexive relation.

Reason (R): The number ' 2 n ' is composite for all natural numbers n .

(c) Since (𝑥 + 𝑥) = 2𝑥 is not always a prime number for 𝑥 ∈ 𝑁. So, (𝑥, 𝑥) ∉ 𝑅∀𝑥 ∈ 𝑁. Therefore, 𝑅 is not a
reflexive relation. That is, Assertion (A) is true.
Note that, a composite no. is a natural no. that has more than two factors (including 1 and itself). For n =
1 ∈ N, the number ' 2 n ' becomes ' 2 ' which is not a composite number. So, Reason (R) is false.

7.A relation R defined on a set of human beings as 𝑅 = {(𝑥, 𝑦): 𝑥 is 5 cm shorter than 𝑦} is :
(A) reflexive only (B) reflexive and transitive
(C) symmetric and transitive (D) neither transitive, nor symmetric, nor reflexive

8.A function f: ℝ → ℝ defined as f(𝑥) = 𝑥 2 − 4𝑥 + 5 is :

(A) injective but not surjective. (B) surjective but not injective.
(C) both injective and surjective. (D) neither injective nor surjective.

9.Also, 𝑓(𝑥) = (𝑥 − 2)2 + 1 ≥ 1∀𝑥 ∈ ℝ. That means, range of 𝑓 is [1, ∞).Since Range ≠ Codomain ( ℝ ) so,
f is not surjective. Let Z denote the set of integers, then function f: Z → Z defined as f(x) = x 3 − 1 is :
(A) both one-one and onto (B) one-one but not onto
(C) onto but not one-one (D) neither one-one nor onto
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

10.Let 𝑓: 𝑅+ → [−5, ∞) be defined as 𝑓(𝑥) = 9𝑥 2 + 6𝑥 − 5, where 𝑅+ is the set of all non-negative real
numbers. Then, 𝑓 is :

(A) one-one (B) onto (C) bijective (D) neither one-one nor onto

We hope, you can prove easily that the function is one-one and onto both.

11.Let 𝑅+ denote the set of all non-negative real numbers. Then the function 𝑓: 𝑅+ → 𝑅+ defined as 𝑓(𝑥) =
𝑥 2 + 1 is :
(A) one-one but not onto (B) onto but not one-one
(C) both one-one and onto (D) neither one-one nor onto
SOL:(a) The function f is one-one but not onto. Since range is [1, ∞) ≠ Codomain, so f is not onto. Also, 𝑓
is one-one as for all 𝑥1 , 𝑥2 ∈ 𝑅+ , we have 𝑓(𝑥1 ) = 𝑓(𝑥2 ) implying 𝑥1 = 𝑥2 .

12.A function 𝑓: 𝑅+ → 𝑅 (where 𝑅+ is the set of all non-negative real numbers) defined by 𝑓(𝑥) = 4𝑥 + 3 is :
(A) one-one but not onto (B) onto but not one-one
(C) both one-one and onto (D) neither one-one nor onto

Explanation:(a) Note that, 𝑓 is one-one as for all 𝑥1 , 𝑥2 ∈ 𝑅+ , 𝑓(𝑥1 ) = 𝑓(𝑥2 ) implies 𝑥1 = 𝑥2 .Also, when 𝑥 ∈
𝑅+ then 𝑓(𝑥) ≥ 3.That is, range ≠ codomain. Hence, 𝑓 is not onto.

13.A relation R on set A = {1,2,3,4,5} is defined as 𝑅 = {(𝑥, 𝑦): |𝑥 2 − 𝑦 2 | < 8}. Check whether the relation 𝑅
is reflexive, symmetric and transitive.
(a) Since |𝑥 2 − 𝑥 2 | = 0 < 8∀𝑥 ∈ 𝐴. That is, (𝑥, 𝑥) ∈ 𝑅 ∀𝑥 ∈ 𝐴.

Therefore, R is reflexive.
Let (x, y) ∈ R∀x, y ∈ A.
Then |𝑥 2 − 𝑦 2 | < 8 implies, |𝑦 2 − 𝑥 2 | < 8, which further implies (𝑦, 𝑥) ∈ 𝑅.
Therefore, R is symmetric.
Let 𝑥 = 2, 𝑦 = 3, 𝑧 = 4.
Note that, |22 − 32 | < 8 and |32 − 42 | < 8 are true i.e., (2,3) ∈ 𝑅 and (3,4) ∈ 𝑅.
But (2,4) ∉ 𝑅, as |22 − 42 | < 8 is false.
Therefore, R is not transitive.

14.A relation R is defined on N × N (where N is the set of natural numbers) as:(𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇔ 𝑎 − 𝑐 = 𝑏 − 𝑑
Show that R is an equivalence relation.

Sol: Let (a, b) be an arbitrary element of N × N i.e., (a, b) ∈ N × N where a, b ∈ N.As a − a = b − b ⇒

(a, b)R(a, b)∀(a, b) ∈ N × N.
Hence, R is reflexive.
Let (a, b) and (c, d) ∈ N × N be such that (a, b)R(c, d).
Then, a − c = b − d ⇒ c − a = d − b ⇒ (c, d)R(a, b).
That is, (a, b) 𝑅(𝑐, 𝑑) implies (c, d) 𝑅(𝑎, 𝑏)∀(𝑎, 𝑏), (𝑐, 𝑑) ∈ 𝑁 × 𝑁.
Hence, R is symmetric.
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

Let (a, b), (c, d) and (e, f) ∈ N × N be such that (a, b) 𝑅(𝑐, 𝑑) and (c, d) 𝑅(𝑒, 𝑓).
Then, 𝑎 − 𝑐 = 𝑏 − 𝑑 and 𝑐 − 𝑒 = 𝑑 − 𝑓
⇒ (a − c) + (c − e) = (b − d) + (d − f)
⇒a−e=b−f
⇒ (a, b)R(e, f).
That is, (a, b) 𝑅(𝑐, 𝑑) and (c, d) R (e, f) implies, (a, b) 𝑅(𝑒, 𝑓)∀(𝑎, 𝑏), (𝑐, 𝑑), (𝑒, 𝑓) ∈ 𝑁 × 𝑁.
Hence, R is transitive.
Since 𝑅 is reflexive, symmetric and transitive so, 𝑅 is an equivalence relation.

15.A relation R on set A = {−4, −3, −2, −1,0,1,2,3,4} be defined as R = {(x, y): x + y is an integer divisible by
2}. Show that R is an equivalence relation. Also, write the equivalence class [2].

Sol: Note that x + x = 2x is divisible by 2 for all x ∈ A. So, (x, x) ∈ R. Therefore, R is reflexive.
Let (x, y) ∈ R∀x, y ∈ A.
Then 𝑥 + 𝑦 is divisible by 2 implies, 𝑦 + 𝑥 is divisible by 2 i.e., (𝑦, 𝑥) ∈ 𝑅.
Therefore, 𝑅 is symmetric.
Let (𝑥, 𝑦) ∈ 𝑅 and (𝑦, 𝑧) ∈ 𝑅 ∀𝑥, 𝑦, 𝑧 ∈ 𝐴.
Now (𝑥, 𝑦) ∈ 𝑅 implies, 𝑥 + 𝑦 is divisible by 2 i.e., either 𝑥 and y both are even or odd integers.
and; (𝑦, 𝑧) ∈ 𝑅 implies 𝑦 + 𝑧 is divisible by 2 i.e., either 𝑦 and 𝑧 both are even or odd integers.
When 𝑥 is even, then 𝑧 is even implies that 𝑥 + 𝑧 is divisible by 2 i.e., (𝑥, 𝑧) ∈ 𝑅; when 𝑥 is odd, then 𝑧 is
odd implies that 𝑥 + 𝑧 is divisible by 2 i.e., (𝑥, 𝑧) ∈ 𝑅. Therefore, 𝑅 is transitive.
Hence, 𝑅 is equivalence relation as 𝑅 is reflexive, symmetric and transitive.
For the equivalence class [2], let (2, 𝑝) ∈ 𝑅 ∀𝑝 ∈ 𝐴.
That implies, 2 + p is divisible by 2 .
Clearly, 𝑝 = −4, −2,0,2,4.
Hence, [2] = {−4, −2,0,2,4}.

16.Students of a school are taken to a railway museum to learn about railways heritage and its history.
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

An exhibit in the museum depicted many rail lines on the track near the railway station. Let L be the set of
all rail lines on the railway track and 𝑅 be the relation on 𝐿 defined by
R = {(𝑙1 , 𝑙2 ): 𝑙1 is parallel to 𝑙2 }

On the basis of the above information, answer the following questions :

(i) Find whether the relation R is symmetric or not.
(ii) Find whether the relation R is transitive or not.
(iii) If one of the rail lines on the railway track is represented by the equation y = 3𝑥 + 2, then find the set of
rail lines in R related to it.

OR

Let S be the relation defined by S = {(𝑙1 , 𝑙2 ): 𝑙1 is perpendicular to 𝑙2 } check whether the relation S is
symmetric and transitive.

(i) Let (𝑙1 , 𝑙2 ) ∈ R. Then 𝑙1 is parallel to 𝑙2 implies, 𝑙2 is parallel to 𝑙1 . That is, (𝑙2 , 𝑙1 ) ∈ R. Clearly, R is
symmetric.
(ii) Let (𝑙1 , 𝑙2 ) ∈ R and (𝑙2 , 𝑙3 ) ∈ R. Then, 𝑙1 is parallel to 𝑙2 and 𝑙2 is parallel to 𝑙3 . It implies, 𝑙1 is parallel to 𝑙3 .
That is, (𝑙1 , 𝑙3 ) ∈ R.
Clearly, R is transitive.
(iii) The set of all rail lines related to the line y = 3x + 2 is the set of all lines that are parallel to the line 𝑦 =
3𝑥 + 2. The line parallel to the given line is of the form 𝑦 = 3𝑥 + 𝑐, 𝑐 ∈ ℝ.
Hence, the set of all lines related to the given line is given by 𝑦 = 3𝑥 + 𝑐, 𝑐 ∈ ℝ.
Recall that, parallel lines have same value of slopes.
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

OR

(iii) The relation S is symmetric as (𝑙1 , 𝑙2 ) ∈ S implies that, 𝑙1 is perpendicular to 𝑙2 which further implies that,
𝑙2 is perpendicular to 𝑙1 . That is, (𝑙2 , 𝑙1 ) ∈ S.
The relation S is not transitive. Indeed, if 𝑙1 is perpendicular to 𝑙2 and 𝑙2 is perpendicular to 𝑙3 , then 𝑙1 can
never be perpendicular to 𝑙3 .
It means, (𝑙1 , 𝑙2 ) ∈ S and (𝑙2 , 𝑙3 ) ∈ S but (𝑙1 , 𝑙3 ) ∉ S.

. 2𝑥
17 Show that a function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 1+𝑥2 is neither one-one nor onto. Further, find set A so
that the given function f: R → A becomes an onto function.
2m 2n
(a) Let m, n ∈ R so that f(m) = f(n). That implies, 1+m2 = 1+n2
⇒ mn2 + m = nm2 + n
⇒ m − n = mn(m − n)
⇒ 0 = mn(m − n) − (m − n)
⇒ (mn − 1)(m − n) = 0
1
Either m − n = 0 or, mn − 1 = 0 i.e., m = n or, m = n.
So, 𝑓(𝑚) = 𝑓(𝑛) does not necessarily imply 𝑚 = 𝑛 for all 𝑚, 𝑛 ∈ 𝑅.
Hence, 𝑓(𝑥) is not one-one.
2𝑥
Let 𝑦 = 𝑓(𝑥) =
1+𝑥 2
⇒ yx 2 − 2x + y = 0
2 ± √4 − 4y 2 1 ± √1 − y 2
⇒x= =
2y y
Now for 𝑥 to be real, we must have 1 − 𝑦 2 ≥ 0 i.e., (1 − 𝑦)(1 + 𝑦) ≥ 0 i.e., 𝑦 ∈ [−1,1]. That is for all 𝑥 ∈ 𝑅
(domain), we do not have 𝑦 ∈ 𝑅 (codomain) i.e., range ≠ codomain . Hence 𝑓(𝑥) is not onto.
2x
Let f: R → [−1,1] defined by f(x) = 1+x2. Now for all real values of x, y ∈ [−1,1].
That is, range = codomain.
Hence, set 𝐴 = [−1,1] so that the given function 𝑓: 𝑅 → 𝐴 becomes an onto function.

18.A function 𝑓 is defined from 𝑅 → 𝑅 as 𝑓(𝑥) = 𝑎𝑥 + 𝑏, such that 𝑓(1) = 1 and 𝑓(2) = 3. Find function
𝑓(𝑥). Hence, check whether function 𝑓(𝑥) is one-one and onto or not.
(b) Since 𝑓(𝑥) = 𝑎𝑥 + 𝑏 such that, 𝑓(1) = 1 and 𝑓(2) = 3.
So, 𝑓(1) = 𝑎(1) + 𝑏 = 1 ⇒ 𝑎 + 𝑏 = 1 and 𝑓(2) = 𝑎(2) + 𝑏 = 3 ⇒ 2𝑎 + 𝑏 = 3.
Solving these equations, we get a = 2, b = −1
Hence, f(x) = 2x − 1.
Let x1 , x2 ∈ R and f(x1 ) = f(x2 ).
Then 2𝑥1 − 1 = 2𝑥2 − 1 i.e., 𝑥1 = 𝑥2 . So, 𝑓 is one-one.
Also, let 𝑦 = 𝑓(𝑥), 𝑦 ∈ 𝑅.
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

Then y = 2x − 1
y+1
⇒x= ∈ R ∀y ∈ R.
2
Hence, 𝑓 is onto (since range and codomain are same).

19.Show that a function 𝑓: 𝑅 → 𝑅 defined as 𝑓(𝑥) = 𝑥 2 + 𝑥 + 1 is neither one-one nor onto. Also, find all the
values of x for which f(x) = 3.
(a) Let 𝑥1 , 𝑥2 ∈ 𝑅 such that 𝑓(𝑥1 ) = 𝑓(𝑥2 ).That is, 𝑥12 + 𝑥1 + 1 = 𝑥22 + 𝑥2 + 1
⇒ (x1 − x2 )(x1 + x2 ) + (x1 − x2 ) = 0
⇒ (x1 − x2 )[(x1 + x2 ) + 1] = 0
So, x1 = x2 or, (x1 + x2 + 1) = 0
That is, 𝑓(𝑥1 ) = 𝑓(𝑥2 ) does not necessarily imply 𝑥1 = 𝑥2 .
Hence, 𝑓 is not one-one.
Let y = f(x) = x 2 + x + 1, y ∈ R
That is, 𝑥 2 + 𝑥 + (1 − 𝑦) = 0
−1 ± √1 − 4(1 − y) −1 ± √4y − 3
⇒x= =
2 2
3 3
For x to be real, we must have 4y − 3 ≥ 0 i.e., y ≥ 4. It implies, range of function = y ∈ [4 , ∞).
That is, range of 𝑓(𝑥) ≠ codomain . Hence, 𝑓 is not onto.
Now 𝑓(𝑥) = 3
So, 𝑥 2 + 𝑥 + 1 = 3
⇒ x2 + x − 2 = 0
⇒ (x − 1)(x + 2) = 0
∴ x = 1, −2.

𝑎 𝑏
20.A relation R is defined on N × N (where N is the set of natural numbers) as (𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇔ 𝑐
= 𝑑. Show
that 𝑅 is an equivalence relation.
a b
(b) Note that, a = b ⇔ (a, b)R(a, b)∀(a, b) ∈ N × N. So, R is reflexive.

Let (a, b)R(c, d)∀(a, b), (c, d) ∈ N × N.

a b c d
Then, c = d which implies, a = b.
That implies, (c,d)R(a,b).
Therefore, R is symmetric.
Let (a, b)R(c, d) and (c, d)R(e, f)∀(a, b), (c, d), (e, f) ∈ N × N.
a b c d
Then, c = d and e = f .
a c b d
Consider × = ×
c e d f
a b
⇒ =
e f
That implies, (𝑎, 𝑏)𝑅(𝑒, 𝑓).
Therefore, 𝑅 is transitive.
Since 𝑅 is reflexive, symmetric and transitive so, 𝑅 is equivalence relation.
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

21.A relation R on set A = {x: −10 ≤ x ≤ 10, x ∈ Z} is defined as R = {(x, y): (x − y) is divisible by 5}. Show
that R is an equivalence relation. Also, write the equivalence class [5].

Here A = {±10, ±9, ±8, ±7, ±6, ±5, ±4, ±3, ±2, ±1,0}.
As a − a = 0 is divisible by 5∀a ∈ A ∴ (a, a) ∈ R.
Therefore, R is reflexive.
Let (a, b) ∈ R for all a, b ∈ A. It implies, a − b is divisible by 5 .
This further implies, 𝑏 − 𝑎 is divisible by 5 . So, ( 𝑏, 𝑎) ∈ 𝑅.
Therefore, R is symmetric.
Let (a, b) ∈ R and (b, c) ∈ R ∀a, b, c ∈ A.
It implies, a − b is divisible by 5 and b − c is divisible by 5 .
This further implies, (𝑎 − 𝑏) + (𝑏 − 𝑐) = 𝑎 − 𝑐 is also divisible by 5. 𝑆𝑜, (𝑎, 𝑐) ∈ 𝑅.
Therefore, R is transitive.
Hence, 𝑅 is an equivalence relation.
For the equivalence class [5], let (5, x) ∈ R for all x ∈ A.
That is, 5 − x is divisible by 5 .
Then x = ±10, ±5,0.
Hence, [5] = {±10, ±5,0}.

22.Let R be a relation in the set N given by 𝑅 = {(𝑎, 𝑏): 𝑎 = 𝑏 − 2, 𝑏 > 6}.

Then
(a) (8,7) ∈ R (b) (6,8) ∈ R
(c) (3,8) ∈ R (d) (2,4) ∈ R

23.Let 𝐴 = {3,5}. Then number of reflexive relations on 𝐴 is

(a) 2 (b) 4 (c) 0 (d) 8

24.Assertion (A): The number of onto functions from a set P containing 5 elements to a set Q containing 2
elements is 30.
Reason (𝑅) : Number of onto functions from a set containing m elements to a set containing n elements is
nm .

A function f: A → B defined as f(x) = 2x is both one-one and onto. If 𝐴 = {1,2,3,4}, then find the set 𝐵.

𝑓(1) = 2, 𝑓(2) = 4, 𝑓(3) = 6, 𝑓(4) = 8

∴ 𝐵 = {2,4,6,8}

25.A relation 𝑅 is defined on a set of real numbers ℝ asR = {(x, y): x ⋅ y is an irrational number }.

Check whether R is reflexive, symmetric and transitive or not.

For reflexive
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

(1,1) ∉ R as 12 is rational (or any other counter example)

𝑅 is not reflexive
For symmetric
Let (x, y) ∈ R. ∴ xy is an irrational number
∴ (y.x) is an irrational number
∴ (y, x) ∈ R
∴ R is symmetric
For Transitive
(1, √2) ∈ 𝑅, (√2, 2) ∈ 𝑅 (or any other counter example)
but (1,2) ∉ R
∴ R is not transitive

26.A function f: [−4,4] → [0,4] is given by f(𝑥) = √16 − 𝑥 2 . Show that f is an onto function but not a one-one
function. Further, find all possible values of ' a ' for which f(a) = √7.

Onto: Let 𝑦 = √16 − 𝑥 2 ⇒ 𝑦 ≥ 0

Squaring we get, 𝑥 2 = 16 − 𝑦 2 ⇒ 𝑥 = ±√16 − 𝑦 2
For each 𝑦 ∈ [−4,4], ' 𝑥 ' is a real number, ∴ 0 ≤ 𝑦 ≤ 4 ⇒ 𝑅𝑓 = [0,4] = 𝐶0 - domain ∴ ' f ' is an onto function.
One-One: 𝑓(−1) = 𝑓(1) = √15 but −1 ≠ 1, ∴′ 𝑓 'is not a one-one function.

𝑓(𝑎) = √7 ⇒ √16 − 𝑎2 = √7 ⇒ 𝑎 = ±3
5𝑥−3
27.Show that a function 𝑓: ℝ → ℝ defined as 𝑓(𝑥) = is both one-one and onto.
4

Let x1 , x2 ∈ R (Domain) such that f(x1 ) = f(x2 )

5𝑥1 − 3 5x2 − 3
⇒ =
4 4
⇒ 5x1 = 5x2 ⇒ x1 = x2
∴ f is one-one.
Let 𝑦 ∈ 𝑅 (co-domain). Then f(x) = y for some 𝑥.
5𝑥−3 4𝑦+3
if, 𝑦 = 4 ,i.e., if, 𝑥 = 5 , which ∈ 𝑅 (Domain)
4𝑦+3 4𝑦+3
Thus, for every 𝑦 ∈ 𝑅 (co - domain), there exists ∈ 𝑅 (domain) such that 𝑓 ( ) =𝑦
5 5
∴ Range of f = R = codomain of f . Hence, f is onto.

28.Prove that a function 𝑓: [0, ∞) → [−5, ∞) defined as 𝑓(𝑥) = 4𝑥 2 + 4𝑥 − 5 is both one-one and onto.
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

Let 𝑥1 , 𝑥2 ∈ [0, ∞) such that f(x1 ) = f(x2 )

Then this ⇒ 4𝑥12 + 4x1 − 5 = 4𝑥22 + 4x2 − 5
⇒ (x1 + x2 )(x1 − x2 ) + (x1 − x2 ) = 0
Let 𝑓(𝑥) = 𝑦 ⇒ y = 4x 2 + 4x − 5 for 𝑥 ∈ [0, ∞)
⇒ (𝑥1 − 𝑥2 )[(𝑥1 + 𝑥2 ) + 1] = 0
⇒ 4𝑥 2 + 4𝑥 − 5 − 𝑦 = 0
⇒ (x1 − x2 ) = 0 or x1 + x2 = −1, which is rejected as x1 , x2 ≥ 0
⇒ x1 = x2
−4 ± √16 − 16(−5 − y) −4 + 4√6 + y −1 + √6 + y
⇒x= ⇒x= =
8 8 2
Since, 𝑥 ≥ 0, we have 𝑦 + 6 ≥ 1 ⇒ 𝑦 ∈ [−5, ∞)
∴ f is one-one.
∴ Range = Codomain = [−5, ∞)
Hence f is onto.

1 1 x
29.Check whether a function f: ℝ → [− 2 , 2] defined as f(x) = 1+x2 is one-one and onto or not.

𝑥1 𝑥2
Let 𝑓(𝑥1 ) = 𝑓(𝑥2 ) ⇒ 2 =
1 + 𝑥1 1 + 𝑥22
⇒ 𝑥1 + 𝑥1 𝑥22 = 𝑥2 + 𝑥12 𝑥2
⇒ (𝑥1 − 𝑥2 )(1 − 𝑥1 𝑥2 ) = 0
1
for 𝑥1 = 2, 𝑥2 =
2
we have (𝑥1 − 𝑥2 )(1 − 𝑥1 𝑥2 ) = 0 but 𝑥1 ≠ 𝑥2
⇒ 𝑓 is not one-one. 1 1
𝑥 ∴ Range = [− , ] − {0}. Also, y
Let 𝑥 ∈ 𝑅 such that 𝑓(𝑥) = 𝑦 ⇒ 𝑦 = 2 2
1 + x2
2
x y−x+y =0
1 ± √1 − 4y 2
⇒x= (𝑦 ≠ 0).
2𝑦
1 1
[ For y = 0 ∈ [− , ] , we have 0 ∈ 𝑅 such that f(0) = 0]
2 2
𝑥 ≠ 0, 𝑥 ∈ 𝑅 ⇒ 1 − 4y 2 ≥ 0, 𝑦 ≠ 0
= 0 wodomain x = 0.
4 4x
30.Let f: ℝ − {− 3} → ℝ be a function defined as f(x) = 3x+4. Show that f is a one-one function. Also, check
whether f is an onto function or not.

31.An organization conducted bike race under two different categories - Boys and Girls. There were 28
participants in all. Among all of them, finally three from category 1 and two from category 2 were selected
for the final race. Ravi forms two sets B and G with these participants for his college project.
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

Let B = {b1 , b2 , b3 } and G = {g1 , g 2 }, where B represents the set of Boys selected and G the set of Girls
selected for the final race.

Based on the above information, answer the following questions:

(I) How many relations are possible from B to G ?
(II) Among all the possible relations from B to G , how many functions can be formed from B to G ?
(III) Let R: B → B be defined by R = {(𝑥, y): 𝑥 and y are students of the same sex}. Check if 𝑅 is an
equivalence relation.

OR
(III) A function f: B → G be defined by f = {(b1 , g1 ), (b2 , g 2 ), (b3 , g1 )}.

Check if f is bijective. Justify your answer.

(I) Number of relations = 26 = 64

(II) Number of possible functions = 23 = 8
(III) R is an equivalence relation as it is reflexive, symmetric and transitive

OR

Since 𝑓 is not one-one function

∴ 𝑓 is not bijective

32.ASSERTION (A): The relation 𝑓: {1,2,3,4} → {𝑥, 𝑦, 𝑧, 𝑝} defined by 𝑓 = {(1, 𝑥), (2, 𝑦), (3, 𝑧)} is a bijective
function.
REASON (𝐑) : The function 𝑓: {1,2,3} → {𝑥, 𝑦, 𝑧, 𝑝} such that 𝑓 = {(𝟏, 𝐱), (𝟐, 𝒚), (𝟑, 𝑧)} is one-one.
(d) Assertion is false. As element 4 has no image under 𝑓, so relation 𝑓 is not a function.

Reason is true. The given function 𝑓: {1,2,3} → {𝒙, 𝑦, 𝑧, 𝑝} is one - one, as for each 𝒂 ∈ {𝟏, 𝟐, 𝟑}, there is
different image in {𝒙, 𝒚, 𝒛, 𝑝} under 𝑓.
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

33.If the set A contains 5 elements and the set B contains 6 elements, then the number of both one-one
and onto mapping from A to B is
(a) 720 (b) 120 (c) 30 (d) 0

Sol:Set A contains 5 elements and the set B contains 6 elements. For one-one function each element in set
B is assigned to only one element in set A Correct Answer is Option (d) 0

34.Let ℕ be the set of all natural numbers and 𝑹 be a relation on ℕ × ℕ defined by

(𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇔ 𝒂𝑑 = 𝒃𝑐 for all (𝑎, 𝑏), (𝑐, 𝑑) ∈ ℕ × ℕ. Show that 𝑹 is an equivalence relation on ℕ × ℕ. Also,
find the equivalence class of (𝟐, 𝟔), i.e., [(𝟐, 𝟔)].

Let (𝒂, 𝒃) be an arbitrary element of ℕ × ℕ. Then, (𝑎, 𝑏) ∈ ℕ × ℕ and 𝒂, 𝒃 ∈ ℕ

We have, 𝒂𝒃 = 𝒃𝒂; ( As 𝒂, 𝒃 ∈ ℕ and multiplication is commutative on ℕ )
⇒ (𝒂, 𝒃)𝑹(𝒂, 𝒃), according to the definition of the relation 𝑹 on ℕ × ℕ
Thus (𝑎, 𝑏)𝑅(𝑎, 𝑏), ∀(𝑎, 𝑏) ∈ ℕ × ℕ.
So, 𝑅 is reflexive relation on ℕ × ℕ.
Let (𝑎, 𝑏), (𝑐, 𝑑) be arbitrary elements of ℕ × ℕ such that (𝑎, 𝑏)𝑹(𝑐, 𝑑).
Then, (𝒂, 𝒃)𝑹(𝒄, 𝒅) ⇒ 𝒂𝒅 = 𝒃𝒄 ⇒ 𝒃𝒄 = 𝒂𝒅; (changing LHS and RHS)
⇒ 𝒄𝒃 = 𝒅𝒂; ( As 𝑎, 𝑏, 𝑐, 𝒅 ∈ ℕ and multiplication is commutative on ℕ)
⇒ (𝑐, 𝑑)𝑅(𝑎, 𝑏); according to the definition of the relation 𝑹 on ℕ × ℕ
Thus (𝒂, 𝒃)𝑹(𝒄, 𝒅) ⇒ (𝒄, 𝒅)𝑹(𝒂, 𝒃)
So, 𝑅 is symmetric relation on ℕ × ℕ.

35.Let (𝑎, 𝑏), (𝑐, 𝑑), (𝑒, 𝑓) be arbitrary elements of ℕ × ℕ such that (𝑎, 𝑏)𝑅(𝑐, 𝑑) and (𝑐, 𝑑)𝑅(𝑒, 𝑓).

(𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇒ 𝑎𝑑 = 𝑏𝑐
Then } ⇒ (𝑎𝑑)(𝑐𝑓) = (𝑏𝑐)(𝑑𝑒) ⇒ 𝑎𝑓 = 𝑏𝑒
(𝑐, 𝑑)𝑅(𝑒, 𝑓) ⇒ 𝑐𝑓 = 𝑑𝑒
⇒ (𝑎, 𝑏)𝑅(𝑒, 𝑓); ( according to the definition of the relation 𝑅 on ℕ × ℕ)
Thus (𝑎, 𝑏)𝑅(𝑐, 𝑑) and (𝑐, 𝑑)𝑅(𝑒, 𝑓) ⇒ (𝑎, 𝑏)𝑅(𝑒, 𝑓)
So, 𝑅 is transitive relation on ℕ × ℕ.
As the relation 𝑅 is reflexive, symmetric and transitive so, it is equivalence relation on ℕ × ℕ.
[(2,6)] = {(𝑥, 𝑦) ∈ ℕ × ℕ: (𝑥, 𝑦)𝑅(2,6)}
= {(𝑥, 𝑦) ∈ ℕ × ℕ: 3𝑥 = 𝑦}
= {(𝑥, 3𝑥): 𝑥 ∈ ℕ} = {(1,3), (2,6), (3,9), … … …..
𝒙
36.Show that the function 𝑓: ℝ → {𝒙 ∈ ℝ: −𝟏 < 𝒙 < 𝟏} defined by 𝑓(𝒙) = 𝟏+|𝐱| , 𝒙 ∈ ℝ is one-one and onto
function.
𝑥
1+𝑥
, if 𝑥 ≥ 0
We have, 𝑓(𝑥) = { 𝑥
1−𝑥
,if 𝑥 < 0
Now, we consider the following cases
𝑥
Case 1: when 𝑥 ≥ 0, we have 𝑓(𝑥) = 1+𝑥
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

Injectivity: let 𝑥, 𝑦 ∈ ℝ+ ∪ {0} such that 𝑓(𝑥) = 𝑓(𝑦), then

𝑥 𝑦
⇒ = ⇒ 𝑥 + 𝑥𝑦 = 𝑦 + 𝑥𝑦 ⇒ 𝑥 = 𝑦
1+𝑥 1+𝑦
So, 𝑓 is injective function.
𝑥 1
Surjectivity: when 𝑥 ≥ 0, we have 𝑓(𝑥) = 1+𝑥 ≥ 0 and 𝑓(𝑥) = 1 − 1+𝑥 < 1, as 𝑥 ≥ 0
𝑦
𝑦 1−𝑦
Let 𝑦 ∈ [0,1), thus for each 𝑦 ∈ [0,1) there exists 𝑥 = 1−𝑦 ≥ 0 such that 𝑓(𝑥) = 𝑦 = 𝑦.
1+
1−𝑦
So, 𝒇 is onto function on [0, ∞) to [0,1).
𝑥
Case 2: when 𝑥 < 0, we have 𝑓(𝑥) =
1−𝑥
Injectivity: Let 𝒙, 𝒚 ∈ ℝ− i.e., 𝒙, 𝒚 < 𝟎, such that 𝑓(𝒙) = 𝑓(𝒚), then
𝑥 𝑦
⇒ = ⇒ 𝑥 − 𝑥𝑦 = 𝑦 − 𝑥𝑦 ⇒ 𝑥 = 𝑦
1−𝑥 1−𝑦
So, 𝑓 is injective function.
𝑥 𝑥 1
Surjectivity : 𝑥 < 0, we have 𝑓(𝑥) = < 0 also, 𝑓(𝑥) = = −1 + > −1 −1 < 𝑓(𝑥) < 0.
1−𝑥 1−𝑥 1−𝑥
𝑦
Let 𝑦 ∈ (−1,0) be an arbitrary real number and there exists 𝑥 = 1+𝑦
< 0 such that,
𝑦
𝑦 1+𝑦
𝑓(𝑥) = 𝑓 (1+𝑦) = 𝑦 = 𝑦.
1−
1+𝑦
𝑦
So, for 𝑦 ∈ (−1,0), there exists 𝑥 = 1+𝑦 < 0 such that 𝑓(𝑥) = 𝑦.
Hence, 𝑓 is onto function on (−∞, 0) to (−1,0)
Case 3:
𝑥 𝑦
(Injectivity): Let 𝑥 > 0&𝑦 < 0 such that 𝑓(𝑥) = 𝑓(𝑦) ⇒ 1+𝑥 = 1−𝑦 ⇒ 𝑥 − 𝑥𝑦 = 𝑦 + 𝑥𝑦 ⇒ 𝑥 − 𝑦 = 2𝑥𝑦, here
𝐿𝐻𝑆 > 0 but 𝑅𝐻𝑆 < 0, which is inadmissible. Hence, 𝒇(𝒙) ≠ 𝑓(𝒚) when 𝒙 ≠ 𝒚.
Hence 𝑓 is one-one and onto function.

37. X = {0,2,4,6,8}.
P is a relation on X defined by P = {(0,2), (4,2), (4,6), (8,6), (2,4), (0,4)}.
Based on the above information, two statements are given below - one labelled Assertion (A) and the other
labelled Reason (R). Read the statements carefully and choose the option that correctly describes
statements (A) and (R).
Assertion (A): The relation P on set X is a transitive relation.
Reason (𝑅) : The relation P has a subset of the form {(𝑎, 𝑏), (𝑏, 𝑐), (𝑎, 𝑐)}, where 𝑎, 𝑏, 𝑐 ∈ X.
(d) (A) is false but (R) is true.

38.A function 𝑓: R − {−1,1}−> R is defined by:

𝑥
𝑓(𝑥) = 2
𝑥 −1
i) Check if 𝑓 is one-one.
ii) Check if 𝑓 is onto.
i) Assumes 𝑓(𝑥) = 𝑓(𝑦) and evaluates the same as:
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

𝑥 𝑦
= 2
𝑥2−1 𝑦 −1
⇒𝑥(𝑦 2 − 1) = 𝑦(𝑥 2 − 1)
⇒𝑥𝑦 2 − 𝑥 − 𝑦𝑥 2 + 𝑦 = 0
⇒ (𝑦 − 𝑥)(𝑥𝑦 + 1) = 0

Uses the above step to conclude that 𝑥 = 𝑦 or 𝑥𝑦 = −1.

Takes a pair of numbers 𝑥 and 𝑦 such that 𝑥𝑦 = −1 to show that 𝑓 is not one-one.
For example,
1 2 2
for 𝑥 = 2 and 𝑦 = −2, 𝑓(𝑥) = − 3 and 𝑓(𝑦) = − 3.

𝑥
ii) Equates 𝑓(𝑥) to 𝑦 and solves the same to express 𝑥 in terms of 𝑦 as: =𝑦
𝑥 2 −1

⇒ 𝑥 = 𝑦𝑥 2 − 𝑦
⇒ 𝑦𝑥 2 − 𝑥 − 𝑦 = 0
1 ± √1 + 4𝑦 2
⇒𝑥=
2𝑦
Since 1 + 4𝑦 2 > 0, real root exists and also they are not ±1
1 ± √1 + 4𝑦 2
⇒𝑥= ∈ 𝑅 − {−1, +1}
2𝑦
39.Writes that for any 𝑦 ∈ R (codomain), there exists 𝑥 ∈ R − {−1,1} (domain) such that 𝑓(𝑥) = 𝑦. Hence
concludes that 𝑓 is onto.

Consider 𝑓: 𝑅+ → [−5, ∞) given by 𝑓(𝑥) = 9𝑥 2 + 6𝑥 − 5 where 𝑅+ is the set of all nonnegative real numbers.
Prove that 𝑓 is one- one and onto function.

One - one: Let 𝑥1 , 𝑥2 ∈ 𝑅+ such that

𝑓(𝑥1 ) =𝑓(𝑥2 )
9𝑥12 + 6𝑥1 − 5 = 9𝑥22 + 6𝑥2 − 5
⇒ 9(𝑥12 − 𝑥22 ) + 6(𝑥1 − 𝑥2 ) = 0
⇒ (𝑥1 − 𝑥2 ){9(𝑥1 + 𝑥2 ) + 6} = 0
⇒𝑥1 − 𝑥2 = 0 or 9𝑥1 + 9𝑥2 + 6 = 0 which is not possible
⇒𝑥1 = 𝑥2
∴𝑓 is one-one.

Onto: Let 𝑦 = 9𝑥 2 + 6𝑥 − 5
⇒ 9𝑥 2 + 6𝑥 − (5 + 𝑦) = 0
−6 ± √36 + 4(9)(5 + 𝑦) −6 ± √36√1 + 5 + 𝑦
𝑥= =
2(9) 18
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

6(−1 ± √𝑦 + 6) −1 ± √𝑦 + 6
𝑥= =
6(3) 3
−1−√𝑦+6
Now, 𝑥 ∈ 𝑅+ ⇒ 𝑥 ≥ 0 and so 𝑥 = 3
is rejected
−1 + √𝑦 + 6
∴𝑥=
3
−1+√𝑦+6
Now 𝑥 ≥ 0 ⇒ 3
≥0
⇒ √𝑦 + 6 ≥ 1 ⇒ 𝑦 + 6 ≥ 1
⇒ 𝑦 ≥ −5
∴ 𝑅𝑓 = {𝑦: 𝑦 ∈ [−5, ∞)} = codomain of 𝑓.
∴ 𝑓 is onto.
Hence 𝑓 is one one and onto function.

40.The Earth has 24 time zones, defined by dividing the Earth into 24 equal longitudinal segments. These
are the regions on Earth that have the same standard time. For example, USA and India fall in different time
zones, but Sri Lanka and India are in the same time zone.

A relation R is defined on the set U = { All people on the Earth } such that R = {(𝑥, 𝑦) ∣ the time difference
between the time zones 𝑥 and 𝑦 reside in is 6 hours}.
i) Check whether the relation R is reflexive, symmetric and transitive.
ii) Is relation R an equivalence relation?
i) Writes that for no 𝑥 ∈ U, (𝑥, 𝑥) ∈ R as the difference in time between 𝑥&𝑥 is 0 hours.

Conchudes that R is not reflexive.

Writes that, whenever the difference in time between 𝑥 and 𝑦 is 6 hours, the difference in time between 𝑦
and 𝑥 is also 6 hours. That is, (𝑥, 𝑦) ∈ R ⇒ (𝑦, 𝑥) ∈ R.

Concludes that R is symmetric.

Writes that, if the difference in time between 𝑥 and 𝑦 is 6 hours, and the difference in time between 𝑦 and 𝑧
is also 6 hours, then the difference in time between 𝑥 and 𝑧 could be either 0 hours or 12 hours. That is,
(𝑥, 𝑦) ∈ R& (𝑦, 𝑧) ∈ 𝑅 but (x, z) ∉ R.

Concludes that 𝑅 is not transitive.

ii) From the above steps, conchudes that R is not an equivalence relation.

41.Let the relation R be given as

𝑅 = {(𝑥, 𝑦): 𝑥, 𝑦 ∈ 𝑁 and 𝑥 + 3𝑦 = 12}. Find the domain and range of 𝑅.
12 − x
y= ; x, y ∈ N
3
Domain = {3,6,9}
Range = {1,2,3}
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

42.Show that the function f: ℝ → ℝ, f(x) = x 4 is neither one-one nor onto.

𝑓(−1) = 𝑓(1) = 1 but −1 ≠ 1, ∴ ' 𝑓 ' is not a one-one functions.
0 ≤ 𝑥 4 ≤ ∞ ⇒ 𝑅𝑓 = [0, ∞) ⇒ Range ≠ Co - domain,
∴′ 𝐟 ' is not an onto function.

43.Prove that the greatest integer function f: ℝ → ℝ, given by

f(x) = [x], is neither one-one nor onto.

For not one-one:

1.1,1.2 ∈ 𝑅 (domain)
now, 1.1 ≠ 1.2 but 𝑓(1.1) = 𝑓(1.2) = 1 ⇒ 𝑓 is not one-one.
For not onto:
1 1
Let ∈ 𝑅 (co-domain), but [𝑥] = is not possible for 𝑥 in domain. so, f is not onto.
2 2

44.Let set A = {1,2,3, … ,10} and R be a relation in A × A, defined by (𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇔ 𝑎 + 𝑑 = 𝑏 + 𝑐 for all
(𝑎, 𝑏) and (𝑐, 𝑑) ∈ 𝐴 × 𝐴. Prove that 𝑅 is an equivalence relation.
a + b = b + a ⇒ (a, b)R(b, a), ∀(a, b) ∈ R, ∴ R is reflexive
(𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇒ 𝑎 + 𝑑 = 𝑏 + 𝑐 ⇒ 𝑐 + 𝑏 = 𝑑 + 𝑎 ⇒ (𝑐, 𝑑)𝑅(𝑎, 𝑏), ∴ 𝑅 is symmetric.
(𝑎, 𝑏)𝑅(𝑐, 𝑑)&(𝑐, 𝑑)𝑅(𝑒, 𝑓) ⇒ 𝑎 + 𝑑 = 𝑏 + 𝑐; 𝑐 + 𝑓 = 𝑑 + 𝑒,
Adding the two equations
⇒ a + f = b + e, ∴ (a, b)R(e, f)
⇒ 𝑅 is a transitive relation ∴ 𝐑 is an equivalance realtion

45.Show that the relation 𝑆 in set ℝ of real numbers defined by 𝑆 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏 3 , 𝑎 ∈ ℝ, 𝑏 ∈ ℝ}
is neither reflexive, nor symmetric, nor transitive.

We have 𝑆 = {(𝑎, 𝑏: 𝑎 ≤ 𝑏 3 } where 𝑎, 𝑏 ∈ 𝑅.

1 1 3
(i) Reflexive: we observe that, ≤ ( ) is not true.
2 2
1 1
∴ (2 , 2) ∉ 𝑆. So, 𝑆 is not reflexive.
(ii) Symmetric: We observe that 1 ≤ 33 but 3 ⋠ 13 i.e., (1,3) ∈ 𝑆 but (3,1) ∉ 𝑆. So, 𝑆 is not symmetric.
(iii) Transitive: We observe that, 10 ≤ 33 and 3 ≤ 23 but 10 ± 23 .
i.e., (10,3) ∈ 𝑆 and (3,2) ∈ 𝑆 but (10,2) ∉ 𝑆.So, 𝑆 is not transitive.
∴ 𝑆 is neither reflexive nor symmetric, not transitive.

46.Let R be the relation defined in the set A = {1,2,3,4,5,6,7} by 𝑅 = {(𝑎, 𝑏) : both 𝑎 and 𝑏 are either odd or
even }. Show that 𝑅 is an equivalence relation. Hence, find the elements of equivalence class [1].
𝑅 = {(𝑎, 𝑏) :both 𝑎 and 𝑏 are either odd or even }
for reflexive : Let 𝑎 ∈ 𝐴
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

clearly both 𝑎 and 𝑎 are either odd or even

∴ (𝑎, 𝑎) ∈ 𝑅 ⇒ 𝑅 is reflexive.
for symmetric : Let 𝑎, 𝑏 ∈ 𝐴. Let(𝑎, 𝑏) ∈ 𝑅
⇒ both 𝑎 and 𝑏 are either odd or even
⇒ both 𝑏 and 𝑎 are either odd or even
so, (𝑎, b) ∈ 𝑅 ⇒ (𝑏, 𝑎) ∈ 𝑅 ⇒ 𝑅 is symmetric.
for transitive: Let𝑎, 𝑏, 𝑐 ∈ 𝐴. Let(𝑎, 𝑏) ∈ 𝑅, (𝑏, 𝑐) ∈ 𝑅
⇒ both 𝑎 and 𝑏 are either odd or even & both 𝑏 and 𝑐 are either odd or even
⇒ both 𝑎 and 𝑐 are either odd or even
so, (𝑎, b) ∈ 𝑅, (𝑏, 𝑐) ∈ 𝑅 ⇒ (a, c) ∈ 𝑅 ⇒ 𝑅 is transitive.
equivalence class of [1] = {1,3,5,7}

𝑥
47.Show that the function 𝑓: (−∞, 0) → (−1,0) defined by 𝑓(𝑥) = 1+|𝑥| , 𝑥 ∈ (−∞, 0) is oneone and onto.

𝑥
Given, 𝑓(𝑥) = , 𝑥 ∈ (−∞, 0)
1 + |𝑥|
𝑥
= (∵ 𝑥 ∈ (−∞, 0), |𝑥| = −𝑥)
1−𝑥

For one-one : Let 𝑓(𝑥1 ) = 𝑓(𝑥2 ), 𝑥1 𝑥2 ∈ (−∞, 0)

𝑥1 𝑥2
⇒ =
1 − 𝑥1 1 − 𝑥2
⇒ 𝑥1 (1 − 𝑥2 ) = 𝑥2 (1 − 𝑥1 )
⇒ 𝑥1 − 𝑥1 𝑥2 = 𝑥2 − 𝑥1 𝑥2 ⇒ 𝑥1 = 𝑥2
Hence, if 𝑓(𝑥1 ) = 𝑓(𝑥2 ), then 𝑥1 = 𝑥2 ∴ 𝑓 is one-one

For onto: Let 𝑓(𝑥) = 𝑦

𝑥
⇒𝑦= ⇒ 𝑦(1 − 𝑥) = 𝑥 ⇒ 𝑦 − 𝑥𝑦 = 𝑥
1−𝑥
⇒ 𝑥 + 𝑥𝑦 = 𝑦 ⇒
Here, 𝑦 ∈ (−1,0)
So, 𝑥 is defined for all values of 𝑦.
∴ 𝑓 is onto
2
48.Show that the function 𝑓 in 𝐴 = 𝑅 − {3}
4𝑥+3
defined as 𝑓(𝑥) = 6𝑥−4 is one-one and onto.
4𝑥+3 2
Here, 𝑓(𝑥) = 6𝑥−4 where 𝑥 ∈ 𝐴 = 𝑅 − {3}.
(i) Let 𝑓(𝑥1 ) = 𝑓(𝑥2 )(∀𝑥1 , 𝑥2 ∈ 𝐴)
4𝑥1 + 3 4𝑥2 + 3
⇒ =
6𝑥1 − 4 6𝑥2 − 4
⇒ (4𝑥1 + 3)(6𝑥2 − 4) = (6𝑥1 − 4)(4𝑥2 + 3)
⇒ 24𝑥1 𝑥2 − 16𝑥1 + 18𝑥2 − 12 = 24𝑥1 𝑥2 + 18𝑥1 − 16𝑥2 − 12
⇒ −34𝑥1 = −34𝑥2 ⇒ 𝑥1 = 𝑥2
 Grade 12 Relation and function Question Bank that includes:

6 regions of 3 sets of pervious year question papers. A mix of highly competency-based

-Compiled by Mr Joe Daniel,Senior Secondry Coordinator

∴ 𝑓 is one-one.
2
(ii) For 𝑦 ∈ 𝐴 = 𝑅 − { }. Let 𝑓(𝑥) = 𝑦
3
4𝑥 + 3
⇔ = 𝑦 ⇔ (6𝑥 − 4)𝑦 = 4𝑥 + 3
6𝑥 − 4
4𝑦+3 2
⇔ 𝑥 = 6𝑦−4 ∈ 𝐴 (as 𝑦 ≠ 3)
⇔ 𝑓 is onto.

49.Let 𝑓: 𝑁 → 𝑁 be a function defined as 𝑓(𝑥) = 9𝑥 2 + 6𝑥 − 5. Show that 𝑓: 𝑁 → 𝑆, where 𝑆 is the range of

𝑓, is invertible.

Let 𝑓: 𝑁 → 𝑆, 𝑓(𝑥) = 9𝑥 2 + 6𝑥 − 5
Consider, 𝑓(𝑥1 ) = 𝑓(𝑥2 )
⇒ 9𝑥12 + 6𝑥1 − 5 = 9𝑥22 + 6𝑥2 − 5
⇒ 9(𝑥12 − 𝑥22 ) + 6(𝑥1 − 𝑥2 ) = 0
⇒ (𝑥1 − 𝑥2 )[9𝑥1 + 9𝑥2 + 6] = 0
⇒ 𝑥1 = 𝑥2 [∵ 𝑥1 , 𝑥2 ∈ 𝑁]
⇒ 𝑓 is one-one.
Since, 𝑆 is the range of 𝑓.
∴ 𝑓 is onto.
Since, 𝑓 is one-one and onto.

Let 𝐴 = {𝑥 ∈ 𝑍: 0 ≤ 𝑥 ≤ 12}. Show that

𝑅 = {(𝑎, 𝑏): 𝑎, 𝑏 ∈ 𝐴, |𝑎 − 𝑏| is divisible by 4}, is an equivalence relation. Find the set of all elements related
to 1 . Also write the equivalence class [2].We have, 𝐴 = {𝑥 ∈ 𝑍: 0 ≤ 𝑥 ≤ 12}
∴ 𝐴 = {0,1,2,3, … ,12}
and 𝑆 = {(𝑎, 𝑏): |𝑎 − 𝑏| is a multiple of 4}
(i) Reflexive : For any 𝑎 ∈ 𝐴,
|𝑎 − 𝑎| = 0, which is a multiple of 4 .
Thus, (𝑎, 𝑎) ∈ 𝑆
∴ 𝑆 is reflexive.
(ii) Symmetric : For any 𝑎, 𝑏 ∈ 𝐴,

Let (𝑎, 𝑏) ∈ 𝑆
⇒ |𝑎 − 𝑏| is a multiple of 4
⇒ |𝑎 − 𝑏| is a multiple of 4 and |𝑏 − 𝑐| is a multiple of 4
⇒ 𝑎 − 𝑏 = ±4𝑘1 and 𝑏 − 𝑐 = ±4𝑘2 ; 𝑘1 , 𝑘2 ∈ 𝑁
⇒ (𝑎 − 𝑏) + (𝑏 − 𝑐) = ±4(𝑘1 + 𝑘2 ); 𝑘1 , 𝑘2 ∈ 𝑁
⇒ 𝑎 − 𝑐 = ±4(𝑘1 + 𝑘2 ); 𝑘1 , 𝑘2 ∈ 𝑁
⇒ |𝑎 − 𝑐| is a multiple of 4 ⇒ (𝑎, 𝑐) ∈ 𝑆
∴ 𝑆 is transitive.
Hence, 𝑆 is an equivalence relation.
The set of elements related to 1 is {5,9}.
Equivalence class for [2] is {2,6,10}.