Prove that the relation 'Congruence modu...

Prove that the relation 'Congruence modulo, m' on the set Z of all integers is an equivalence relation.

RELATIONS AND FUNCTIONS
ARIHANT PUBLICATION|Exercise Sample Question ( PART -II)|7 Videos
RELATIONS AND FUNCTIONS
ARIHANT PUBLICATION|Exercise Sample Question ( PART -III)|5 Videos
QUESTION PAPER 2020
ARIHANT PUBLICATION|Exercise GROUP C (ANSWER ANY ONE QUESTIONS)|13 Videos
SAMPLE PAPER 1
ARIHANT PUBLICATION|Exercise LONG ANSWER TYPE QUESTIONS|13 Videos

Similar Questions

Explore conceptually related problems

Congruence modulo 3 relation partitions the set Z into how many equivalence classes ?

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.

Show that the relation R defined on the set Z of all integers defined as R={(x,y):x-y is an integer} is reflexive, symmertric and transtive.

Show that the relation S defined on set N xx N by (a, b) S(c,d) rArr a+d=b+c is an equivalence relation.

Let R be the relation on Z defined by aRb iff a-b is an even integer. Show that R is an equivalence relation.

Show that the relation R on the set Z of integers given by R = {(a,b): 2 divides (a - b)} is an equivalence relation.

Show that the relation R on Z – {0} defined by R={(m,n)|frac[m][n] is power of 5} is an equivalence relation.

Write the smallest equivalence relation on A = {1,2,3}.

If R and S are two equivalence relation on the set then prove that RcapS is also an equivlaence relation on the set.