Harmonic numbers and the prime counting function

MaRDI QIDQ4987411zbMATH OpenFDO

Authors Jesse Elliott

Publication date 3 May 2021

Full work available at URL https://arxiv.org/abs/2002.02188, http://math.colgate.edu/~integers/v31/v31.pdf

zbMATH Keywords

approximations to the prime counting function

Mathematics Subject Classification ID

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

Abstract: We provide approximations to the prime counting function by various discretized versions of the logarithmic integral function, expressed solely in terms of the harmonic numbers. We demonstrate with explicit error bounds that these approximations are at least as good as the logarithmic integral approximation. As a corollary, we provide some reformulations of the Riemann hypothesis in terms of the prime counting function and the harmonic numbers.

Recommendations

• Improving Riemann prime counting
• The prime-counting function and its analytic approximations. \(\pi(x)\) and its approximations
• Harmonic sets and the harmonic prime number theorem
• Efficient prime counting and the Chebyshev primes
• On the approximation of (x)

Cites work

• An Elementary Problem Equivalent to the Riemann Hypothesis
• Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann
• Multiplicative number theory. I. Classical theory
• On some inequalities for the gamma and psi functions
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• The large sieve
• VINOGRADOV'S INTEGRAL AND BOUNDS FOR THE RIEMANN ZETA FUNCTION

Cited in

(3)

• Improving Riemann prime counting
• Harmonic sets and the harmonic prime number theorem
• Finite binomial sum identities with harmonic numbers

This page was built for publication: Harmonic numbers and the prime counting function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987411)