0
$\begingroup$

I have found that if,

a ≡ b (mod m)

then

b ≡ a (mod m)

The meaning of a ≡ b (mod m) is that m | (a-b) & the meaning of b ≡ a (mod m) is that m | (b-a) but , (a-b) is opposite to (b-a) So , are we taking only the absolute value of the differences between a & b when we are dealing with congruence modulo?

$\endgroup$

3 Answers 3

2
$\begingroup$

For any integers $r,s$, we have $r\mid s$ $\iff$ $r\mid-s$.

$\endgroup$
1
$\begingroup$

$b \mid a$ means there's $c$ such that $a = b c$. Then $-a = b (-c)$, so that $b \mid -a$.

$\endgroup$
0
$\begingroup$

$a\equiv b\mod m$ can also be translated as

$a$ and $b$, divided by $c$, have the same remainder.

Hence the congruence relation is obviously reflexive, symmetric and transitive.

$\endgroup$
0

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .