Table of congruences

In number theory, a congruence is an equivalence relation on the integers. The following sections list important or interesting prime-related congruences.

There are other prime-related congruences that provide necessary and sufficient conditions on the primality of certain subsequences of the natural numbers. Many of these alternate statements characterizing primality are related to Wilson's theorem, or are restatements of this classical result given in terms of other special variants of generalized factorial functions. For instance, new variants of Wilson's theorem stated in terms of the hyperfactorials, subfactorials, and superfactorials are given in.

For integers ${\displaystyle k\geq 1}$, we have the following form of Wilson's theorem:

If ${\displaystyle p}$ is odd, we have that

Clement's congruence-based theorem characterizes the twin primes pairs of the form ${\displaystyle (p,p+2)}$ through the following conditions:

P. A. Clement's original 1949 paper provides a proof of this interesting elementary number theoretic criteria for twin primality based on Wilson's theorem. Another characterization given in Lin and Zhipeng's article provides that

The prime pairs of the form ${\displaystyle (p,p+2k)}$ for some ${\displaystyle k\geq 1}$ include the special cases of the cousin primes (when ${\displaystyle k=2}$) and the sexy primes (when ${\displaystyle k=3}$). We have elementary congruence-based characterizations of the primality of such pairs, proved for instance in the article. Examples of congruences characterizing these prime pairs include

and the alternate characterization when ${\displaystyle p}$ is odd such that ${\displaystyle p\not {\mid }(2k-1)!!^{2}}$ given by