Numerically explicit estimates for the distribution of rough numbers
From MaRDI portal
Publication:6131177
DOI10.1016/J.JNT.2024.01.008arXiv2306.03347MaRDI QIDQ6131177FDOQ6131177
Authors: Kai Fan
Publication date: 4 April 2024
Published in: Journal of Number Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2306.03347
Recommendations
Cites Work
- Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
- An explicit density estimate for Dirichlet \(L\)-series
- Approximate formulas for some functions of prime numbers
- 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)\)
- Explicit estimates of some functions over primes
- Title not available (Why is that?)
- An improvement of Selberg's sieve method I
- Nonnegative trigonometric polynomials and a zero-free region for the Riemann zeta-function
- An inequality for the distribution of numbers free of small prime factors
- An inequality related to the sieve of Eratosthenes
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)