Linked from

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

• DivisibilityNarrower topic: It uses divisibility to define when two integers count as equivalent.

• Chinese remainder theoremNarrower topic: It supplies the arithmetic setting in which the theorem operates.

• Congruence (number theory)Narrower topic: Congruence is the relation that makes this arithmetic possible.

• Euler's totient functionNarrower topic: Coprime integers up to n represent the invertible residue classes modulo n.

• Quadratic reciprocityNarrower topic: The theorem compares square classes in two different modular systems.

• Primality testNarrower topic: Most efficient primality tests reduce huge powers to computations modulo the candidate integer.

• Quadratic residueNarrower topic: Quadratic residues are defined by equality of squares within this arithmetic.

• Modular exponentiationNarrower topic: Modular exponentiation is exponentiation performed within this arithmetic system.

• Shor's algorithmNarrower topic: The algorithm's order-finding subroutine studies powers and periods within modular arithmetic.

• Two's complementNarrower topic: Fixed-width two's-complement addition behaves as arithmetic modulo the word size's power of two.

• Even numberNarrower topic: Calculating modulo 2 reduces parity questions to two residue classes.

• Jacobi symbolNarrower topic: Residues and congruences provide the setting for interpreting the symbol’s numerator.

• Hensel's lemmaNarrower topic: The initial root and its successive lifts are solutions in residue rings.

• Wilson's theoremNarrower topic: The theorem expresses factorials as congruences modulo n.

• Divisibility ruleNarrower topic: Divisibility rules work by determining whether a number’s remainder modulo the divisor is zero.

• PseudoprimeNarrower topic: Pseudoprime tests compare powers and residues within this arithmetic.

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

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

• 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.

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