# User:Virginia-American/Sandbox/Quartic Reciprocity

Quartic or biquadratic reciprocity is a collection of theorems in elementary and algebraic number theory that state conditions under which the congruence x4p (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 x4p (mod q) to that of x4q (mod p).

## History

Euler made the first conjectures about biquadratic reciprocity.[1] Gauss published two memoirs 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[2] 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.[3] The first published proofs were by Eisenstein.[4][5][6][7]

Since then a number of other proofs of the classical (Gaussian) version have been found,[8] as well as alternate statements. Lemmermeyer states that there has been an explosion of interest in the rational reciprocity laws since the 1970's.[9] (Here "rational" means laws that are stated in terms of ordinary integers rather in terms of the integers of some algebraic number field.)

## Integers

A quartic or biquadratic residue (mod p) is any number congruent to the fourth power of an integer (mod p). If x4a (mod p) does not have an integer solution, a is a quartic or biquadratic nonresidue (mod p).[10]

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.[11]

### Gauss

The first thing to notice when working within the ring Z of integers is that if the prime number q is ≡ 3 (mod 4) every quadratic residue is also a biquadratic residue; by the first supplement of quadratic reciprocity −1 is a quadratic nonresidue (mod q), and since modulo any prime the product of two quadratic nonresidues is a residue, if x is not ≡ 0 (mod q) then one of x, −x is a quadratic residue and the other one is a nonresidue. Thus, if ra2 (mod q) is a quadratic residue, then if ab2 is a residue, ra2b4 (mod q) is a biquadratic residue, and if a is a nonresidue, −a is a residue, −ab2, and again, r ≡ (−a)2b4 (mod q) is a biquadratic residue.[12]

Therefore, the only interesting case is when the modulus p ≡ 1 (mod 4), and we will restrict ourselves to that case.

Gauss proved[13] that if p ≡ 1 (mod 4) then the nonzero residue classes (mod p) can be divided into four sets, each containing (p−1)/4 numbers. Let e be a quadratic nonresidue. The first set is the quartic residues; the second one is e times the numbers in the first set, the third is e2 times the numbers in the first set, and the third one is e3 times the numbers in the first set. Another way to describe this division is to let g be a primitive root (mod p); then the first set is all the numbers whose indices with respect to this root are ≡ 0 (mod 4), the second set is all those whose indices are ≡ 1 (mod 4), etc.[14] In the vocabulary of group theory, the first set is a subgroup of index 4 (of the multiplicative group Z/pZ×), and the other three are its cosets.

The first set is the biquadratic residues, the third set is the quadratic residues that are not quartic residues, and the second and fourth sets are the quadratic nonresidues. Gauss proved that −1 is a biqudratic residue if p ≡ 1 (mod 8) and a quadratic, but not biquadratic, residue, when p ≡ 5 (mod 8).[15]

2 is a quadratic residue mod p if and only if p ≡ ±1 (mod 8). Since we're only considering p ≡ 1 (mod 4), this means p ≡ 1 (mod 8). Every such prime is the sum of a square and twice a square.[16]

Gauss proved[17]

Let q = a2 + 2b2 ≡ 1 (mod 8) be a prime number. Then 2 is a biquadratic residue (mod q) if and only if a ≡ ±1 (mod 8); if a ≡ ±3 (mod 8) then 2 is quadratic, but not a biquadratic, residue (mod q).

Every prime p ≡ 1 (mod 4) is the sum of two squares.[18] If p = a2 + b2 where a is odd and b is even, Gauss proved[19] that

2 belongs to the first (respectively second, third, or fourth) class defined above if and only if b ≡ 0 (resp. 2, 4, or 6) (mod 8). The first case of this is Euler's conjecture:

2 is a biquadratic residue of a prime p ≡ 1 (mod 4) if and only if p = a2 + 64b2.

### Dirichlet

For an odd prime number p and a quadratic residue a (mod p), Euler's criterion states that ${\displaystyle a^{\frac {p-1}{2}}\equiv 1{\pmod {p}}.}$

Thus, if p ≡ 1 (mod 4), ${\displaystyle a^{\frac {p-1}{4}}\equiv \pm 1{\pmod {p}}.}$

Define the rational quartic residue symbol for prime p ≡ 1 (mod 4) and biquadratic residue a (mod p) as ${\displaystyle {\Bigg (}{\frac {a}{p}}{\Bigg )}_{4}=\pm 1\equiv a^{\frac {p-1}{4}}{\pmod {p}}.}$ It is easy to prove that a is a biquadratic residue (mod p) if and only if ${\displaystyle {\Bigg (}{\frac {a}{p}}{\Bigg )}_{4}=1.}$

Dirichlet[20] simplified Gauss's proof of the biquadratic character of 2 (his proof only requires quadratic reciprocity for the integers) and put the result in the following form:

Let p = a2 + b2 ≡ 1 (mod 4) be prime, and let ib/a (mod p). Then

${\displaystyle {\Bigg (}{\frac {2}{p}}{\Bigg )}_{4}\equiv i^{\frac {ab}{2}}.}$     (Note that i2 ≡ −1 (mod p).)

In fact,[21] let p = a2 + b2 = c2 + 2d2 = e2 − 2f2 ≡ 1 (mod 8) be prime, and assume a is odd. Then

${\displaystyle {\Bigg (}{\frac {2}{p}}{\Bigg )}_{4}=\left(-1\right)^{\frac {b}{4}}={\Bigg (}{\frac {2}{c}}{\Bigg )}=\left(-1\right)^{n+{\frac {d}{2}}}={\Bigg (}{\frac {-2}{e}}{\Bigg )},}$   where ${\displaystyle ({\tfrac {x}{q}})}$ is the ordinary Legendre symbol.

Going beyond the character of 2, let the prime p = a2 + b2 where b is even, and let q be a prime such that ${\displaystyle ({\tfrac {p}{q}})=1.}$ Quadratic reciprocity says that ${\displaystyle ({\tfrac {q^{*}}{p}})=1,}$ where ${\displaystyle q^{*}=(-1)^{\frac {q-1}{2}}q.}$ Let σ2p (mod q). Then[22]

${\displaystyle {\Bigg (}{\frac {q^{*}}{p}}{\Bigg )}_{4}={\Bigg (}{\frac {\sigma (b+\sigma )}{q}}{\Bigg )}.}$ This implies[23] that
${\displaystyle {\Bigg (}{\frac {q^{*}}{p}}{\Bigg )}_{4}=1{\mbox{ if and only if }}{\begin{cases}b\equiv 0{\pmod {q}};&{\mbox{ or }}\\a\equiv 0{\pmod {q}}{\mbox{ and }}\left({\frac {2}{q}}\right)=1;&{\mbox{ or }}\\a\equiv \mu b,\;\;\mu ^{2}+1\equiv \lambda ^{2}{\pmod {q}}{\mbox{, and }}\left({\frac {\lambda (\lambda +1)}{q}}\right)=1.\end{cases}}}$

The first few examples are:[24]

${\displaystyle \left({\frac {-3}{p}}\right)_{4}=1{\mbox{ if and only if }}b\equiv 0{\pmod {3}}}$
${\displaystyle \left({\frac {5}{p}}\right)_{4}=1{\mbox{ if and only if }}b\equiv 0{\pmod {5}}}$
${\displaystyle \left({\frac {-7}{p}}\right)_{4}=1{\mbox{ if and only if }}ab\equiv 0{\pmod {7}}}$
${\displaystyle \left({\frac {-11}{p}}\right)_{4}=1{\mbox{ if and only if }}b(b^{2}-3a^{2})\equiv 0{\pmod {11}}}$
${\displaystyle \left({\frac {13}{p}}\right)_{4}=1{\mbox{ if and only if }}b(b^{2}-3a^{2})\equiv 0{\pmod {13}}}$
${\displaystyle \left({\frac {17}{p}}\right)_{4}=1{\mbox{ if and only if }}ab(b^{2}-a^{2})\equiv 0{\pmod {17}}}$

Dirichlet[25] also proved that if p ≡ 1 (mod 4) is prime and ${\displaystyle ({\tfrac {17}{p}})=1}$ then

${\displaystyle {\Bigg (}{\frac {17}{p}}{\Bigg )}_{4}{\Bigg (}{\frac {p}{17}}{\Bigg )}_{4}={\begin{cases}+1{\mbox{ if and only if }}p=x^{2}+17y^{2}\\-1{\mbox{ if and only if }}2p=x^{2}+17y^{2}\end{cases}}}$

This has been extended from 17 to 17, 73, 97, and 193 by Brown and Lehmer.[26]

### Burde

There are a number of equivalent ways of stating Burde's rational biquadratic reciprocity law.

They all assume that p = a2 + a2 and q = c2 + d2 are primes where b and d are even, and that ${\displaystyle ({\tfrac {p}{q}})=1.}$

Gosset's version is[27]

${\displaystyle {\Bigg (}{\frac {q}{p}}{\Bigg )}_{4}\equiv {\Bigg (}{\frac {a/b-c/d}{a/b+c/d}}{\Bigg )}^{\frac {q-1}{4}}{\pmod {q}}.}$

Letting i2 ≡ −1 (mod p) and j2 ≡ −1 (mod q), Frölich's law is[28]

${\displaystyle {\Bigg (}{\frac {q}{p}}{\Bigg )}_{4}{\Bigg (}{\frac {p}{q}}{\Bigg )}_{4}={\Bigg (}{\frac {a+bj}{q}}{\Bigg )}={\Bigg (}{\frac {c+di}{p}}{\Bigg )}.}$

Burde stated his in the form:[29]

${\displaystyle {\Bigg (}{\frac {q}{p}}{\Bigg )}_{4}{\Bigg (}{\frac {p}{q}}{\Bigg )}_{4}={\Bigg (}{\frac {ac-bd}{q}}{\Bigg )}.}$

Note that[30]

${\displaystyle {\Bigg (}{\frac {ac+bd}{p}}{\Bigg )}={\Bigg (}{\frac {p}{q}}{\Bigg )}{\Bigg (}{\frac {ac-bd}{p}}{\Bigg )}.}$

### Miscellany

Let pq ≡ 1 (mod 4) be primes and assume ${\displaystyle ({\tfrac {p}{q}})=1}$. Then e2 = p f2 + q g2 has non-trivial integer solutions, and[31]

${\displaystyle {\Bigg (}{\frac {p}{q}}{\Bigg )}_{4}{\Bigg (}{\frac {q}{p}}{\Bigg )}_{4}=\left(-1\right)^{\frac {fg}{2}}\left({\frac {-1}{e}}\right).}$

Let pq ≡ 1 (mod 4) be primes and assume p = r2 + q s2. Then[32]

${\displaystyle {\Bigg (}{\frac {p}{q}}{\Bigg )}_{4}{\Bigg (}{\frac {q}{p}}{\Bigg )}_{4}=\left({\frac {2}{q}}\right)^{s}.}$

Let p = 1 + 4x2 be prime, let a be any odd number that divides x, and let ${\displaystyle a^{*}=\left(-1\right)^{\frac {a-1}{2}}a.}$ Then[33] a* is a biquadratic residue (mod p).

Let p = a2 + 4b2 = c2 + 2d2 ≡ 1 (mod 8) be prime. Then[34] all the divisors of c4p a2 are biquadratic residues (mod p). The same is true for all the divisors of d4p b2.

## Gaussian integers

### Gauss

In his second monograph on biquadratic reciprocity Gauss displays some examples and makes conjectures that imply the theorems listed above for the biquadratic character of small primes. He makes some general remarks, and admits there is no obvious general rule at work. He goes on to say

The theorems on biquadratic residues gleam with the greatest simplilcity and genuine beauty only when the field of arithmetic is extended to imaginary numbers, so that without restriction, the numbers of the form a + bi constitute the object of study ... we call such numbers integral complex numbers.[35]

These numbers are now called the ring of Gaussian integers, denoted by Z[i]. Note that i is a fourth root of 1.

The theory of cubic residues must be based in a similar way on a consideration of numbers of the form a' + bh where h is an imaaginary root of the equation h3 = 1 ... and similarly the theory of residues of higher powers leads to thte introduction of other imaginary quamntities.[36]

The numbers built up from a cube root of unity are now called the ring of Eisenstein integers.

Gauss develops the arithmetic theory of the "integral complex numbers" and shows that it is quite similar to the arithmetic of ordinary integers.[37] This is where the terms unit, associate, norm, and primary were introduced into mathematics.

The units are the numbers that divide 1.[38] They are 1, i, −1, and −i. They are similar to 1 and −1 in the ordinary integers, in that they divide evey number. The units are the powers of i.

Given a number λ = a + bi, its conjugate is abi and its associates are the four numbers[39]

λ = +a + bi
iλ = −b + ai
−λ = −abi
iλ = +bai

The norm of λ = a + bi is the number Nλ = a2 + b2. If λ and μ are two Gaussian integers, Nλμ = Nλ Nμ; in other words, the norm is multiplicative.[40] The norm of zero is zero, the norm of any other number is a positive integer.

Gauss proves that Z[i] is a unique factorization domain and shows that the primes fall into three classes:[41]

• 2 is a special case: 2 = i3 (i + i)2. In algebraic number theory, 2 is said to ramify in Z[i].
• Positive primes in Z ≡ 3 (mod 4) are also primes in Z[i]. In algebraic number theory, these primes are said to remain inert in Z[i].
• Positive primes in Z ≡ 1 (mod 4) are the product of two conjugate primes in Z[i]. In algebraic number theory, these primes are said to split in Z[i].

Thus, inert primes are 3, 7, 11, 19, ... and the fatorization of the split primes is 5 = (2 + i)(2 − i), 13 = (2 + 3i)(2 − 3i), 17 = (4 + i)(4 − i), 29 = (2 + 5i)(2 − 5i), ...

The associates of a prime are also primes.

Note that the norm of an inert prime q is Nq = q2 ≡ 1 (mod 4); thus the norm of all primes other than 1 + i and its associates is ≡ 1 (mod 4).

Gauss calls a number in Z[i] odd if its norm is an odd integer.[42] Thus all primes except 1 + i and its associates are odd.

In order to state the unique factorization theorem, it is necessary to have a way of distinguishing one of the associates of a number. Gauss defines[43] an odd number to be primary if it is ≡ 1 (mod (1 + i)3). It is straightforward to show that every odd number has exactly one primary associate. An odd number λ = a + bi is primary if a + bab ≡ 1 (mod 4); i.e., a ≡ 1 and b ≡ 0, or a ≡ 3 and b ≡ 2 (mod 4).

The unique factorization theorem[44] for Z[i] is: if λ ≠ 0, then

${\displaystyle \lambda =i^{\mu }(1+i)^{\nu }\pi _{1}^{\alpha _{1}}\pi _{2}^{\alpha _{2}}\pi _{3}^{\alpha _{3}}\dots }$

where 0 ≤ μ ≤ 3, ν ≥ 0, the πis are primary primes and the αis ≥ 1, and this representation is unique, up to the order of the factors.

The notions of congruence[45] and greatest common divisor[46] are defined the same way in Z[i] as they are for the ordinary integers Z.

Gauss proves the analogue of Fermat's theorem: if α is not divisible by an odd prime π, then[47]

${\displaystyle \alpha ^{N\pi -1}\equiv 1{\pmod {\pi }}}$

Since Nπ ≡ 1 (mod 4), ${\displaystyle \alpha ^{\frac {N\pi -1}{4}}\equiv 1{\pmod {\pi }}}$ is well-defined, and it is easy to show that ${\displaystyle \alpha ^{\frac {N\pi -1}{4}}\equiv i^{k}{\pmod {\pi }}}$ for a unique unit ik.

This unit is called the quartic or biquadratic residue character (mod π) and is denoted by[48]

${\displaystyle \left[{\frac {\alpha }{\pi }}\right]=i^{k}\equiv \alpha ^{\frac {N\pi -1}{4}}{\pmod {\pi }}.}$ Its usefulness comes from the theorem[49]

The congruence ${\displaystyle x^{4}\equiv \alpha {\pmod {\pi }}}$ is solvable in Z[i] if and only if ${\displaystyle \left[{\frac {\alpha }{\pi }}\right]=1.}$

The biquadratic character can be extended to odd, but not necessarily prime, numbers in the "denominator" in the same way the Legendre symbol is generalized into the Jacobi symbol. As in that case, if the "denominator" is composite, the symbol can equal one without the conguence being solvable:

${\displaystyle \left[{\frac {\alpha }{\lambda }}\right]=\left[{\frac {\alpha }{\pi _{1}}}\right]^{\alpha _{1}}\left[{\frac {\alpha }{\pi _{2}}}\right]^{\alpha _{2}}\dots }$ where ${\displaystyle \lambda =\pi _{1}^{\alpha _{1}}\pi _{2}^{\alpha _{2}}\pi _{3}^{\alpha _{3}}\dots }$

Gauss stated the law of biquadratic reciprocity in this form:[50][51]

Let π and θ be distinct primary primes of Z[i]. Then

if either π or θ or both are ≡ 1 (mod 4), then ${\displaystyle {\Bigg [}{\frac {\pi }{\theta }}{\Bigg ]}=\left[{\frac {\theta }{\pi }}\right],}$ but
if both π and θ are ≡ 3 + 2i (mod 4), then ${\displaystyle {\Bigg [}{\frac {\pi }{\theta }}{\Bigg ]}=-\left[{\frac {\theta }{\pi }}\right].}$

Another way to state it is[52]

${\displaystyle {\Bigg [}{\frac {\pi }{\theta }}{\Bigg ]}\left[{\frac {\theta }{\pi }}\right]^{-1}=(-1)^{{\frac {N\pi -1}{4}}{\frac {N\theta -1}{4}}}.}$

There are three (the third is a consequence of the first two) supplementary theorems[53][54]

if π = a + bi is a primary prime, then

${\displaystyle {\Bigg [}{\frac {i}{\pi }}{\Bigg ]}=i^{-{\frac {a-1}{2}}},\;\;\;{\Bigg [}{\frac {1+i}{\pi }}{\Bigg ]}=i^{\frac {a-b-1-b^{2}}{4}},\;\;\;{\Bigg [}{\frac {2}{\pi }}{\Bigg ]}=i^{-{\frac {b}{2}}}.}$

In fact, just as the quadratic reciprocity law for the Legendre symbol is also true for the Jacobi symbol, the requirement that the numbers be prime is not needed; it suffices that they be relatively prime.[55]

### Others

Jacobi defined π = a + bi to be primary if a ≡ 1 (mod 4). With this normalization, the law takes the form[56]

Let α = a + bi and β = c + di where a and c are ≡ 1 (mod 4) and b and d are even be relatively prime. Then

${\displaystyle \left[{\frac {\alpha }{\beta }}\right]\left[{\frac {\beta }{\alpha }}\right]^{-1}=(-1)^{\frac {bd}{4}}}$

The following version was found in Gauss's unpublished manuscripts.[57]

Let α = a + 2bi and β = c + 2di where a and c are odd be relatively prime. Then

${\displaystyle \left[{\frac {\alpha }{\beta }}\right]\left[{\frac {\beta }{\alpha }}\right]^{-1}=(-1)^{bd+{\frac {a-1}{2}}d+{\frac {c-1}{2}}b},\;\;\;\;\left[{\frac {1+i}{\alpha }}\right]=i^{{\frac {b(a-3b)}{2}}-{\frac {a^{2}-1}{8}}}}$

There is a form of the law that does not use any concept of primary:

If λ is odd, let ε(λ) be the unique unit congruent to λ (mod (1 + 2i)3); i.e., ε(λ) = ik ≡ λ (mod 2 + 2i), where 0 ≤ k ≤ 3. Then[58] for odd and relatively prime α and β,

${\displaystyle \left[{\frac {\alpha }{\beta }}\right]\left[{\frac {\beta }{\alpha }}\right]^{-1}=(-1)^{{\frac {N\alpha -1}{4}}{\frac {N\beta -1}{4}}}\epsilon (\alpha )^{\frac {N\beta -1}{4}}\epsilon (\beta )^{\frac {N\alpha -1}{4}}}$

## Notes

1. ^ Euler, Tractatus, § 456
2. ^ Gauss, BQ, § 67
3. ^ Lemmermeyer, p. 200
4. ^ Eisenstein, Lois de reciprocite
5. ^ Eisenstein, Einfacher Beweis ...
6. ^ Eisenstein, Application de l'algebre ...
7. ^ Eisenstein, Beitrage zur Theorie der elliptischen ...
8. ^ Lemmermeyer, pp. 199–202
9. ^ Lemmermeyer, p. 172
10. ^ Gauss, BQ § 2
11. ^ Gauss, BQ § 2
12. ^ Gauss, BQ § 3
13. ^ Gauss, BQ §§ 4–7
14. ^ Gauss, BQ § 8
15. ^ Gauss, BQ § 10
16. ^ Gauss, DA Art. 182
17. ^ Gauss, BQ § 10
18. ^ Gauss, DA, Art. 182
19. ^ Gauss BQ §§ 14–21
20. ^ Dirichlet, Demonstration ...
21. ^ Lemmermeyer, Prop. 5.4
22. ^ Lemmermeyer, Prop. 5.5
23. ^ Lemmermeyer, Ex. 5.6
24. ^ Lemmmermeyer, pp.159, 190
25. ^ Dirichlet, Untersuchungen ...
26. ^ Lemmermeyer, Ex. 5.19
27. ^ Lemmermeyer, p. 172
28. ^ Lemmermeyer, p. 173
29. ^ Lemmermeyer, p. 167; Ireland & Rosen pp.128–130
30. ^ Lemmermeyer, Ex. 5.13
31. ^ Lemmermeyer, Ex. 5.5
32. ^ Lemmermeyer, Ex. 5.6, credited to Brown
33. ^ Lemmermeyer, Ex. 6.5, credited to Sharifi
34. ^ Lemmermeyer, Ex. 6.11, credited to E. Lehmer
35. ^ Gauss, BQ, § 30, translation in Cox, p. 83
36. ^ Gauss, BQ, § 30, translation in Cox, p. 84
37. ^ Gauss, BQ, §§ 30–55
38. ^ Gauss, BQ, § 31
39. ^ Gauss, BQ, § 31
40. ^ Gauss, BQ, § 31
41. ^ Gauss, BQ, §§ 33–34
42. ^ Gauss, BQ, § 35. He defines "halfeven" numbers as those divisible by 1 + i but not by 2, and "even" numbers as those divisible by 2.
43. ^ Gauss, BQ, § 36
44. ^ Gauss, BQ, § 37
45. ^ Gauss, BQ, §§ 38–45
46. ^ Gauss, BQ, §§ 46–47
47. ^ Gauss, BQ, § 51
48. ^ Gauss defined the character as the exponent k rather than the unit ik; also, he had no symbol for the character.
49. ^ Gauss, BQ, § 61
50. ^ Gauss, BQ, § 67
51. ^ proofs are in Lemmermeyer, chs. 6 and 8, Ireland & Rosen, ch. 9.7–9.10
52. ^ Lemmermeyer, ch. 6, Ireland & Rosen ch. 9.7–9.10
53. ^ Lemmermeyer, Th. 6.9; Ireland & Rosen, Ex. 9.32–9.37
54. ^ Gauss proves the law for 1 + i in BQ, §§ 68–76
55. ^ Lemmermeyer, Th. 69.
56. ^ Lemmermeyer, Th. 6.9
57. ^ Lemmermeyer, Ex. 6.17
58. ^ Lemmermeyer, Ex. 6.18 and p. 275

## References

### Euler

• Euler, Leonhard (1849), Tractatus de numeroroum doctrina capita sedecim quae supersunt, Comment. Arithmet. 2

This was actually written 1748–1750, but was only published posthumously; It is in Vol V, pp. 182–283 of

• Euler, Leonhard (1911–1944), Opera Omnia, Series prima, Vols I–V, Leipzig & Berlin: Teubner Check date values in: |date= (help)

### Gauss

The two monographs Gauss published on biquadratic reciprocity have consecutively-numbered sections: the first contains §§ 1–23 and the second §§ 24–76. Footnotes referencing these are of the form "Gauss, BQ, § n".

• Gauss, Carl Friedrich (1828), Theoria residuorum biquadraticorum, Commentatio prima, Göttingen: Comment. Soc. regiae sci, Göttingen 6
• Gauss, Carl Friedrich (1832), Theoria residuorum biquadraticorum, Commentatio secunda, Göttingen: Comment. Soc. regiae sci, Göttingen 7

These are in Gauss's Werke, Vol II, pp. 65–92 and 93–148

German translations are in pp. 511–533 and 534–586 of the following, which also has the Disquisitiones Arithmeticae and Gauss's other papers on number theory.

• Gauss, Carl Friedrich; Maser, H. (translator into German) (1965), Untersuchungen uber hohere Arithmetik (Disquisitiones Arithmeticae & other papers on number theory) (Second edition), New York: Chelsea, ISBN 0-8284-0191-8

### Eisenstein

• Eisenstein, Ferdinand Gotthold (1844), Lois de réciprocité, J. Reine Angew. Math. 28, pp. 53–67 (Crelle's Journal)
• Eisenstein, Ferdinand Gotthold (1844), Einfacher Beweis und Verallgemeinerung des Fundamentaltheorems für die biquadratischen Reste, J. Reine Angew. Math. 28 pp. 223–245 (Crelle's Journal)
• Eisenstein, Ferdinand Gotthold (1845), Application de l'algèbre à l'arithmétique transcendante, J. Reine Angew. Math. 29 pp. 177–184 (Crelle's Journal)
• Eisenstein, Ferdinand Gotthold (1846), Beiträge zur Theorie der elliptischen Funktionen I: Ableitung des biquadratischen Fundalmentaltheorems aus der Theorie der Lemniskatenfunctionen, nebst Bemerkungen zu den Multiplications- und Transformationsformeln, J. Reine Angew. Math. 30 pp. 185–210 (Crelle's Journal)

These papers are all in Vol I of his Werke.

### Dirichlet

• Dirichlet, Pierre Gustave LeJeune (1832), Démonstration d'une propriété analogue à la loi de Réciprocité qui existe entre deux nombres premiers quelconques, J. Reine Angew. Math. 9 pp. 379–389 (Crelle's Journal)
• Dirichlet, Pierre Gustave LeJeune (1833), Untersuchungen über die Theorie der quadratischen Formen, Abh. Königl. Preuss. Akad. Wiss. pp. 101–121

both of these are in Vol I of his Werke.

### Modern authors

• Cox, David A. (1989), Primes of the form x2 + n y2, New York: Wiley, ISBN 0-471-50654-0
• Ireland, Kenneth; Rosen, Michael (1990), A Classical Introduction to Modern Number Theory (Second edition), New York: Springer, ISBN 0-387-97329-X
• Lemmermeyer, Franz (2000), Reciprocity Laws: from Euler to Eisenstein, Berlin: Springer, ISBN 3-540-66967-4 Check |isbn= value: checksum (help)
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 45, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://en.wikipedia.org/wiki/User:Virginia-American/Sandbox/Quartic_Reciprocity", "fetch_time": 1524153945000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2018-17/segments/1524125936981.24/warc/CC-MAIN-20180419150012-20180419170012-00483.warc.gz", "warc_record_offset": 604967402, "warc_record_length": 27056, "token_count": 7506, "char_count": 21987, "score": 3.78125, "int_score": 4, "crawl": "CC-MAIN-2018-17", "snapshot_type": "latest", "language": "en", "language_score": 0.9367839097976685, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00023-of-00064.parquet"}