arXiv Analytics

Sign in

arXiv:1411.2360 [math.NT]AbstractReferencesReviewsResources

On the distribution of squarefree integers in arithmetic progressions

Pierre Le Boudec

Published 2014-11-10Version 1

We investigate the error term of the asymptotic formula for the number of squarefree integers up to some bound, and lying in some arithmetic progression a (mod q). In particular, we prove an upper bound for its variance as a varies over $(\mathbb{Z}/q\mathbb{Z})^{\times}$ which considerably improves upon earlier work of Blomer.

Related articles: Most relevant | Search more
arXiv:1607.01882 [math.NT] (Published 2016-07-07)
Large bias for integers with prime factors in arithmetic progressions
arXiv:1106.3474 [math.NT] (Published 2011-06-17, updated 2011-07-03)
On the remainder term in the circle problem in an arithmetic progression
arXiv:1912.11587 [math.NT] (Published 2019-12-25)
When the Large Divisors of a Natural Number Are in Arithmetic Progression