English

Kloosterman Sums with Multiplicative Coefficients

Number Theory 2014-03-14 v4

Abstract

Let f(n)f(n) be a multiplicative function satisfying f(n)1|f(n)|\leq 1, qq (N2)(\leq N^2) be a positive integer and aa be an integer with (a,q)=1(a,\,q)=1. In this paper, we shall prove that nN(n,q)=1f(n)e(anˉq)τ(q)qNloglog(6N)+q14+ϵ2N12(log(6N))12+Nloglog(6N),\sum_{\substack{n\leq N\\ (n,\,q)=1}}f(n)e({a\bar{n}\over q})\ll\sqrt{\tau(q)\over q}N\log\log(6N)+q^{{1\over 4}+{\epsilon\over 2}}N^{1\over 2}(\log(6N))^{1\over 2}+{N\over \sqrt{\log\log(6N)}}, where nˉ\bar{n} is the multiplicative inverse of nn such that nˉn1(modq),e(x)=exp(2πix),τ(q)\bar{n}n\equiv 1\,({\rm mod}\,q),\,e(x)=\exp(2\pi ix),\,\tau(q) is the divisor function.

Keywords

Cite

@article{arxiv.1401.4556,
  title  = {Kloosterman Sums with Multiplicative Coefficients},
  author = {Ke Gong and Chaohua Jia},
  journal= {arXiv preprint arXiv:1401.4556},
  year   = {2014}
}

Comments

In this version we make some refinement

R2 v1 2026-06-22T02:48:51.558Z