CLASS-XII

CHAPTER-01
RELATION AND FUNCTION
05 MARKS TYPE QUESTIONS

Q. No. QUESTION MARK

1. Two integers a and b are said to be congruence modulo m 5

if a-b is divisible by m which is as 𝑎 ≡ 𝑏(𝑚).

Show that the relation 𝑎 ≡ 𝑏(5) on the set Z of all integers is an equivalence relation. Also
find equivalence class [2].

2. Consider a function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 𝑥 2 + 5𝑥 − 7. Check whether 𝑓 is one-one 5

or onto or both. If not, then what will be the domain and co-domain show that 𝑓 will be
bijective?
3. If A = R-{3} and B = R-{1}. Consider the function f: A→B defined by f(x) x-2/ x-3 for all x∈A. 5
Then show that f is bijective.
4. If Z is the set of all integers and R is the relation on Z defined as R = {(a, b):a,b ∈ Z and a – b is 5
divisible by 5}. Prove that R is an equivalence relation
5. If we throw two dices, the total number of possible outcomes is 36. Show how it is an 5
equivalence relation.
6. Let A = R -{3} and B = R – {1}. Consider the function f: A →B defined by f (x) = (x- 2)/ (x -3). Is f 5
one-one and onto? Justify your answer.
7. Prove that the relation in the set A={1,2,3,4,5} given by R={(a,b):|𝑎 − 𝑏| is an even} is an
5
equivalence relation
8. Kendriya Vidyalaya Sangathan conducted cycle race under two different categories- Boys and
Girls. There were 32 participants in all. Among all them, finally three from category -1 and
two from category-2 were selected for the final race. Amit form two sets B and G with these
participants form his college project. Let B={𝑏1 , 𝑏2 𝑏3 }, and G=(𝑔1 , 𝑔2 },where B represents the
set of Boys selected and G the set of Girls selected for the final race.

(A) How many relation from B to G ?

(B) Among all the possible relations from B to G, how many functions can be formed from
B to G?
 A function 𝑓: 𝐵 → 𝐺 be defined by 𝑓: 𝐵 → 𝐺 defined by f={(𝑏1 , 𝑔1 ), (𝑏2 , 𝑔2 ),( 𝑏3 , 𝑔1 )}.Check
f is bijective or not ?
9. Show that the relation R on the set A={ 𝑥𝜖𝑍 ,0 ≤ 𝑥 ≤ 12} ,given by R = {(a,b) , |a-b|is a 5
multiple of 4} is an equivalence relation. Find the set of all elements related to 1 i.e.
equivalence class [1].

10. A function f:[-4,4] →[0,4] is given by f(x) =√16 − 𝑥 2 , show that f is a onto function but not 5
one-one. Find all possible values of “a” for which f(x)=√7

11. Let R be the relation in N × N 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 (𝑎, 𝑏) 𝑅 (𝑐, 𝑑). If a + d = b + c for (a, b), (c, d) in 5
𝑁 × 𝑁. Prove that R is an equivalence relation.

12.  x + 1, if x is odd 5
Show that f : N → N is given by f ( x) =  is bijective (both one-one and
x − 1, if x is even
onto).
 ANSWER
CHAPTER-01
RELATION AND FUNCTION
05 MARKS TYPE QUESTIONS
Q.No ANSWERS Mark
1. Reflexive: For every integer 𝑥, 𝑥 − 𝑥 = 0 is divisible by 5. 5
So 𝑥 ≡ 𝑥(𝑚𝑜𝑑 5).
Therefore the relation congruence modulo 5 is reflexive.
Symmetric: Let 𝑥 ≡ 𝑦 (𝑚𝑜𝑑 5) then 𝑥 − 𝑦 is visible by 5. Let 𝑥 − 𝑦 = 5𝑘,
Then 𝑦 − 𝑥 = −5𝑘 which is also divisible by 5. Hence 𝑦 ≡ 𝑥 (𝑚𝑜𝑑 5).
Therefore the relation congruence modulo 5 is symmetric

Transitive: Assume that 𝑥 ≡ 𝑦 (𝑚𝑜𝑑 5) and 𝑦 ≡ 𝑧 (𝑚𝑜𝑑 5).

⇒ 𝑥 − 𝑦 = 5𝑘 and 𝑦 − 𝑧 = 5𝑙.
⇒ 𝑥 − 𝑧 = (𝑥 − 𝑦) + (𝑦 − 𝑧) = 5(𝑘 + 𝑙) is also divisible by 5.
Hence 𝑥 ≡ 𝑧 (𝑚𝑜𝑑 5).
Therefore the relation congruence modulo 5 is symmetric
As congruence modulo 5 is reflexive, symmetric and transitive, so it is an equivalence
relation.
2. 𝑓(𝑥) = 𝑥 2 + 5𝑥 − 7. Check whether 𝑓 is one-one or onto or both. If not, then what will be 5
the domain and co-domain show that 𝑓 will be bijective?

