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
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
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
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.