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.
Reading path
To understand this page from the ground up, read these 13 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
- 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
Further reading
- Web https://en.wikipedia.org/wiki/Jacobi_symbol, Properties
About this page
| Tag | 0YY06KP3ZQ |
|---|---|
| URI | m2://0YY06KP3ZQ |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11A15 |
| Status | This copy of the site has no build data. Run m2 status 0YY06KP3ZQ. |
| Uses | Jacobi symbol, Law of quadratic reciprocity |
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.