Chowla–Mordell theorem
Chowla–Mordell theorem is a theorem.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2398123079
- What it is
- theorem
- Wikipedias with a page
- 2
Wikidata item Q4991415 (wikidata.org/wiki/Q4991415), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1365671044
In mathematics, the Chowla–Mordell theorem says that for 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. 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. It was proved and published independently by Sarvadaman Chowla and Louis Mordell, around 1951.
From the Wikipedia article “Chowla–Mordell theorem” (en.wikipedia.org/wiki/Chowla–Mordell_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
