Linked from

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

• IntegerRelated: It studies integer calculations through their remainders.

• Diophantine equationRelated: Modular reductions provide quick necessary conditions for integer solutions.

• Greatest common divisorRelated: Coprimality with the modulus determines whether multiplication has an inverse.

• Fermat's little theoremRelated: It is the setting in which the theorem's power identity is expressed.

• Fibonacci sequenceRelated: Fibonacci numbers modulo an integer form periodic patterns.

• Pierre de FermatRelated: Fermat’s little theorem became a foundational result in arithmetic modulo primes.

• Cyclic groupRelated: Residue classes modulo n form the additive cyclic group of order n.

• AdditionRelated: Addition can be performed on residue classes, with results reduced modulo a chosen integer.

• Quotient ringRelated: It is arithmetic inside the quotient ring of integers modulo a principal ideal.

• Ring (mathematics)Related: Residue classes form quotient rings that model modular calculations.

• Binary operationRelated: Remainder classes support binary operations that wrap around a finite set.

• Dirichlet L-functionRelated: Character values depend on residue classes modulo the character’s modulus.

• Euclid's lemmaRelated: Modulo the prime, a nonzero factor has a multiplicative inverse, forcing the other factor to vanish.

• Legendre symbolRelated: Its residue classes are the setting in which the symbol distinguishes squares from nonsquares.

• Inverse elementRelated: Multiplicative inverses modulo an integer exist precisely for residues coprime to it.

• Parity bitRelated: Parity is the sum of bits modulo two.

• RemainderRelated: It treats equal remainders as the same arithmetic class.

• SubtractionRelated: Subtraction still operates on residues, but results are interpreted modulo a fixed number.

• Perfect squareRelated: Squares occupy only certain remainder classes, ruling out many candidates.

• Finite cyclic groupRelated: Addition modulo the group order gives a standard model for every finite cyclic group.

• Multiplicative orderRelated: Residue classes provide standard examples of finite multiplicative groups.

• XOR gateRelated: Two-input XOR is addition modulo 2, but this arithmetic framing differs from gate behavior.

• Édouard LucasRelated: Congruences provide the language for expressing many of Lucas’s primality criteria.

• Fermat numberRelated: Congruences make Fermat numbers’ divisibility properties easier to express and prove.

• Repeating decimalRelated: Repeated remainders in modular arithmetic account for cycles in decimal digits.

• Number (mathematics)Related: Modular arithmetic lets integers model cycles such as clock time and computer data.

• Sum of two squares theoremRelated: Residue classes modulo 4 divide primes into the cases used by the theorem.

• Caesar cipherRelated: The alphabet’s wraparound makes each letter shift an addition modulo 26.

• Collatz conjectureRelated: Congruence classes help describe possible sequences of odd and even steps.

• Erdős–Straus conjectureRelated: Residue classes organize proofs and computational checks of the conjecture.

• Star polygonRelated: Vertex selection advances by a fixed step modulo the polygon's number of vertices.

• Sophie Germain's identityRelated: The factors can be examined modulo primes to derive divisibility restrictions.

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

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

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