Question 29 - CBSE Class 12 Sample Paper for 2021 Boards - Solutions of Sample Papers and Past Year Papers - for Class 12 Boards
Last updated at August 10, 2026 by Teachoo
Check whether the relation R in the set Z of integers defined as R = {(š, š) ∶ š + š is "divisible by 2"} is reflexive, symmetric or transitive. Write the equivalence class containing 0 i.e. [0].
Note
: This
is similar
to
Example 5
of NCERT –
Chapter 1 Class 12 Relations and Functions
Question 29 Check whether the relation R in the set Z of integers defined as R = {(š, š) ā¶ š + š is "divisible by 2"} is reflexive, symmetric or transitive. Write the equivalence class containing 0 i.e. [0].
R = {(a, b) : š + š is "divisible by 2"}
Check reflexive
Since a + a = 2a
& 2 divides 2a
Therefore,
2 divides a + a
ā“ (a, a) ā R,
ā“ R is reflexive.
Check symmetric
If 2 divides a + b ,
then 2 divides b + a
Hence, If (a, b) ā R, then (b, a) ā R
ā“ R is symmetric
Check transitive
If 2 divides (a + b) , & 2 divides (b + c) ,
So, we can write
a + b = 2k
b + c = 2p
Adding (1) & (2)
(a + b) + (b + c) = 2k + 2p
a + c + 2b = 2k + 2p
a + c = 2k + 2p ā 2b
a + c = 2(k + p ā b)
So, 2 divides (a + c)
ā“ If (a, b) ā R and (b, c) ā R, then (a, c) ā R
Therefore, R is transitive.
Thus, R is an equivalence relation in Z.
Now,
Equivalence class containing 0 i.e. [0]
will be all values of a where one element is 0
Now,
R = {(a, b) : š + š is "divisible by 2"}
Putting b = 0
R = {(a, 0) : š is "divisible by 2"}
So,
[0] = All possible values of a
= {ā¦., ā6, ā4, ā2, 0, 2, 4, 6, ā¦.}
Made by
Davneet Singh
Davneet Singh is an IIT Kanpur graduate and has been teaching for 16+ years. At Teachoo, he breaks down Maths, Science and Computer Science into simple steps so students understand concepts deeply and score with confidence.
Many students prefer Teachoo Black for a smooth, ad-free learning experience.
It looks like you're using AdBlock
Don't be a miser! Join Teachoo Black at ā¹19 only to view the ad-free version of Teachoo.
Please login to view more pages. It's free :)
Teachoo gives you a better experience when you're logged in. Please login :)