arXiv · 1605.03347
A Note on the least squarefree number in an arithmetic progression
Abstract
We prove an asymptotic formula for squarefree in arithmetic progressions with squarefree moduli, improving previous results by Prachar. The main tool is an estimate for counting solutions of a congruence inside a box that goes beyond what can be obtained by using the Weil bound.
Explore related subjects
Keep this discovery
Ramon M. Nunes. 2016-05-11. A Note on the least squarefree number in an arithmetic progression. https://doi.org/10.1112/s0025579317000043
Cite the original work for its findings. Save a collection to share your selection of sources.