Home
Class 12
MATHS
Let n be a positive integer. Prove that...

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.

Promotional Banner

Similar Questions

Explore conceptually related problems

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 .

Let R be a relation on the set Z of all integers defined by:(x,y) in R implies(x-y) is divisible by n is eqivalence

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 .

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

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.

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.

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.

A relation R on the set of natural number N N is defined as follows : (x,y) in R to (x-y) is divisible by 5 for all x,y in N N Prove that R is an equivalence relation on N N .

Let R be the relation in the set Z of all integers defined by R= {(x,y):x-y is an integer}. Then R is