The system of arithmetic on integers taken with respect to congruence relations modulo a fixed modulus n; integers are partitioned into residue classes and operations are performed on these classes, yielding the ring Z/nZ and the field F_p when n is prime.

Principle

Define an equivalence relation a ≡ b (mod n) when n divides a−b; perform addition and multiplication on equivalence classes (residues) so that calculations respect the modulus and pass to well-defined operations on Z/nZ.

Demonstration

Working modulo 12, 17 ≡ 5 (mod 12) and 7·5 ≡ 35 ≡ 11 (mod 12). When n=7 (prime), every nonzero residue has a multiplicative inverse, so computations can be carried out in the finite field F_7.

Misapplication

Treating an element as invertible modulo n without checking gcd(element,n)=1 (for example assuming 6 has an inverse mod 12); or conflating a residue class with a particular representative and drawing conclusions that depend on that choice.

Consequence

Gives a compact language for congruence reasoning, underpins number-theoretic algorithms and cryptography, and leads to algebraic structures (rings, fields) that make solving congruences and linear/arithmetic problems systematic.

Reversal

Viewing arithmetic solely on the infinite ordered set of integers with absolute values and inequalities, ignoring the cyclic and class-based identifications modulo n; this reversal emphasizes total order and divisibility over class operations.

Boundary

Applies to integer congruences modulo a fixed positive integer n and to algebraic consequences thereof; does not encompass unrelated notions called 'modular' in other contexts (for example modular forms), and structural properties depend critically on gcd conditions and primality of n.

Semantic Tension

Tension between thinking of residues as representative integers (concrete representatives) versus as abstract equivalence classes (the algebraic objects of Z/nZ); many mistakes arise from switching perspectives without tracking invariance under choice of representative.

Synthesis

A structural arithmetic framework that quotients integers by the congruence relation modulo n to produce residue classes with well-defined addition and multiplication, yielding rings and, when n is prime, fields useful for computation and theory.