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.
On the first sign change of $\theta(x) - x$
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Let $\theta(x) = \sum_{p\leq x} \log p$. We show that $\theta(x)<x$ for $2<x< 1.39\cdot 10^{17}$. We also show that there is an $x<\exp(727.951332668)$ for which $\theta(x) >x.$
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.