Legendre symbol

Legendre symbol is a multiplicative arithmetic function that encodes quadratic residuosity modulo an odd prime and plays a central role in classical algebraic number theory, modular arithmetic, and analytic investigations. It connects to the work of figures such as Adrien-Marie Legendre, Carl Friedrich Gauss, Leonhard Euler, Évariste Galois, and institutions like the École Polytechnique through proofs, generalizations, and teaching. The symbol appears in theorems and algorithms studied at University of Göttingen, University of Paris, Royal Society, and in modern computational settings at laboratories such as Bell Labs and organizations like IBM.

Definition

For an odd prime p and an integer a, the Legendre symbol is defined as 1 if a is a nonzero quadratic residue modulo p, −1 if a is a quadratic nonresidue modulo p, and 0 if p divides a. This definition links to early contributions by Adrien-Marie Legendre and complements Euler's criterion, which appeared in correspondence with Leonhard Euler and influenced Gauss's treatments in his work like Disquisitiones Arithmeticae. The notion is foundational for later advances at institutions such as Princeton University, Harvard University, University of Cambridge, and for mathematicians including Sophie Germain, Joseph-Louis Lagrange, and Niels Henrik Abel.

Properties

The Legendre symbol is multiplicative: (ab|p) = (a|p)(b|p), a property used extensively by Gauss in his lemmas and by later researchers at ETH Zurich and Institute for Advanced Study. It satisfies Euler's criterion: (a|p) ≡ a^{(p-1)/2} (mod p), connecting to exponentiation algorithms studied at Bell Labs and AT&T Laboratories. Quadratic character behavior relates to characters in the representation theory developed at École Normale Supérieure and in the work of Emmy Noether and Helmut Hasse. Reciprocity laws constrain values via congruences tied to primes studied at University of Göttingen and in problems pursued by Srinivasa Ramanujan and Bernhard Riemann. Supplementary signs for (−1|p) and (2|p) are given by explicit congruences used by Gauss and applied in analyses at Columbia University and Stanford University.

Computation and algorithms

Computing the Legendre symbol efficiently is crucial for applications in computational number theory and cryptography, pursued at MIT, Bell Labs, IBM Research, and Microsoft Research. Use of Euler's criterion reduces computation to modular exponentiation, implemented via fast exponentiation algorithms associated with engineers at AT&T Laboratories and researchers at Intel Corporation. The law of quadratic reciprocity enables reduction of (a|p) to simpler symbols via modular reductions, a technique employed by software projects originating at University of California, Berkeley, Princeton University, and University of Oxford. Algorithms for symbol evaluation are embedded in libraries developed by contributors at GNU Project, Wolfram Research, SageMath teams, and developers at Google and Amazon Web Services for cryptographic protocols influenced by standards from IETF and NIST.

Quadratic reciprocity and generalizations

Quadratic reciprocity, first conjectured by Adrien-Marie Legendre and proved by Carl Friedrich Gauss, relates Legendre symbols for distinct odd primes p and q and is celebrated in Gauss's proofs linked to institutions such as University of Göttingen. The theorem has many proofs contributed by mathematicians like Gauss, Eisenstein, Jacobi, and later generalizations by Hilbert and Artin leading to the Hilbert symbol and Artin reciprocity central to class field theory developed at Princeton University and University of Hamburg. Generalizations include Jacobi symbols, Kronecker symbols, Hilbert symbols, and higher residue symbols studied by Emil Artin, David Hilbert, Helmut Hasse, Emmy Noether, and applied in modern work at Institut des Hautes Études Scientifiques and Max Planck Institute for Mathematics.

Applications in number theory

Legendre symbols underpin primality testing methods like Solovay–Strassen and are used in quadratic sieve and class group computations investigated at RSA Security and research groups at CWI and D.E. Shaw Research. Their role appears in genus theory explored by Gauss and expanded by Dirichlet and Kummer in studies at University of Berlin and University of Halle-Wittenberg. Connections to L-functions and modular forms link the symbol to the work of Bernhard Riemann, Goro Shimura, Andrew Wiles, and research at Institute for Advanced Study. In cryptography, quadratic residuosity and Legendre-type tests inform protocols analyzed at Stanford University, MIT, RSA Laboratories, and companies like Google and Microsoft. Research on reciprocity and higher residues informs algebraic number theory at Harvard University, Yale University, University of Chicago, and in international collaborations across European Research Council grants.

Category:Number theory