Home
Class 12
MATHS
Let Z be the set of all integers and ...

Let `Z` be the set of all integers and `R` be the relation on `Z` defined as `R={(a , b); a ,\ b\ in Z ,` and `(a-b)` is divisible by `5.}` . Prove that `R` is an equivalence relation.

Promotional Banner

Similar Questions

Explore conceptually related problems

Let Z be the set of all integers and R be the relation on Z defined by R= { (a,b): a, b in Z and (a-b) is divisible by 5} . Prove that R is an equivalence relation

If Z is the set of all integers and R is the relation on Z defined as R={(a, b): a, b in Z and a-b is divisible by 3. Prove that R is an equivalence relation.

Let R={(a,b):a,b in Z and (a-b) is divisible by 5}. Show that R is an equivalence relation on Z.

Let Z be the set of all integers and let R be a relation on Z defined by a Rb implies a ge b . then R is

Let Z be the set of a integers and let R be a relation on z defined by a Rb hArr a>=b. Then,R is

Let m be a given fixed positive integer. Let R={(a.b) : a,b in Z and (a-b) is divisible by m} . Show that R is an equivalence relation on Z .

Let m be a given fixed positive integer. Let R={(a.b) : a,b in Z and (a-b) is divisible by m} . Show that R is an equivalence relation on Z .

In the set of all natural numbers,let a relation defined by {(a,b):a,binN,a-b is divisible by 5} .Prove that R is an equivalence relation.