On smooth square-free numbers in arithmetic progressions
Marc Munsch, Igor E. Shparlinski

TL;DR
This paper proves that for large primes, every residue class can be represented by a square-free number with controlled size and smoothness, improving previous bounds and extending to more general smoothness conditions.
Contribution
It establishes new bounds on the size and smoothness of square-free numbers representing residue classes modulo primes, confirming and strengthening earlier conjectures.
Findings
Representation of all residue classes by square-free numbers with size up to p^{2+o(1)}
Improved bounds on smoothness for representing residue classes
Stronger results hold for almost all primes p
Abstract
A. Booker and C. Pomerance (2017) have shown that any residue class modulo a prime can be represented by a positive -smooth square-free integer with all prime factors up to and conjectured that in fact one can find such with . Using bounds on double Kloosterman sums due to M. Z. Garaev (2010) we prove this conjecture in a stronger form and also consider more general versions of this question replacing -smoothness of by the stronger condition of -smoothness. Using bounds on multiplicative character sums and a sieve method, we also show that we can represent all residue classes by a positive square-free integer which is -smooth. Additionally, we obtain stronger results for almost all primes .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
