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

Let Z be the set of all integers. A relation R is defined on Z by xRy to mean x-y is divisible by 5. Show that R is an equivalence relation on Z.

Promotional Banner

Similar Questions

Explore conceptually related problems

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 n be a positive integer. Prove that the relation R on the set Z of all integers numbers defined by (x , y) in R iff x-y is divisible by n , is an equivalence relation on Z.

Let n be a positive integer. Prove that the relation R on the set Z of all integers numbers defined by (x , y) in R iff x-y is divisible by n , is an equivalence relation on Z.

Let n be a positive integer. Prove that the relation R on the set Z of all integers numbers defined by (x , y) in R iff x-y is divisible by n , is an equivalence relation on Z.

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.

A relation R is defined on the set of all integers Z Z follows : (x,y) in "R" implies (x,y) is divisible by n Prove that R is an equivalence relation on Z Z .

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 n be a positive integer.Prove that the relation R on the set Z of all integers numbers defined by (x,y)in R hArr x-y is divisible by n, is an equivalence relation on Z .

Relation R on Z defined as R = {(x ,y): x - y "is an integer"} . Show that R is an equivalence relation.