This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Z/pZ | |
|---|---|
| Name | Z/pZ |
| Type | Quotient ring / Field (for p prime) |
| Notation | Z/pZ, Z_p (mod p) |
| Related | Finite field, Residue class ring |
Z/pZ Z/pZ denotes the set of integers modulo a prime p endowed with addition and multiplication modulo p. It appears throughout number theory, algebraic geometry, and coding theory and connects to work by Carl Friedrich Gauss, Évariste Galois, Niels Henrik Abel, David Hilbert, and Emmy Noether. Frequently used in constructions linked to the Fermat's Last Theorem investigations by Andrew Wiles and in algorithms developed by Alan Turing and Claude Shannon.
Z/pZ is defined as the quotient of the ring of integers by the ideal generated by the prime p, with elements being equivalence classes of integers under congruence modulo p. The notation follows classical sources such as Gauss's Disquisitiones Arithmeticae and later treatments by Richard Dedekind and Emil Artin. In arithmetic contexts one encounters equivalent notations in expositions by Srinivasa Ramanujan or in presentations of the Prime Number Theorem by Jacques Hadamard and Charles-Jean de la Vallée Poussin.
As a quotient of the ring of integers, Z/pZ inherits a commutative ring structure with unity; when p is prime it becomes a simple example of a finite field used in the work of Évariste Galois and formalized by Stefan Banach-era algebraists like Emmy Noether. The additive group is cyclic of order p, a property exploited in proofs by Leonhard Euler and in cyclic group theory developed alongside the Sylow theorems by Ludwig Sylow and William Burnside. Multiplicative inverses for nonzero classes yield a cyclic group of order p−1 in many classical examples studied by Adrien-Marie Legendre and Sophie Germain.
For prime p, Z/pZ is a field often denoted GF(p) in coding and cryptography literature influenced by Claude Shannon and Robert McEliece. It provides the simplest nontrivial examples in the classification of finite fields by Évariste Galois and later expositions by Emil Artin and Jean-Pierre Serre. The multiplicative group structure underlies results such as Fermat's little theorem associated with Pierre de Fermat and used in primality tests refined by Gary Miller and Rabin. Z/pZ serves as the base field in constructions considered in Alexander Grothendieck's work on schemes and in André Weil's formulations of zeta functions for varieties over finite fields, which relate to the Weil conjectures proved by Pierre Deligne.
Representative residues are chosen from standard sets like {0,1,...,p−1} or symmetric representatives {−(p−1)/2,...,(p−1)/2} as in treatments by Carl Friedrich Gauss and textbooks by Harold Davenport and Tom M. Apostol. Computational routines due to Donald Knuth and implementations in libraries influenced by John von Neumann adopt canonical representatives for modular reduction and modular inverse algorithms trace conceptually to Édouard Lucas and later optimizations by Donald Knuth and Ron Rivest. Reduction, lifting, and Hensel-type arguments relate to techniques used by Kurt Hensel and appear in local-global principles discussed by Helmut Hasse.
Z/pZ appears in public-key cryptography schemes influenced by Ron Rivest, Adi Shamir, and Leonard Adleman and in elliptic curve cryptography following work of Neal Koblitz and Victor S. Miller. It is fundamental in error-correcting codes developed by Elwyn Berlekamp and Richard Hamming and in combinatorial designs studied by John von Neumann and Paul Erdős. Finite geometry over Z/pZ underlies projective plane examples used by László Fejes Tóth and in constructions by H. S. M. Coxeter. Applications also include random number generators inspired by John von Neumann and pseudorandomness work by Donald Knuth.
Generalizations include the ring Z/nZ for composite n appearing in the Chinese remainder theorem developed by Chinese mathematicians and rediscovered by Leonhard Euler and Carl Friedrich Gauss, and finite fields GF(p^k) classified by Évariste Galois and Emil Artin. Localizations and p-adic completions lead to the p-adic numbers studied by Kurt Hensel and used in the Langlands program advocated by Robert Langlands and explored by Pierre Deligne and Michael Harris. Group rings, Witt vectors introduced by Ernst Witt, and modular representation theory treated by Alperin and Brauer extend the role of residue fields in modern algebra and number theory.
Category:Finite fields