Home
Class 12
MATHS
[" 33.Let Z be the set of all integers a...

[" 33.Let Z be the set of all integers and "R" be 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 as R={(a , b); a ,\ b\ in Z , and (a-b) is divisible by 5.} . Prove that R is an equivalence relation.

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.

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.

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.

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.

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

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.

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.