For Injective: let 𝑥1 , 𝑥2 ∈ 𝑅 and 𝑓(𝑥1 ) = 𝑓( 𝑥2 )

⇒ 𝑥1 2 + 5𝑥1 − 7 = 𝑥2 2 + 5𝑥2 − 7

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

⇒ (𝑥1 − 𝑥2 ) = 0 𝑜𝑟 (𝑥1 + 𝑥2 + 5) = 0

⇒ 𝑥1 = 𝑥2 𝑜𝑟 𝑥1 = 𝑥2 − 5
There fore f is not one-one. To be one-one 𝑥1 + 𝑥2 + 5 should not be zero. It will happen only
when 𝑥1 , 𝑥2 ∈ [0, ∞) . So to be injective, Domain must be [0, ∞).
For Surjective: Let 𝑥 2 + 5𝑥 − 7 = 𝑦
⇒ 𝑥2 + 5𝑥 − 7 − 𝑦 = 0
−5 ±√25+4(𝑦+7)
⇒ 𝑥= 2
−5 ±√25+4(𝑦+7)
To be onto 𝑥 = ≥0
2
⇒ √25 + 4(𝑦 + 7) ≥5
⇒ 𝑦 ≥ −7
Range = [−7, ∞) ≠ Co-domain. So f is not onto.
Therefore, f will be surjective if Co-domain=Range= [−7, ∞)
So, f will be bijective if domain is [0, ∞) and Co-domain is [−7, ∞).
3. Given, function is f: A→B, where A= R-{3} 5

and B=R-{1}, such that f(x)= x-2/x-3.

For One-one

Let f(x1) = f(x2), for all x1, x2∈ A

⇒x2-2/ x1-3= x2-2/ x2-3

⇒(x1 - 2) (x2-3) = (x1-2)(x? - 3)

⇒ x1x2 - 3x1 -2x2 + 6 = x1x2 - 3x1 - 2x2 +6

⇒- 3x12x2 = - 3x1 - 2x2

- 3 (x1 - x2)+2 (x1 - x2) = 0

- (x1 - x2) = 0

Or, x1 - x2= 0

This implies, x1 = x2.

Since, f(x1) = f(x2)

⇒ x1 = x2, for all x1, x2∈ A.

So, f(x) is a one-one function.

Onto

To show f(x) is onto, we show that range of f(x) and its codomain are same.

Now,

let. y =x-2 /x - 3

or, xy-3y=x-2

⇒xy - x = 3y - 2

⇒x(y-1) = 3y - 2

⇒x=3y-2/y-1 ……Eqn (1)

Since, x ∈R-{3}, for all y ∈ R- {1}, the range of f(x)=R-{1}.

 Also, the given codomain of f(x) = R-{1}

Therefore, Range = Codomain.

Hence, f(x) is an onto function.

Therefore, f(x) is a bijective function.

4. The given relation is R = {(a, b): a, b ∈ Z and a – b is divisible by 5}. 5

To prove R is an equivalence relation, we have to prove R is
reflexive, symmetric and transitive.

Reflexive:
As for any x ∈ Z, we have x – x = 0, which is divisible by 5.
⇒ (x – x) is divisible by 5.
⇒ (x, x) ∈ R, V x ∈ Z Therefore, R is reflexive.

Symmetric:
Let (x, y) ∈ R, where x, y ∈ Z.
⇒ (x – y) is divisible by 5. [by definition of R]
⇒ x – y = 5A for some A ∈ Z.
⇒ y – x = 5(-A)
⇒ (y – x) is also divisible by 5.
⇒ (y, x) ∈ R
Therefore, R is symmetric.

Transitive:
Let (x, y) ∈ R,where x, y ∈ Z.
⇒ (x – y) is divisible by 5.
⇒ x – y = 5Afor some A ∈ Z Again, let (y, z) ∈ R, where y, z ∈ Z.
⇒ (y – 1) is divisible by 5.
⇒ y – z = 5B for some B ∈ Z.

Now, (x – y) + (y – 2) = 5A + 5B
⇒ x – z = 5(A + B)
⇒ (x – z) is divisible by 5 for some (A + B) ∈ Z
⇒ (x, z) ∈ R
Therefore, R is transitive.
Thus, R is reflexive, symmetric and transitive. Hence, it is an equivalence relation

