Linked from

The 23 pages that link to Congruence (number theory), each with the reason it gives.

• DivisibilityRelated: Divisibility by a modulus is equivalent to congruence with zero.

• Diophantine equationRelated: Reducing an equation modulo an integer can expose impossible solution patterns.

• p-adic numberRelated: Agreement modulo p to high powers is the arithmetic form of p-adic closeness.

• Pell equationRelated: Congruence restrictions can rule out candidate solutions for particular values of D.

• p-adic valuationRelated: Valuation bounds translate directly into divisibility and congruence conditions modulo powers of p.

• Jacobi symbolRelated: The Jacobi symbol’s residue interpretation is expressed through congruences modulo its denominator.

• Vinogradov's theoremRelated: Local congruence restrictions determine whether a three-prime representation is arithmetically possible.

• Ramanujan–Nagell equationRelated: Congruences eliminate many possible values of x and n before deeper arguments are needed.

• Zsigmondy's theoremRelated: Prime divisors of aⁿ − bⁿ encode congruences between powers of a and b.

• Legendre's three-square theoremRelated: The forbidden family is described through powers of 4 and a residue class modulo 8.

• Sophie Germain's theoremRelated: The proof tracks powers modulo p and 2p+1 to constrain possible solutions.

• Chevalley–Warning theoremRelated: Divisibility of the solution count is expressed as a congruence modulo the characteristic.

• Von Staudt–Clausen theoremRelated: The theorem is commonly expressed as a congruence modulo integers.