A table of congruences is a systematic way to present the relationships between integers under modular arithmetic. It displays which numbers are congruent to each other modulo a particular base (or modulus). In modular arithmetic, two integers \( a \) and \( b \) are said to be congruent modulo \( n \) (written as \( a \equiv b \mod n \)) if they have the same remainder when divided by \( n \).
New to topics? Read the docs here!