Congruence Modulo Integer/Examples/12 equiv 0 mod 3
Jump to navigation
Jump to search
Example of Congruence Modulo an Integer
- $12 \equiv 0 \pmod 3$
Proof
By definition of congruence:
- $x \equiv y \pmod n$ if and only if $x - y = k n$
for some $k \in \Z$.
We have:
- $12 - 0 = 12 = 4 \times 3$
Thus:
- $12 \equiv 0 \pmod 3$
$\blacksquare$
Sources
- 1964: Walter Ledermann: Introduction to the Theory of Finite Groups (5th ed.) ... (previous) ... (next): Chapter $\text {I}$: The Group Concept: $\S 6$: Examples of Finite Groups: $\text{(iii)}$