Numerically explicit estimates for the distribution of rough numbers
From MaRDI portal
Publication:6131177
Abstract: For and , let denote the number of positive integers up to free of prime divisors less than or equal to . In 1950 de Bruijn [1] studied the approximation of by the quantity [mu_y(u)e^{gamma}xlog yprod_{pleq y}left(1-frac{1}{p}
ight),] where 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 , where 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3055998 (Why is no real title available?)
- An explicit density estimate for Dirichlet \(L\)-series
- An improvement of Selberg's sieve method I
- An inequality for the distribution of numbers free of small prime factors
- An inequality related to the sieve of Eratosthenes
- Approximate formulas for some functions of prime numbers
- Explicit estimates of some functions over primes
- Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
- Nonnegative trigonometric polynomials and a zero-free region for the Riemann zeta-function
- On a constant related to the prime counting function
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
- Sharper bounds for the Chebyshev function \(\theta (x)\)
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)