statement lemma
Gauss's lemma on quadratic residues
Statement
Let be an odd prime and let be an integer with . Reduce each of the integers to its least positive residue modulo . Let be the number of these residues that are greater than . Then , where the left side is the Legendre symbol.
Remarks
For example, take and . The residues of are , and only is greater than . So . With , the lemma gives the second supplement to quadratic reciprocity. Gauss used the lemma in one of his proofs of the law of quadratic reciprocity.
Explanations
L1 human
Write the first half of the multiples of modulo , and count how many land in the upper half of . An even count means that is a square modulo , and an odd count means that it is not.
What this node 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 node is. They do not measure its truth.
What this needs
To read this node, read these 6 nodes in this order. The foundations come first, and the list ends with this node.
- 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
What depends on this
1 node uses this node, directly or through other nodes.
- Eisenstein's lemma 0XSDBCP4RZ
Sources
- Web https://en.wikipedia.org/wiki/Gauss%27s_lemma_(number_theory), Statement of the lemma
What links here
Used by
- Eisenstein's lemma 0XSDBCP4RZ