Math 2.0

statement lemma

Gauss's lemma on quadratic residues

Statement

Let pp be an odd prime and let aa be an integer with p∤ap \nmid a. Reduce each of the integers a,2a,…,p−12aa, 2a, \dots, \frac{p-1}{2} a to its least positive residue modulo pp. Let nn be the number of these residues that are greater than p/2p/2. Then (ap)=(−1)n\left(\frac{a}{p}\right) = (-1)^n, where the left side is the Legendre symbol.

Remarks

For example, take p=7p = 7 and a=3a = 3. The residues of 3,6,93, 6, 9 are 3,6,23, 6, 2, and only 66 is greater than 7/27/2. So (37)=−1\left(\frac{3}{7}\right) = -1. With a=2a = 2, 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 aa modulo pp, and count how many land in the upper half of 1,…,p−11, \dots, p - 1. An even count means that aa is a square modulo pp, 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.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Divisibility definition
  2. Congruence modulo n definition
  3. Prime number definition
  4. Quadratic residue definition
  5. Legendre symbol definition
  6. Gauss's lemma on quadratic residues statement

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Gauss%27s_lemma_(number_theory), Statement of the lemma