Number Theory
Basic

Modular Congruence

a and b have the same remainder when divided by m.

Formula

a≡b(modm)a \equiv b \pmod{m}

Variables

a, bIntegers
mModulus

Example

17 ≡ 5 (mod 12)

Did You Know?

Modular "clock" arithmetic underpins all modern cryptography, from online banking to messaging apps.

modularcongruence