cases when minus one is a quadratic residue
Theorem.
Let be an odd prime. Then is a quadratic residue![]()
modulo if and only if .
Proof.
Let be an odd prime. Notice that is congruent![]()
to either or modulo . By the definition of the Legendre symbol

![]()
, we need to verify that
if and only if . By Euler’s criterion
Finally, note that the integer is even if and odd if . ∎
| Title | cases when minus one is a quadratic residue |
|---|---|
| Canonical name | CasesWhenMinusOneIsAQuadraticResidue |
| Date of creation | 2013-03-22 16:18:10 |
| Last modified on | 2013-03-22 16:18:10 |
| Owner | alozano (2414) |
| Last modified by | alozano (2414) |
| Numerical id | 6 |
| Author | alozano (2414) |
| Entry type | Theorem |
| Classification | msc 11A15 |
| Related topic | EulersCriterion |
| Related topic | ValuesOfTheLegendreSymbol |