Sharper bounds for the error term in the prime number theorem
From MaRDI portal
Publication:6095446
DOI10.1007/s40993-023-00454-warXiv2206.12557OpenAlexW4385622716WikidataQ123299847 ScholiaQ123299847MaRDI QIDQ6095446
Andrew Fiori, Habiba Kadiri, Joshua Swidinsky
Publication date: 8 September 2023
Published in: Research in Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.12557
(zeta (s)) and (L(s, chi)) (11M06) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Distribution of primes (11N05) Rate of growth of arithmetic functions (11N56)
Related Items (2)
Sharper bounds for the Chebyshev function \(\psi(x)\) ⋮ Explicit zero-free regions for the Riemann zeta-function
Cites Work
- Improving bounds on prime counting functions by partial verification of the Riemann hypothesis
- Nonnegative trigonometric polynomials and a zero-free region for the Riemann zeta-function
- Approximate formulas for some functions of prime numbers
- Estimates of $\psi ,\theta $ for large values of $x$ without the Riemann hypothesis
- Estimating $\pi (x)$ and related functions under partial RH assumptions
- Estimates for the Chebyshev Function ψ(x) - θ(x)
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
- An analytic method for bounding 𝜓(𝑥)
- Sharper bounds for the Chebyshev function 𝜃(𝑥)
- The Riemann hypothesis is true up to 3·1012
- The error term in the prime number theorem
- A still sharper region where $\pi (x)-{\mathrm {li}}(x)$ is positive
- Explicit Bounds for Some Functions of Prime Numbers
- On Ramanujan's prime counting inequality
- Updating the error term in the prime number theorem
- Sharper bounds for the Chebyshev function \(\psi(x)\)
- Some explicit estimates for the error term in the prime number theorem
This page was built for publication: Sharper bounds for the error term in the prime number theorem