5. If we note down all the outcomes of throwing two dices, we get the following possible 5
relations:
 R = {(1,1), (2,2), (3,3), (1,2), (2,3), (3,4), ………)}
Reflexive:
For the relation to be reflexive (a, a) ∈ R for all a∈ 𝑅
Since, (1,1), (2,2), (3,3), ……. ∈ R
Hence, the relation is reflexive.

Symmetric:
For the relation to be symmetric (a, b) ∈ R => (b, a) ∈ R for all a, b∈ 𝑅
In this relation,
(1,2) ∈ R => (2,1) ∈ R
(2,3) ∈ R => (3,2) ∈ R
(3,4) ∈ R => (4,3) ∈ R
.
Hence, it satisfies the condition of symmetric.
Hence, the function is symmetric.
Transitive:
For the relation to be transitive
(a, b) ∈ R and (b, c) ∈ R
(a, c) ∈ R for all a, b, c ∈ 𝑅
In this relation,
(1,2) ∈ R & (2,3) ∈ R => (1,3) ∈ R
(2,3) ∈ R & (3,2) ∈ R => (2,2) ∈ R
(4,5) ∈ R & (5,2) ∈ R => (4,2) ∈ R
.
.
.
Hence, it satisfies the condition of transitivity.
Hence, the relation is transitive.

Since, the relation R is reflexive, symmetric as well as transitive, the relation R is

equivalence relation.
Hence, throwing two dices is an example of equivalence relation.

6. Given function: 5
f (x) = (x- 2)/ (x -3)
Checking for one-one function:
f (x1) = (x1– 2)/ (x1– 3)
f (x2) = (x2-2)/ (x2-3)
Putting f (x1) = f (x2)
(x1-2)/(x1-3) = (x2-2)/ (x2 -3)
(x1-2) (x2– 3) = (x1– 3) (x2-2)
x1 (x2– 3)- 2 (x2 -3) = x1 (x2– 2) – 3 (x2– 2)
x1 x2 -3x1 -2x2 + 6 = x1 x2 – 2x1 -3x2 + 6
-3x1– 2x2 =- 2x1 -3x2
3x2 -2x2 = – 2x1 + 3x1
x1= x2
Hence, if f (x1) = f (x2), then x1 = x2
Thus, the function f is one-one function.
Checking for onto function:
 f (x) = (x-2)/(x-3)
Let f(x) = y such that y B i.e., y ∈ R – {1}
So, y = (x -2)/ (x- 3)
y (x -3) = x- 2
xy -3y = x -2
xy – x = 3y-2
x (y -1) = 3y- 2
x = (3y -2) /(y-1)
For y = 1, x is not defined but it is given that. y ∈ R – {1}
Hence, x = (3y- 2)/ (y- 1) ∈ R - {3} Hence, f is onto.

7. The given relation in the set A={1,2,3,4,5} given by 5

