We say that two integers $a$ and $b$ are congruent modulo $m$ if $a − b$ is divisible by $m$. We denote this by $a≡b \pmod m$.
Example 1: $−31 ≡ 11 \pmod 7$
$11 \pmod 7$ is $4$, is it not? $-31 \neq 4$ last time I checked.
Asked
Active
Viewed 2,558 times
3
-
You're confusing two different (but related) uses of "mod", as a binary operation vs. equivalence relation. See this post for further explanation. – Bill Dubuque Nov 28 '12 at 03:49
1 Answers
5
Hint: trying subtracting $11$ from $-31$: $\quad -31 - 11 = -42 = -6\cdot 7$.
That is, $7|-42$.
$a\equiv b \pmod m$ by definition means $m|(a - b)$.
Hence, in the case at hand, $-31\equiv 11 \pmod{7}.$
amWhy
- 209,954
-
Where did 71 come from? I know $7 | -42 $, but how does -31 EQUAL 11 mod 7? – Doug Smith Nov 28 '12 at 02:20
-
That's not $71$, it's $7|-42$. I removed the space between "7" and "divides" – amWhy Nov 28 '12 at 02:24
-
-
To quote your post: "We say that two integers a and b are congruent modulo m if a − b is divisible by m"... $a\equiv b \pmod m$ reads $a$ is congruent to $b$, modulo $m$. – amWhy Nov 28 '12 at 02:36
-