"Two integers, a and b, are congruent modulo n (written a ≡ b (mod n)) if their difference (a - b) is divisible by n. In other words, a and b have the same remainder when divided by n." Congruence ...