Euler's criterion

From Number
Revision as of 20:16, 2 January 2012 by Vipul (talk | contribs) (Created page with "==Statement== ===In terms of quadratic residues and nonresidues=== Suppose <math>p</math> is an odd prime number. Consider an integer <math>a</math> that is not zero mod...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Statement

In terms of quadratic residues and nonresidues

Suppose p is an odd prime number. Consider an integer a that is not zero mod p. Then:

  • a(p1)/2 is congruent to either 1 or -1 mod p.
  • a(p1)/2 is congruent to 1 mod p if and only if a is a quadratic residue mod p.
  • a(p1)/2 is congruent to -1 mod p if and only if a is a quadratic nonresidue mod p.

In terms of Legendre symbol

Suppose p is an odd prime number. Consider an integer a that is not zero mod p. Then:

a(p1)/2(ap)(modp)

where the expression on the right side is the Legendre symbol, defined to be +1 for a quadratic residue and 1 for a quadratic nonresidue. Note that the Legendre symbol is the restriction to primes of the Jacobi symbol.