2015/12/31 · Abstract:The conjectured Robin inequality for an integer n>7! is \sigma(n)<e^\gamma n \log \log n, where \gamma denotes Euler constant, ...

2016/11/23 · Abstract. The conjectured Robin inequality for an integer n > 7! is σ(n) < eγnlog log n, where γ denotes the Euler constant, and σ(n) = Pd|n.

2024/09/06 · The conjectured Robin inequality for an integer n > 7! is σ(n) < e γ n log log n, where γ denotes Euler constant, and σ(n) = d|n d.

Abstract. The conjectured Robin inequality for an integer n > 7! is σ(n) < eγ n log log n, where γ denotes Euler constant, and σ(n) = Pd|n d. We prove.

The main ingredients of the proof are an estimate for Chebyshev summatory function, and an effective version of Mertens third theorem due to Rosser and ...

The conjectured Robin inequality for an integer n > 7! is (n) < e n log log n, where denotes the Euler constant, and (n) = P d|n d. Robin proved that this ...

In the following, we will give six lemmas as preliminaries for the proofs of. Theorem 1~4. For the convenience of statement, we appoint that the natural ...

In 1984 Robin proved that the inequality f(n) < 1, for all n ≥ 5041, is equivalent to the Riemann hypothesis. Here we show that the values of f are close to 0 ...

This is the least crank-looking paper on RH I've seen. Looking on arXiv, Patrick Sole is a real mathematician putting out various papers (on arxiv at least) ...

2022/12/28 · Robin proved that the Riemann hypothesis is true if and only if the inequality holds for every integer, where is the Euler–Mascheroni constant.