Quartic reciprocity

Quartic or biquadratic reciprocity is a collection of theorems in elementary and algebraic number theory that state conditions under which the congruence x4 ≡ p (mod q) is solvable; the word "reciprocity" comes from the form of some of these theorems, in that they relate the solvability of the congruence x4 ≡ p (mod q) to that of x4 ≡ q (mod p). Euler made the first conjectures about biquadratic reciprocity. Gauss published two monographs on biquadratic reciprocity. In the first one (1828) he proved Euler's conjecture about the biquadratic character of 2. In the second one (1832) he stated the biquadratic reciprocity law for the Gaussian integers and proved the supplementary formulas. He said that a third monograph would be forthcoming with the proof of the general theorem, but it never appeared. Jacobi presented proofs in his Königsberg lectures of 1836–37. The first published proofs were by Eisenstein. Since then a number of other proofs of the classical (Gaussian) version have been found, as well as alternate statements. Lemmermeyer states that there has been an explosion of interest in the rational reciprocity laws since the 1970s. A quartic or biquadratic residue (mod p) is any number congruent to the fourth power of an integer (mod p). If x4 ≡ a (mod p) does not have an integer solution, a is a quartic or biquadratic nonresidue (mod p). As is often the case in number theory, it is easiest to work modulo prime numbers, so in this section all moduli p, q, etc., are assumed to positive, odd primes. The first thing to notice when working within the ring Z of integers is that if the prime number q is ≡ 3 (mod 4) then a residue r is a quadratic residue (mod q) if and only if it is a biquadratic residue (mod q). Indeed, the first supplement of quadratic reciprocity states that −1 is a quadratic nonresidue (mod q), so that for any integer x, one of x and −x is a quadratic residue and the other one is a nonresidue.