Definition:Congruence (Number Theory)/Integer Multiple

Definition
Let $z \in \R$. Let $x, y \in \R$.

Then $x$ is congruent to $y$ modulo $z$ their difference is an integer multiple of $z$:
 * $x \equiv y \pmod z \iff \exists k \in \Z: x - y = k z$

Also see

 * Equivalence of Definitions of Congruence


 * Congruence Modulo $m$ is Equivalence Relation