Skip to content

Congruence

Defines Congruence, congruence

Two integers aa and bb are congruent modulo nn (written ab(modn)a \equiv b \pmod{n}) if nn divides aba - b.

Congruence modulo nn is an equivalence relation on Z\mathbb{Z}. It is compatible with addition and multiplication: if aa(modn)a \equiv a' \pmod{n} and bb(modn)b \equiv b' \pmod{n}, then a+ba+b(modn)a + b \equiv a' + b' \pmod{n} and abab(modn)ab \equiv a'b' \pmod{n}. This compatibility is what makes the quotient group Z/nZ\mathbb{Z}/n\mathbb{Z} a ring.

Relations

Date created

Cite

@misc{emsenn2026-congruence,
  author    = {emsenn},
  title     = {Congruence},
  year      = {2026},
  url       = {https://emsenn.net/library/math/domains/number-theory/terms/congruence/},
  publisher = {emsenn.net},
  license   = {CC BY-SA 4.0}
}