Codex Wiki
OurBigBook.com
Site
Source code
Euler criterion
Home
Mathematics
Area of mathematics
Number theory
Quadratic residue
Legendre symbol
OurBigBook.com
Words: 154
Articles: 5
For an odd prime
p
,
a
(
p
−
1
)
/2
≡
(
p
a
)
(
mod
p
)
.
(27)
For
p
∤
a
, write
a
=
g
m
using a
primitive root
g
; then the left side is
(
−
1
)
m
, which is one exactly when
m
is even and
a
is a square.
Table of contents
154
5
First supplementary law for quadratic reciprocity
Euler criterion
6
Second supplementary law for quadratic reciprocity
Euler criterion
85
2
Euclid proof for infinitely many primes congruent to seven modulo eight
Second supplementary law for quadratic reciprocity
45
Elementary logarithmic lower bound for primes in the quadratic-residue classes of two
Second supplementary law for quadratic reciprocity
35
Prime-power binomial congruence for a matrix
Euler criterion
24
Ancestors
(6)
Legendre symbol
Quadratic residue
Number theory
Area of mathematics
Mathematics
Home
Incoming links
(4)
Solution
Solution
Solution
Solution