When a Gauss sum is the square root of a prime number, multiplied by a root of unity
In mathematics , the Chowla–Mordell theorem is a result in number theory determining cases where a Gauss sum is the square root of a prime number , multiplied by a root of unity . It was proved and published independently by Sarvadaman Chowla and Louis Mordell , around 1951.
In detail, if
p
{\displaystyle p}
is a prime number,
χ
{\displaystyle \chi }
a nontrivial Dirichlet character modulo
p
{\displaystyle p}
, and
G
(
χ
)
=
∑
χ
(
a
)
ζ
a
{\displaystyle G(\chi )=\sum \chi (a)\zeta ^{a}}
where
ζ
{\displaystyle \zeta }
is a primitive
p
{\displaystyle p}
-th root of unity in the complex numbers , then
G
(
χ
)
|
G
(
χ
)
|
{\displaystyle {\frac {G(\chi )}{|G(\chi )|}}}
is a root of unity if and only if
χ
{\displaystyle \chi }
is the quadratic residue symbol modulo
p
{\displaystyle p}
. The 'if' part was known to Gauss : the contribution of Chowla and Mordell was the 'only if' direction. The ratio in the theorem occurs in the functional equation of L-functions .
References
Gauss and Jacobi Sums by Bruce C. Berndt , Ronald J. Evans and Kenneth S. Williams, Wiley-Interscience, p. 53.
Categories :
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
**DISCLAIMER** We are not affiliated with Wikipedia, and Cloudflare.
The information presented on this site is for general informational purposes only and does not constitute medical advice.
You should always have a personal consultation with a healthcare professional before making changes to your diet, medication, or exercise routine.
AI helps with the correspondence in our chat.
We participate in an affiliate program. If you buy something through a link, we may earn a commission 💕
↑