Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
631 views

$\frac{\sigma(n)}{n} < e \ln \ln (n)$ is true?

In Guy Robin, Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann, J. Math. Pures Appl. 63 (1984), 187–213 (pdf) we find the following result: If the Riemann hypothesis is true ...
The Company's user avatar
15 votes
3 answers
3k views

On Robin's criterion for RH [closed]

\begin{equation} \sigma(n) < e^\gamma n \log \log n \end{equation} In 1984 Guy Robin proved that the inequality is true for all n ≥ 5,041 if and only if the Riemann hypothesis is true (Robin 1984)....
Roupam Ghosh's user avatar
5 votes
1 answer
357 views

Can the Lagarias inequality be written as a "kernel inequality"?

The Lagarias inequality, which is equivalent to the Riemann hypothesis, is: $$\sigma(n) \le H_n + \exp(H_n) \log(H_n) =:L(n)$$ for all natural numbers $n$, where $\sigma=$ sum of divisors, $H_n=n$-th ...
mathoverflowUser's user avatar
3 votes
1 answer
437 views

Is there a Riemann Hypothesis criterion utilizing sum of squares of divisors?

Robin's inequality $$\sigma_1(n)<e^\gamma n\log\log n$$ at integers $n>5040$ provides necessary and sufficient condition for Riemann Hypothesis where $\sigma_1(n)=\sum_{d|n}d$ is sum of divisors ...
Turbo's user avatar
  • 13.9k