Download PDFOpen PDF in browserCurrent version

The Magic of Prime Numbers

EasyChair Preprint no. 11786, version 3

Versions: 1234history
10 pagesDate: January 19, 2024


Let $\Psi(n) = n \cdot \prod_{q \mid n} \left(1 + \frac{1}{q} \right)$ denote the Dedekind $\Psi$ function where $q \mid n$ means the prime $q$ divides $n$. Define, for $n \geq 3$; the ratio $R(n) = \frac{\Psi(n)}{n \cdot \log \log n}$ where $\log$ is the natural logarithm. Let $N_{n} = 2 \cdot \ldots \cdot q_{n}$ be the primorial of order $n$. We prove if the inequality $R(N_{n+1}) < R(N_{n})$ holds for all primes $q_{n}$ (greater than some threshold), then the Riemann hypothesis is true and the Cramér's conjecture is false. In this note, we show that the previous inequality always holds for all large enough prime numbers.

Keyphrases: Chebyshev function, Cramér's conjecture, prime numbers, Riemann hypothesis, Riemann zeta 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 = {The Magic of Prime Numbers},
  howpublished = {EasyChair Preprint no. 11786},

  year = {EasyChair, 2024}}
Download PDFOpen PDF in browserCurrent version