A Generalization of the Chowla-Mordell Theorem on Gaussian Sums (Q4024869)

Let \(N\) be a positive integer and \(\chi\) a Dirichlet character modulo \(N\). Define \[ g_N(\chi)= \sum^N_{m=1} \chi^{(m)} e(2\pi im/N)/\sqrt{N}. \] Consider the question when is \(g_N(\chi)\) a root of unity. In the case of odd prime \(N=p\), \textit{S. Chowla} [Proc. Natl. Acad. Sci. USA 48, 1127--1128 (1962; Zbl 0114.02902)] and \textit{L. J. Mordell} [Arch. Math. 13, 486--487 (1962; Zbl 0112.03401)] proved independently that this happens only when \(\chi\) is a quadratic character modulo \(p\). In this paper the author considers the same question for composite moduli \(N\). If \(N=p^n\), where \(n\geq 2\) and \(p\) is an odd prime, and \(\chi\) is a primitive character modulo \(N\), \textit{R. W. K. Odoni} [Bull. Lond. Math. Soc. 5, 325--327 (1973; Zbl 0269.10020)] found an explicit formula of \(g_N(\chi)\) which showed that \(g_N(\chi)\) is a root of unity in this case. The author finds the explicit formula of \(g_N(\chi)\) when \(N=2^n\) and \(\chi\) is a primitive character modulo \(2^n\), which also shows that \(g_N(\chi)\) is a root of unity in the case. Based on the Chowla-Mordell theorem and the above results, it is proved that \(g_N(\chi)\) is a root of unity if and only if \(\chi\) is a primitive character modulo \(N\) and \(\chi\) is induced from a character modulo \(N_0\) such that \(N=N'N_ 0\) where \(N'\) is square free, \((N',N_0)=1\) and the square of every prime factor of \(N_0\) divides \(N_0\). As a corollary, it is shown that if \(g_N(\chi)\) is a fourth root of unity, then \(\chi\) is a real primitive character modulo \(N\).