Replacing the n-th prime by the sum of logarithms of the first n primes makes analogues of Cramer, Andrica, Legendre, Oppermann, Brocard, Firoozbakht, Fourges, Nicholson, and Farhadian conjectures provable theorems.
New estimates for the $n$th prime number
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime counting function. A further main tool is the usage of estimates concerning the reciprocal of $\log p_n$. As an application we derive refined estimates for $\vartheta(p_n)$ in terms of $n$, where $\vartheta(x)$ is Chebyshev's $\vartheta$-function.
citation-role summary
background 1
citation-polarity summary
fields
math.NT 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Behaviour of the sequence $\vartheta_n = \vartheta(p_n)$
Replacing the n-th prime by the sum of logarithms of the first n primes makes analogues of Cramer, Andrica, Legendre, Oppermann, Brocard, Firoozbakht, Fourges, Nicholson, and Farhadian conjectures provable theorems.