Number theory Quadratic residues and reciprocity Theorem
Euler's criterion
Builds on Legendre symbolFermat's little theorem
Statement
Let be an odd prime and let be an integer. Then where is the Legendre symbol.
Remarks
So for , the integer is a quadratic residue modulo if and only if . For example, , so is a quadratic nonresidue modulo . The proof uses Fermat's little theorem: satisfies , so . A consequence is the multiplicativity of the Legendre symbol.
History
Leonhard Euler found the criterion.
Reading path
To understand this page from the ground up, read these 7 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
Where this leads
12 pages build on this one.
- −1 is a square modulo p if and only if p is not 3 modulo 4
- Fermat's theorem on sums of two squares
- Sum of two squares theorem
- Law of quadratic reciprocity
- Multiplicativity of the Legendre symbol
- First supplement to quadratic reciprocity
- A prime is a Gaussian prime if and only if it is 3 modulo 4
- Quadratic reciprocity for the Jacobi symbol
- Artin reciprocity law
- Cubic reciprocity
- Hilbert class field
- Quartic reciprocity
Further reading
- Web https://en.wikipedia.org/wiki/Euler%27s_criterion, lead section
About this page
| Tag | 0M7DEDKSYB |
|---|---|
| URI | m2://0M7DEDKSYB |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 11A15 |
| Status | This copy of the site has no build data. Run m2 status 0M7DEDKSYB. |
| Uses | Legendre symbol, Fermat's little theorem |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.