The distribution of k-free numbers

From MaRDI portal
Publication:5145103

DOI10.1090/MCOM/3581zbMATH Open1469.11310arXiv1912.04972OpenAlexW3053410593MaRDI QIDQ5145103FDOQ5145103

Michael J. Mossinghoff, Tomas Silva, Timothy S. Trudgian

Publication date: 20 January 2021

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: Let Rk(x) denote the error incurred by approximating the number of k-free integers less than x by x/zeta(k). It is well known that Rk(x)=Omega(xfrac12k), and widely conjectured that Rk(x)=O(xfrac12k+epsilon). By establishing weak linear independence of some subsets of zeros of the Riemann zeta function, we establish an effective proof of the lower bound, with significantly larger bounds on the constant compared to those obtained in prior work. For example, we show that Rk(x)/x1/2k>3 infinitely often and that Rk(x)/x1/2k<3 infinitely often, for k=2, 3, 4, and 5. We also investigate R2(x) and R3(x) in detail and establish that our bounds far exceed the oscillations exhibited by these functions over a long range: for 0<xleq1018 we show that |R2(x)|<1.12543x1/4 and |R3(x)|<1.27417x1/6. We also present some empirical results regarding gaps between square-free numbers and between cube-free numbers.


Full work available at URL: https://arxiv.org/abs/1912.04972




Recommendations




Cites Work


Cited In (13)

Uses Software





This page was built for publication: The distribution of \(k\)-free numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145103)