The Chowla-Mordell theorem is a result in number theory concerning Gauss sums associated with Dirichlet characters modulo an odd prime. It states that if the argument of such a Gaussian sum is a root of unity, the character generating it must be quadratic. The theorem determines the cases in which a Gauss sum equals the square root of a prime number multiplied by a root of unity, and it was proved and published independently by Sarvadaman Chowla and Louis Mordell around 1951. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Partially Attested
Proof YearSource states the theorem was proved 'around 1951'; exact year is approximate StatementFor a Dirichlet character modulo an odd prime, if the argument of its Gaussian sum is a root of unity, then the character must be quadratic. 1 Classification
Statement FormCharacterization Theorem 1 Connections
Has Statement Form
In Branch
Source Chowla-Mordell theorem (Wikipedia)
Proved By
Source Chowla-Mordell Theorem (Wikipedia)
Source Chowla-Mordell Theorem (Wikipedia)
Sources
1. Chowla-Mordell theorem (Wikipedia)
Introduction
if the argument of its Gaussian sum is a root of unity, then the character must be quadratic
Introduction [proof-year]
proved and published independently by Sarvadaman Chowla and Louis Mordell, around 1951
In Branch: Number Theory, Lead paragraph
It 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.
View the SourceChowla-Mordell Theorem (Wikipedia)
Proved By: Louis Mordell, Lead sentence, attribution
proved and published independently by Sarvadaman Chowla and Louis Mordell
Proved By: Sarvadaman Chowla, Lead sentence, attribution
proved and published independently by Sarvadaman Chowla and Louis Mordell
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.