Estimates of the \(k\)th prime under the Riemann hypothesis
From MaRDI portal
Publication:1991658
DOI10.1007/s11139-017-9984-4zbMath1441.11258OpenAlexW2821033401WikidataQ60692033 ScholiaQ60692033MaRDI QIDQ1991658
Publication date: 30 October 2018
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-017-9984-4
Riemann hypothesisprime numbersnumber theoryChebyshev functionsarithmetic functionscounting prime function
Arithmetic functions; related numbers; inversion formulas (11A25) Distribution of primes (11N05) Rate of growth of arithmetic functions (11N56)
Related Items
The sum of divisors function and the Riemann hypothesis, Remarks on Ramanujan's inequality concerning the prime counting function, New estimates for the $n$th prime number, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Fast computation of some asymptotic functional inverses
- Explicit estimates of some functions over primes
- Effective bounds for certain functions concerning prime numbers
- The \(n\)-th prime asymptotically
- Approximate formulas for some functions of prime numbers
- Estimates of $\psi ,\theta $ for large values of $x$ without the Riemann hypothesis
- On the first sign change of $\theta (x) -x$
- Small values of the Euler function and the Riemann hypothesis
- Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
- Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
- The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- Primes in arithmetic progressions