Evaluating Binomial Character Sums Modulo Powers of Two
classification
🧮 math.NT
keywords
binomialcharactercharacterscompleteevaluatingevaluationexplicitexponential
read the original abstract
We show that for any mod $2^m$ characters, $\chi_1, \chi_2,$ the complete exponential sum, $$ \sum_{x=1}^{2^m}\chi_1(x) \chi_2(Ax^k+B), $$ has a simple explicit evaluation.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.