Improving bounds on prime counting functions by partial verification of the Riemann hypothesis
From MaRDI portal
Publication:2097526
DOI10.1007/s11139-022-00616-xOpenAlexW3196476086WikidataQ114223553 ScholiaQ114223553MaRDI QIDQ2097526
Publication date: 14 November 2022
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.02249
Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Distribution of primes (11N05) Values of arithmetic functions; tables (11Y70)
Related Items
On Ramanujan's prime counting inequality ⋮ An explicit upper bound for \(L(1,\chi)\) when \(\chi\) is quadratic ⋮ Sharper bounds for the error term in the prime number theorem ⋮ On the error term in the explicit formula of Riemann–von Mangoldt ⋮ Sharper bounds for the Chebyshev function \(\psi(x)\) ⋮ Some explicit estimates for the error term in the prime number theorem ⋮ New bounds for numbers of primes in element orders of finite groups
Cites Work
- Unnamed Item
- Unnamed Item
- The mean square of the error term in the prime number theorem
- Remarks on Ramanujan's inequality concerning the prime counting function
- On Solving a Curious Inequality of Ramanujan
- Estimating $\pi (x)$ and related functions under partial RH assumptions
- 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
- Estimates for $\pi(x)$ for large values of $x$ and Ramanujan's prime counting inequality
- Numerical computations concerning the GRH