Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Euler's Criterion

Number Theory

Euler's Criterion is a formula for determining whether an integer is a quadratic residue modulo an odd prime: for a prime p and an integer a coprime to p, a raised to the power of half of p minus one is congruent to one modulo p exactly when some integer squared is congruent to a modulo p, and congruent to negative one modulo p otherwise. The criterion can be restated concisely using the Legendre symbol, and it dates from a 1748 paper by Leonhard Euler.

Facts
Statement
A formula for determining whether an integer is a quadratic residue modulo a prime. 1
Proof Year
1748 1
Connections

Named After

Leonhard Euler, Mathematicians

Derived from the theorem's own name (unambiguous possessive-token match to exactly one live mathematician entity, w-bfill-g5-0924 browse backfill)

Proved By

Sources
1. Euler's criterion (Wikipedia)
  • Intro, sentence 1
    Euler's criterion is a formula for determining whether an integer is a quadratic residue modulo a prime
  • Intro, sentence after the Legendre symbol reformulation
    The criterion dates from a 1748 paper by Leonhard Euler.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.