Eisenstein's lemma
Builds on Legendre symbolGauss's lemma on quadratic residues
Statement
Let be an odd prime and let be a positive integer with . Then where the sum runs over the even integers , and is the Legendre symbol.
Remarks
For example, take and . The sum is , so . A common variant holds for odd : then . The proof is similar to the proof of Gauss's lemma. Eisenstein used the lemma in a proof of quadratic reciprocity that counts lattice points in a triangle.
Reading path
To understand this page from the ground up, read these 7 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Congruence modulo n definition
- Prime number definition
- Quadratic residue definition
- Legendre symbol definition
- Gauss's lemma on quadratic residues statement
- Eisenstein's lemma statement
Further reading
- Web https://en.wikipedia.org/wiki/Proofs_of_quadratic_reciprocity, Eisenstein's proof
About this page
| Tag | 0XSDBCP4RZ |
|---|---|
| URI | m2://0XSDBCP4RZ |
| Kind | statement, lemma |
| Writing | W0 stub |
| MSC | 11A15 |
| Status | This copy of the site has no build data. Run m2 status 0XSDBCP4RZ. |
| Uses | Legendre symbol, Gauss's lemma on quadratic residues |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.