Numerically explicit estimates for the distribution of rough numbers

From MaRDI portal
Publication:6131177




Abstract: For xgey>1 and u:=logx/logy, let Phi(x,y) denote the number of positive integers up to x free of prime divisors less than or equal to y. In 1950 de Bruijn [1] studied the approximation of Phi(x,y) by the quantity [mu_y(u)e^{gamma}xlog yprod_{pleq y}left(1-frac{1}{p} ight),] where gamma=0.5772156... is Euler's constant and [mu_y(u):=int_{1}^{u}y^{t-u}omega(t),dt.] He showed that the asymptotic formula [Phi(x,y)=mu_y(u)e^{gamma}xlog yprod_{pleq y}left(1-frac{1}{p} ight)+Oleft(frac{xR(y)}{log y} ight)] holds uniformly for all xgeyge2, where 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.










This page was built for publication: Numerically explicit estimates for the distribution of rough numbers

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