Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the distribution of squarefree integers in arithmetic progressions

Published 10 Nov 2014 in math.NT | (1411.2360v1)

Abstract: 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.