−1 is a square modulo p if and only if p is not 3 modulo 4
Builds on First supplement to quadratic reciprocityPrime number
Statement
Let be a prime number. There is an integer with if and only if .
Remarks
For , take . For odd , the statement is the first supplement to quadratic reciprocity. For , an explicit solution is , by Wilson's theorem. The statement is a step in the proof of Fermat's theorem on sums of two squares.
Reading path
To understand this page from the ground up, read these 9 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
- Legendre symbol definition
- Euler's criterion statement
- First supplement to quadratic reciprocity statement
- −1 is a square modulo p if and only if p is not 3 modulo 4 statement
Where this leads
3 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Quadratic_reciprocity, q = ±1 and the first supplement
About this page
| Tag | 00DW862T78 |
|---|---|
| URI | m2://00DW862T78 |
| Kind | statement, corollary |
| Writing | W0 stub |
| MSC | 11A15 |
| Status | This copy of the site has no build data. Run m2 status 00DW862T78. |
| Uses | First supplement to quadratic reciprocity, Prime number |
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.