Linked from

The 62 pages that link to Modular arithmetic, each with the reason it gives.

• Agoh–Giuga conjectureNarrower topic: The conjecture's defining condition is a congruence modulo n.

• Agrawal's conjectureRelated: All coefficients in the conjectured identity are compared modulo the candidate integer.

• Beal's conjectureRelated: Congruences can rule out exponent and residue patterns in candidate equations.

• Catalan–Mersenne conjectureRelated: Congruences expose factors and restrictions on possible prime terms.

• Generalized Petersen graphRelated: The inner cycle's connectivity depends on the residues generated by k modulo n.

• Lonely runner conjectureRelated: Positions on a unit track are computed modulo one.

• Midy's theoremNarrower topic: Remainder relationships modulo p explain why the halves combine to a string of n nines.

• Number (identifier)Related: Many check-digit rules rely on modular sums or remainders.

• Proth's theoremNarrower topic: The theorem's defining condition is a congruence modulo the candidate.

• Schinzel's theoremNarrower topic: The theorem's roots are solutions in modular arithmetic for infinitely many prime moduli.

• Unit (ring theory)Related: A residue class modulo n is a unit exactly when its representative is coprime to n.

• Wolstenholme's theoremNarrower topic: The theorem's conclusion is a modular equality modulo p³.