Download PDFOpen PDF in browser

Short Note on the Riemann Hypothesis

EasyChair Preprint no. 6347, version 2

Versions: 12history
8 pagesDate: December 27, 2021


Robin criterion states that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma } \times n \times \log \log n$ holds for all natural numbers $n > 5040$, where $\sigma(n)$ is the sum-of-divisors function of $n$ and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. Let $q_{1} = 2, q_{2} = 3, \ldots, q_{m}$ denote the first $m$ consecutive primes, then an integer of the form $\prod_{i=1}^{m} q_{i}^{a_{i}}$ with $a_{1} \geq a_{2} \geq \cdots \geq a_{m} \geq 0$ is called an Hardy-Ramanujan integer. If the Riemann hypothesis is false, then there are infinitely many Hardy-Ramanujan integers $n > 5040$ such that Robin inequality does not hold and we prove that $n^{\left(1 - \frac{0.6253}{\log q_{m}}\right)} < N_{m}$, where $N_{m} = \prod_{i = 1}^{m} q_{i}$ is the primorial number of order $m$ and $q_{m}$ is the largest prime divisor of $n$. In addition, we show that $q_{m}$ will not have an upper bound by some positive value for these counterexamples and therefore, the value of $q_{m}$ tends to infinity as $n$ goes to infinity.

Keyphrases: prime numbers, Riemann hypothesis, Robin inequality, sum-of-divisors function

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Frank Vega},
  title = {Short Note on the Riemann Hypothesis},
  howpublished = {EasyChair Preprint no. 6347},

  year = {EasyChair, 2021}}
Download PDFOpen PDF in browser