congruence modulo n
Two integers a and b are congruent mod n, written a \equiv b \pmod n, when n divides their difference.
Examples
14 \equiv 2 \pmod{12}, since 12 divides 14-2.
See also
Point table
Graph settings
Calculator