|
Another Criterion for the Riemann HypothesisEasyChair Preprint 6812, version historyVersion | Date | Pages | Version notes |
---|
1 | October 9, 2021 | 6 | | 2 | October 10, 2021 | 7 | I changed the theorem 2.6 with $\epsilon > 1$ since for $0 < \epsilon \leq 1$ the inequality in the theorem 2.6 is always satisfied. I also extended the result based on the known statement that there are infinitely many values of $x$ such that $\theta(x) > x + C \times \sqrt{x} \times \log \log \log x$ |
Keyphrases: Chebyshev function, Nicolas inequality, Riemann hypothesis, prime numbers |
|
|