Squarefree integers in large arithmetic progressions

Abstract

We show that the exponent of distribution of the sequence of squarefree numbers in arithmetic progressions of prime modulus is $\ge 2/3+1/57$, improving a result of Prachar from 1958. Our main tool is an upper bound for certain bilinear sums of exponential sums which resemble Kloosterman sums, going beyond what can be obtained by the Polya-Vinogradov completion method.

arXiv comment21 pages, no figures. Comments are welcome

References in corpus (1)

• On two conjectures concerning squarefree numbers in arithmetic progressions