Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Kloosterman sums with primes to composite moduli (1911.09981v1)

Published 22 Nov 2019 in math.NT

Abstract: We obtain a new estimate for Kloosterman sum with primes $p\leqslant X$ to composite modulo $q$, that is, for the exponential sum of the type [ \sum\limits_{p\leqslant X,\;p\,\nmid q}\exp{\biggl(\frac{2\pi i}{q}\bigl(a\overline{p}+bp\bigr)\,\biggr)},\quad (ab,q)=1,\quad p\overline{p}\equiv 1\pmod{q}, ] which is non-trivial in the case when $q{\,3/4+\varepsilon}\leqslant X\ll q{\,3/2}$. We also apply this estimate to the proof of solvability of some congruences with inverse prime residues $\pmod{q}$.

Summary

We haven't generated a summary for this paper yet.