Estimating and related functions under partial RH assumptions
arXiv:1410.7015 · doi:10.1090/mcom/3060
Abstract
The aim of this paper is to give a direct interpretation of the validity of the Riemann hypothesis up to a certain height in terms of the prime-counting function . This is done by proving the well-known explicit Schoenfeld bound on the RH to hold as long as . Similar statements are proven for the Riemann prime-counting function and the Chebyshov functions and . Apart from that, we also improve some of the existing bounds of Chebyshov type for the function .
16 pages, corrected version with a missing summand in Theorem 1 added (explicit bounds in tables 1 and 2 are still valid), corrigendum for journal version in preparation
Cited by in corpus (7)
- Explicit estimates for the distribution of numbers free of large prime factors
- Robin's inequality for 20-free integers
- The reciprocal sum of primitive nondeficient numbers
- A harmonic sum over nontrivial zeros of the Riemann zeta-function
- Improved error bounds for the Fermat primality test on random inputs
- The Riemann hypothesis is true up to
- From explicit estimates for the primes to explicit estimates for the Möbius function II