statement theorem
Quadratic reciprocity for the Jacobi symbol
Statement
Let and be coprime positive odd integers. Then where the symbols are Jacobi symbols.
Remarks
The supplements also extend: for a positive odd , and . The proof uses the law of quadratic reciprocity for each pair of prime factors. With this law, one computes by an algorithm like the Euclidean algorithm, with no factorization.
Explanations
L1 human
The Jacobi symbol obeys the same reciprocity law as the Legendre symbol. So you can flip the symbol, reduce the top number modulo the bottom number, and repeat. This gives a fast way to compute Legendre symbols for large primes.
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 13 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
- Fermat's little theorem statement
- Prime factorization definition
- Legendre symbol definition
- Second supplement to quadratic reciprocity statement
- Euler's criterion statement
- Jacobi symbol definition
- First supplement to quadratic reciprocity statement
- Law of quadratic reciprocity statement
- Quadratic reciprocity for the Jacobi symbol statement
Sources
- Web https://en.wikipedia.org/wiki/Jacobi_symbol, Properties
What links here
No node links to this node yet.