Euler's criterion
in number theory concerning primes
Press Enter · cited answer in seconds
0 sources
Euler's criterion
Summary
Euler's criterion is a theorem[1]. It draws 107 Wikipedia views per month (theorem category, ranking #206 of 1,306).[2]
Key Facts
- Euler's criterion's instance of is recorded as theorem[3].
- Leonhard Euler is named after Euler's criterion[4].
- Euler's criterion's Freebase ID is recorded as /m/0qh27[5].
- Euler's criterion's facet of is recorded as quadratic residue[6].
- Euler's criterion's uses is recorded as Legendre symbol[7].
- Euler's criterion's defining formula is recorded as \left(\frac{a}{p}\right) = \begin{cases} 1 & \text{ if } a \text{ is a quadratic residue modulo } p \text{ and } a \not\equiv 0\pmod{p}, \-1 & \text{ if } a \text{ is a quadratic non-residue modulo } p, \ 0 & \text{ if } a \equiv 0 \pmod{p}. \end{cases}[8].
- Euler's criterion's MathWorld ID is recorded as EulersCriterion[9].
- Euler's criterion's Quora topic ID is recorded as Eulers-Criterion[10].
- Euler's criterion's maintained by WikiProject is recorded as WikiProject Mathematics[11].
- Euler's criterion's Microsoft Academic ID is recorded as 31165883[12].
- Euler's criterion's Brilliant Wiki ID is recorded as eulers-criterion[13].
Why It Matters
Euler's criterion draws 107 Wikipedia views per month (theorem category, ranking #206 of 1,306).[2] It has Wikipedia articles in 16 language editions, a strong signal of global cultural recognition.[14]