R={(a,b):|𝑎 − 𝑏| is an even}.
Reflexive:- As |𝑥 − 𝑥|=0 is even ∀ 𝑥 ∈ 𝐴
Hence R is reflexive relation (1)
Symmetric Relation:-
Let (x,y) ∈ R ⇒ |𝑥 − 𝑦| is even (by definition of given relation
⇒ |𝑦 − 𝑥| is also even
since |𝑎| = |−𝑎| ∀ 𝑎 ∈ 𝐴
⇒ (y,x) ∈ R ∀ 𝑥, 𝑦 ∈ 𝐴
𝟏
∴ R is symmetric relation. (1𝟐)
Transitive Relation:-
Let (x,y) ∈ R and (y,z) ∈ R
⇒ |𝑥 − 𝑦| is even (by definition of given relation
⇒ 𝑥 − 𝑦 = ±2𝑙 (l is an integer)………..(1)
⇒ |𝑦 − 𝑧| is even (by definition of given relation
⇒ 𝑦 − 𝑧 = ±2𝑚( m is an integer)………(2)
Add equation(1) and equation(2)
(𝑥 − 𝑦)+( 𝑦 − 𝑧)= ±2𝑙 ± 2𝑚== ±2𝑘 is an integer .
⇒ 𝑥 − 𝑧 = ±2𝑘
⇒ |𝑥 − 𝑧| is an even integer number . (2)
⇒ (x,z) ∈ R
∴ R is transitive relation.

8. B={𝑏1 , 𝑏2 𝑏3 }
G=={𝑔1 , 𝑔2 } 5
n(B)=3 n(G)=2
since n(B× 𝐺) = n(B)×n(G)=3× 2 (1)
6
(A) Number of relation from B to G=2 (1)
𝑛(𝐵×𝐺)
(B) Number of functions from B to G=2
=[𝑛(𝐺)]𝑛(𝐵) = 23 =8 (1)

(C) f={(𝑏1 , 𝑔1 ), (𝑏2 , 𝑔2 ),( 𝑏3 , 𝑔1 )}.

Since 𝑓(𝑏1 ) = 𝑔1 and 𝑓(𝑏3 ) = 𝑔1
⇒ 𝑓(𝑏1 ) = 𝑓(𝑏3 ) but (𝑏1 ) ≠ (𝑏3 )
𝐴𝑠 𝑏1 𝑎𝑛𝑑 𝑏1 represents two different boys.
⇒ f is not one-one.
⇒ f is not bijective map. (2)
9. Reflexivity: 5
For a ∈ 𝐴, we have
|a-a| =0, which is a multiple of 4
R is reflexive.
Symmetric
Let (a,b) ∈ 𝑅
|a-b| is a multiple of 4
|b-a| will also multiple of 4
(b,a) ∈ 𝑅
R is symmetric.
Transitive:
Let (a,b) ,(b,c) ∈ 𝑅
|a-b| is a multiple of 4
|a-b| =4ʎ , a-b= ±4ʎ
|b-c| is a multiple of 4
|b-c| =4μ , b-c= ±4μ
Therefore a-c= ±4 ± 4μ
(a,c) ∈ 𝑅
R is transitive.
For equivalence class:
|x-1|= 0,4,8,12
X=1,5,9

10. y =√16 − 𝑥 2 5
y2= 16 − 𝑥 2
x =√16 − 𝑦 2
clearly for x to be x∈ [−4,4]
16 − 𝑦 2 ≥0
(y-4) (y+4 )≤ 0
0≤y≤4
Therefore it is onto
When x=4 , y=0
When x=-4 ,y=0
So it is not one one
Also—
F(a)= √7
√16 − 𝑎2 = √7
16 − 𝑎2 = 7
a∈ [−3,3]

11. For Reflexive 1

(a, b) R (a, b) ⇒ a + b = b + a which is true since addition is commutative on N.
⇒ R is reflexive.
For Symmetric
Let (a, b) R (c, d) ⇒ a + d = b + c
⇒b+c=a+d 2
⇒c+b=d+a
⇒ (c, d) R (a, b)
 ⇒ R is symmetric.
For Transitive
for (a, b), (c, d),(e, f) in N × N
Let (a, b) R (c, d) and (c, d) R (e, f) 2
⇒a+d=b+c and c + f = d + e
⇒ (a + d) – (d + e) = (b + c) – (c + f)
⇒a-e=b-f⇒a+f=b+e
⇒ (a, b) R (e, f)
⇒ R is transitive.
Hence, R is an equivalence relation.
12. One-One: Suppose 𝑓(𝑥1 ) = 𝑓(𝑥2 ).
Case 1: When 𝑥1 is odd and 𝑥2 is even.
In this case 𝑓(𝑥1 ) = 𝑓(𝑥2 ) ⇒ 𝑥1 + 1 = 𝑥2 − 1 ⇒ 𝑥2 − 𝑥1 = 2 1
This is a contradiction, since the difference between an even natural number and an odd
natural number can never be 2.
Thus in this case 𝑓(𝑥1 ) ≠ 𝑓(𝑥2 ).
Similarly, When 𝑥1 is even and 𝑥2 is odd, then 𝑓(𝑥1 ) ≠ 𝑓(𝑥2 ).
Case 2: When 𝑥1 and 𝑥2 are both odd.
In this case 𝑓(𝑥1 ) = 𝑓(𝑥2 ) ⇒ 𝑥1 + 1 = 𝑥2 + 1 ⇒ 𝑥1 = 𝑥2 1
∴ f is one-one.
Case 3: When 𝑥1 and 𝑥2 are both even.
In this case 𝑓(𝑥1 ) = 𝑓(𝑥2 ) ⇒ 𝑥1 − 1 = 𝑥2 − 1 ⇒ 𝑥1 = 𝑥2 1

∴ f is one-one.
Onto: Let 𝑦 ∈ 𝑁 (𝑐𝑜𝑑𝑜𝑚𝑎𝑖𝑛).
Case 1: When 𝑦 is odd then 𝑦 + 1 is even.
∴ 𝑓(y + 1) = (y + 1) − 1 = y 1

Case 2: When 𝑦 is even then 𝑦 − 1 is odd.

1
∴ 𝑓(y − 1) = (y − 1) + 1 = y.
Thus each 𝑦 ∈ 𝑁 (𝑐𝑜𝑑𝑜𝑚𝑎𝑖𝑛)has its pre-image in dom(𝑓).
∴ 𝑓 is onto.
Hence 𝑓 is both one-one and onto (bijective).