Math 2.0

statement theorem

First supplement to quadratic reciprocity

Statement

Let pp be an odd prime. Then (−1p)=(−1)(p−1)/2,\left(\frac{-1}{p}\right) = (-1)^{(p-1)/2}, where the left side is a Legendre symbol.

Remarks

So (−1p)=1\left(\frac{-1}{p}\right) = 1 if p≡1(mod4)p \equiv 1 \pmod 4, and (−1p)=−1\left(\frac{-1}{p}\right) = -1 if p≡3(mod4)p \equiv 3 \pmod 4. The proof is Euler's criterion with a=−1a = -1. For example, 22=4≡−1(mod5)2^2 = 4 \equiv -1 \pmod 5, but −1-1 is not a square modulo 77.

Explanations

L1 human

The number −1-1 is a square modulo an odd prime pp exactly when pp leaves remainder 11 on division by 44. So −1-1 is a square modulo 55, 1313 and 1717, but not modulo 33, 77 and 1111.

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 8 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. Fermat's little theorem statement
  6. Legendre symbol definition
  7. Euler's criterion statement
  8. First supplement to quadratic reciprocity statement

What depends on this

6 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Quadratic_reciprocity, q = ±1 and the first supplement