CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
5
You visited us 5 times! Enjoying our articles? Unlock Full Access!
Question

Let R be a relation on the set of integers given by a=2k.b for some integer k. Then R is:


A

reflexive but not symmetric

No worries! We‘ve got your back. Try BYJU‘S free classes today!
B

reflexive and transitive but not symmetric

No worries! We‘ve got your back. Try BYJU‘S free classes today!
C

equivalence relation

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
D

symmetric and transitive but not reflexive

No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is C

equivalence relation


Explanation for correct option:

Option C: equivalence relation

A relation on set R on a set of A is said to be an equivalence relation if it is reflexive, symmetric and transitive.

A relation R on a set A is Reflexive if a,aR

In given set of integer a=2k.b where k is an integer,

Let's assume k=0 (an integer)

a=2k.b

a=20.b

a=b

Thus, for every value will be in form of a,a, that means R is reflexive.

A relation R on a set A is Symmetric if a,bRb,aR

In a given set of integer a=2k.b where k is an integer,

If a=2k.b then b=2-ka where k,-k are integer.

a,bR then b,aR

Thus, R is symmetric.

A relation R on a set A is transitive if a,bRb,cRa,cR

In a given set of integer a=2k.b where k is an integer,

If a=2k.b and b=2kc

then c=2k.a.

where 2k=ab=bc=ca where k is any integer.

Thus, R is Transitive.

As, the relation a=2k.b is reflexive, symmetric, and transitive it means it is an equivalence relation.


flag
Suggest Corrections
thumbs-up
1
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon