A Note on the least squarefree number in an arithmetic progression

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.