Efficient prime counting and the Chebyshev primes
From MaRDI portal
Publication:2249928
DOI10.1155/2013/491627zbMath1298.11094arXiv1109.6489WikidataQ58919780 ScholiaQ58919780MaRDI QIDQ2249928
Publication date: 4 July 2014
Published in: Journal of Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.6489
11M26: Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses
11N05: Distribution of primes
11A41: Primes
Uses Software
Cites Work
- Approximate formulas for some functions of prime numbers
- The corfis subroutine for the generation of selected level percentage points of the pearson type VI distribution
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item