Efficient prime counting and the Chebyshev primes

DOI10.1155/2013/491627zbMath1298.11094arXiv1109.6489OpenAlexW3105401817WikidataQ58919780 ScholiaQ58919780MaRDI QIDQ2249928

Michel Planat, Patrick Solé

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

zbMATH Keywords

Riemann hypothesisChebyshev primeRiemann prime

Mathematics Subject Classification ID

Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Distribution of primes (11N05) Primes (11A41)

Uses Software

• OEIS

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

This page was built for publication: Efficient prime counting and the Chebyshev primes