A complete set of representatives modulo n consisting exclusively of integers coprime to n; equivalently a set R ⊂ {0,…,n-1} with |R| = φ(n) such that every integer coprime to n is congruent modulo n to exactly one element of R.

Principle

The organizing idea is to select one representative from each unit (invertible) residue class modulo n so that multiplication (and inversion) is meaningful within the set of representatives and mirrors the multiplicative group (Z/nZ)^×.

Demonstration

For n = 8 a reduced residue system is {1, 3, 5, 7} since these are the integers in {0,…,7} coprime to 8; φ(8) = 4 and these classes form the multiplicative group modulo 8.

Misapplication

Including integers not coprime to n among representatives, or assuming any ordering of representatives carries algebraic meaning; also mistaking a reduced residue system for a complete residue system that includes noncoprime classes.

Consequence

Correct identification yields a finite model of the multiplicative units modulo n, enabling inversion, order computations, Euler's theorem, and group-theoretic analysis restricted to (Z/nZ)^×.

Reversal

The reverse concept is a full complete residue system modulo n (a representative set for all classes) or considering the set of nonunits, both of which lack multiplicative invertibility across all representatives.

Boundary

Defined for modulus n≥1; trivial cases occur when φ(n)=1 (e.g. n=1,2). The system concerns only integers coprime to n and excludes zero divisors and classes represented by numbers sharing factors with n.

Semantic Tension

Tension arises between choosing canonical minimal representatives (e.g. least positive residues) and other convenient representatives; also between the algebraic view (group of units) and the combinatorial listing of integers.

Synthesis

A reduced residue system modulo n collects one representative from each invertible congruence class, producing a concrete finite set that models the multiplicative group of units (Z/nZ)^× and supports inversion and multiplicative reasoning modulo n.