Improving bounds on prime counting functions by partial verification of the Riemann hypothesis
From MaRDI portal
Publication:2097526
Recommendations
- Estimating (x) and related functions under partial RH assumptions
- On an inequality of Ramanujan concerning the prime counting function
- Estimates for \(\pi(x)\) for large values of \(x\) and Ramanujan's prime counting inequality
- Improving Riemann prime counting
- Estimates of \(\mathrm{li}(\theta (x))-\pi (x)\) and the Riemann hypothesis
Cites work
- An analytic method for bounding (x)
- Estimates for \(\pi(x)\) for large values of \(x\) and Ramanujan's prime counting inequality
- Estimating (x) and related functions under partial RH assumptions
- scientific article; zbMATH DE number 492966 (Why is no real title available?)
- scientific article; zbMATH DE number 3255845 (Why is no real title available?)
- Numerical computations concerning the GRH
- On solving a curious inequality of Ramanujan
- Remarks on Ramanujan's inequality concerning the prime counting function
- Sharper bounds for the Chebyshev function \(\theta (x)\)
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
- The error term in the prime number theorem
- The mean square of the error term in the prime number theorem
- The Riemann hypothesis is true up to 3·1012
Cited in
(18)- Explicit estimates of some functions over primes
- Estimates of the \(k\)th prime under the Riemann hypothesis
- Estimating (x) and related functions under partial RH assumptions
- Improving Riemann prime counting
- Some applications of the Weil-Barner explicit formula
- scientific article; zbMATH DE number 6266501 (Why is no real title available?)
- scientific article; zbMATH DE number 3105560 (Why is no real title available?)
- 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
- Improving bounds on prime counting functions by partial verification of the Riemann hypothesis
- An explicit log-free zero density estimate for the Riemann zeta-function
- The method of Pintz for the Ingham question about the connection of distribution of -zeroes and order of the error in the PNT in the Beurling context
- On the second Hardy-Littlewood conjecture
This page was built for publication: Improving bounds on prime counting functions by partial verification of the Riemann hypothesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097526)