(a) Let $m$ be a positive integer greater than 2 . Show that the relation $R$ consisting of those ordered pairs of integers (a, b) with $a \equiv \pm b$ (mod m) is an equivalence relation.
(b) Describe the equivalence classes of this relation where $m$=4 .

Question

(a) Let $m$ be a positive integer greater than 2 . Show that the relation  $R$  consisting of those ordered pairs of integers  (a, b)  with $a \equiv \pm b$ (mod m)  is an equivalence relation.
(b) Describe the equivalence classes of this relation where  $m$=4 .

Quizplus · Accepted Answer

The Answer of (a) Let $m$ be a positive integer greater than 2 . Show that the relation  $R$  consisting of those ordered pairs of integers  (a, b)  with $a \equiv \pm b$ (mod m)  is an equivalence relation.
(b) Describe the equivalence classes of this relation where  $m$=4 .

(A) Let mmm Be a Positive Integer Greater Than 2 RRR Consisting of Those Ordered Pairs of Integers (A, B)

(A) Let $m$ Be a Positive Integer Greater Than 2 $R$ Consisting of Those Ordered Pairs of Integers (A, B)