Numerically explicit estimates for the distribution of rough numbers
Abstract
For x y>1 and u:= x/ y, let (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 (x,y) by the quantity \[μy(u)eγx yΠp≤ y(1-1p),\] where γ=0.5772156... is Euler's constant and \[μy(u):=∫1uyt-uω(t)\,dt.\] He showed that the asymptotic formula \[(x,y)=μy(u)eγx yΠp≤ y(1-1p)+O(xR(y) y)\] holds uniformly for all x y2, 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.