English

Numerically explicit estimates for the distribution of rough numbers

Number Theory 2023-10-04 v6

Abstract

For xy>1x\ge y>1 and u:=logx/logyu:= \log x/\log y, let Φ(x,y)\Phi(x,y) denote the number of positive integers up to xx free of prime divisors less than or equal to yy. In 1950 de Bruijn [1] studied the approximation of Φ(x,y)\Phi(x,y) by the quantity μy(u)eγxlogypy(11p),\mu_y(u)e^{\gamma}x\log y\prod_{p\leq y}\left(1-\frac{1}{p}\right), where γ=0.5772156...\gamma=0.5772156... is Euler's constant and μy(u):=1uytuω(t)dt.\mu_y(u):=\int_{1}^{u}y^{t-u}\omega(t)\,dt. He showed that the asymptotic formula Φ(x,y)=μy(u)eγxlogypy(11p)+O(xR(y)logy)\Phi(x,y)=\mu_y(u)e^{\gamma}x\log y\prod_{p\leq y}\left(1-\frac{1}{p}\right)+O\left(\frac{xR(y)}{\log y}\right) holds uniformly for all xy2x\ge y\ge2, where R(y)R(y) is a positive decreasing function related to the error estimates in the Prime Number Theorem. In this paper we obtain numerically explicit versions of de Bruijn's result.

Keywords

Cite

@article{arxiv.2306.03347,
  title  = {Numerically explicit estimates for the distribution of rough numbers},
  author = {Steve Fan},
  journal= {arXiv preprint arXiv:2306.03347},
  year   = {2023}
}

Comments

24 pages; submitted

R2 v1 2026-06-28T10:57:21.946Z