Improving bounds on prime counting functions by partial verification of the Riemann hypothesis

DOI10.1007/S11139-022-00616-XOpenAlexW3196476086WikidataQ114223553 ScholiaQ114223553MaRDI QIDQ2097526FDOQ2097526

Authors: D. Johnston 

Publication date: 14 November 2022

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.02249

Recommendations

• Estimating \(\pi (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

zbMATH Keywords

Riemann hypothesisRiemann zeta-functionprime counting functionRamanujan inequality

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• Sharper bounds for the Chebyshev function \(\theta (x)\)
• Estimating \(\pi (x)\) and related functions under partial RH assumptions
• An analytic method for bounding \(\psi (x)\)
• The Riemann hypothesis is true up to 3·1012
• The error term in the prime number theorem
• The mean square of the error term in the prime number theorem
• Remarks on Ramanujan's inequality concerning the prime counting function
• On solving a curious inequality of Ramanujan
• Estimates for \(\pi(x)\) for large values of \(x\) and Ramanujan's prime counting inequality
• Numerical computations concerning the GRH

Cited In (16)

• Sharper bounds for the error term in the prime number theorem
• Estimates of the \(k\)th prime under the Riemann hypothesis
• New bounds for numbers of primes in element orders of finite groups
• On Ramanujan's prime counting inequality
• Some explicit estimates for the error term in the prime number theorem
• Title not available (Why is that?)
• Improving bounds on prime counting functions by partial verification of the Riemann hypothesis
• An explicit upper bound for \(L(1,\chi)\) when \(\chi\) is quadratic
• On the error term in the explicit formula of Riemann–von Mangoldt
• Sharper bounds for the Chebyshev function \(\psi(x)\)
• Title not available (Why is that?)
• Estimating \(\pi (x)\) and related functions under partial RH assumptions
• An explicit log-free zero density estimate for the Riemann zeta-function
• Improving Riemann prime counting
• Some applications of the Weil-Barner explicit formula
• Explicit estimates of some functions over primes

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)