arXiv 1602.033842016-02math.NT

An asymptotic Robin inequality

Patrick Solé, Yuyang Zhu

备注：: 5 pages

英文摘要：

The conjectured Robin inequality for an integer $n>7!$ is $σ(n)<e^γn \log \log n,$ where $γ$ denotes Euler constant, and $σ(n)=\sum_{d | n} d $. Robin proved that this conjecture is equivalent to Riemann hypothesis (RH). Writing $D(n)=e^γn \log \log n-σ(n),$ and $d(n)=\frac{D(n)}{n},$ we prove unconditionally that $\liminf_{n \rightarrow \infty} d(n)=0.$ 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 Schoenfeld. A new criterion for RH depending solely on $\liminf_{n \rightarrow \infty}D(n)$ is derived.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Robin's inequality for 20-free integers

In 1984, Robin showed that the Riemann Hypothesis for $ζ$ is equivalent to demonstrating $σ(n) < e^γn \log \log n$ for all $n > 5040$. Robin's inequality has since been proven for various infinite families of power-free integers: $5$-free integers, $7$-free integers, and $11$-free integers. We extend these results to cover $20$-free integers.

2020-07-20math.NT

Properties of Prime Products and Robin's Inequality

There are many formulations of problems that have been proven to be equivalent to the Riemann Hypothesis in modern mathematics. In this paper we look at the formulation of an inequality derived by Robin in 1984 that proves the Riemann Hypothesis true if and only if Robin's Inequality is true for all $n\geq 5040$. In this paper we look at explicit products of prime numbers and show that if a given $n=p_1^{k_1}p_2^{k_2}\ldots p_m^{k_m}$ satisfies Robin's Inequality, then $n=P_1^{k_1}P_2^{k_2}\ldots P_m^{k_m}$ with $p_j \leq P_j$ also satisfies the inequality. We also then offer two conjectures t…

2020-02-19math.NT

An analogue of the Robin inequality of the second type for odd integers

In this paper we give a variant of the Robin inequality which states that $\frac{σ(n)}{n} \leq \frac{e^γ}{2} \log\log n + \frac{0.7398\cdots}{\log\log n}$ for any odd integer $n \geq 3$.

2022-03-21math.NT

Robin's inequality for new families of integers

Robin's criterion states that the Riemann Hypothesis (RH) is true if and only if Robin's inequality $σ(n):=\sum_{p|n}p<e^γ n \log \log n$ is satisfied for $n > 5040$, where $γ$ denotes the Euler-Mascheroni constant. We show that if the 2-adic order of n is big enough in comparison to the odd part of n then Robin's inequality is satisfied. We also show that if an positive integer $n$ satisfies either $ν_2(n) \leq 19$, $ν_3(n) \leq 12$,$ν_5(n) \leq 7$, $ν_7(n) \leq 6$, $ν_{11}(n) \leq 5$ then Robin's inequality is satisfied, where $ν_p(n)$ is the p-adic order of $n$. In the end we show that $σ(n…

2018-08-18math.NT

On Robin's inequality

Let $σ(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $σ(n) < e^γn \log \log n$ holds for every positive integer $n \geq 5041$, where $γ$ is the Euler-Mascheroni constant. In this paper we establish a new family of integers for which Robin's inequality $σ(n) < e^γn \log \log n$ hold. Further, we establish a new unconditional upper bound for the sum of divisors function. For this purpose, we use an approximation for Chebyshev's $\vartheta$-function and for some product defined over prime numbers.

2021-10-29math.NT

The Nicolas and Robin inequalities with sums of two squares

In 1984, G. Robin proved that the Riemann hypothesis is true if and only if the Robin inequality $σ(n)<e^γn\log\log n$ holds for every integer $n>5040$, where $σ(n)$ is the sum of divisors function, and $γ$ is the Euler-Mascheroni constant. We exhibit a broad class of subsets $\cS$ of the natural numbers such that the Robin inequality holds for all but finitely many $n\in\cS$. As a special case, we determine the finitely many numbers of the form $n=a^2+b^2$ that do not satisfy the Robin inequality. In fact, we prove our assertions with the Nicolas inequality $n/ϕ(n)<e^γ\log \log n$; since $σ(n…

2007-10-12math.NT

更多相关论文收起更多论文

关于 Robin 不等式与 Kaneko-Lagarias 不等式

On Robin's Inequality and the Kaneko-Lagarias Inequality

本文用初等方法证明 Robin 不等式和 Lagarias 不等式对几乎所有数成立，并证明 Kaneko-Lagarias 不等式对所有自然数成立当且仅当其对所有过剩数成立。

2025-08-16math.NT

Preventing Exceptions to Robins InEquality

For sufficiently large n Ramanujan gave a sufficient condition for the truth Robin's InEquality $X(n):=\frac{σ(n)}{n\ln\ln n}<e^γ$ (RIE). The largest known violation of RIE is $n_8=5040$. In this paper Robin's multipliers are split into logarithmic terms $\mathcal{L}$ and relative divisor sums $\mathcal{G}$. A violation of RIE above $n_{8}$ is proposed to imply oscillations that cause $\mathcal{G}$ to exceed $\mathcal{L}$. To this aim Alaoglu and Erdős's conjecture for the CA numbers algorithm is used and the paper's key points are in section 4.2

2013-08-26math.NT

Robin不等式的一种有限算术形式及其与黎曼猜想的等价性

A finite arithmetic form of Robin's inequality and its equivalence to the Riemann hypothesis

University of Cambridge（剑桥大学）；University of California, Berkeley（加州大学伯克利分校）

本文提出Robin不等式的有限截断形式，证明其与Robin不等式及黎曼猜想等价，并给出若干整数类上的无条件证明及反例性质。

2026-09-23math.NT

关于Robin不等式的最小巨丰例外数

On the Least Colossally Abundant Exception to Robin's Inequality

该研究针对Robin不等式与黎曼假设的关联问题，通过分析连续巨丰数的素数或半素商，证明若黎曼假设不成立，最小的巨丰反例必被限制在特定区间，排除在更高阈值的无穷集合之外。

2025-10-27math.NT

On numbers satisfying Robin's inequality, properties of the next counterexample and improved specific bounds

Define $s (n) := n^{- 1} σ(n)$ ($σ(n):=\sum_{d|n}d )$ and $ω(n)$ is the number of prime divisors of $n$. One of the properties of $s$ plays a central role: $s (p^a) > s (q^b)$ if $p < q$ are prime numbers, with no special condition on $a, b$ other than $a, b \geqslant 1$. This result, combined with the Multiplicity Permutation theorem, will help us establish properties of the next counterexample (say $c$) to Robin's inequality $s (n) < e^γ \log \log n$. The number $c$ is superabundant, and $ω(c)$ must be greater than a number close to one billion. In addition, the ratio $p_{ω(c)} / \log c$ has…

2020-05-19math.NT

A better method than t-free for Robin's hypothesis

For a positive integer t>1, an integer N is called t-free if the exponent of any prime factor of N is less than t. Some works shown if N is t-free, then N satisfies Robin's inequality, for t=5, 7, 11, 16. This article shows that the condition of t-free can be resuced to "N cannot be divided by t-th power of 2". I proved that if N cannot be divided by 17-th power of 2, then N satisfies Robin's inequality.

2018-12-28math.NT

Robin inequality for $7-$free integers

Recall that an integer is $t-$free iff it is not divisible by $p^t$ for some prime $p.$ We give a method to check Robin inequality $σ(n) < e^γn\log\log n,$ for $t-$free integers $n$ and apply it for $t=6,7.$ We introduce $Ψ_t,$ a generalization of Dedekind $Ψ$ function defined for any integer $t\ge 2$ by $$Ψ_t(n):=n\prod_{p | n}(1+1/p+...+1/p^{t-1}).$$ If $n$ is $t-$free then the sum of divisor function $σ(n)$ is $ \le Ψ_t(n).$ We characterize the champions for $x \mapsto Ψ_t(x)/x,$ as primorial numbers. Define the ratio $R_t(n):=\frac{Ψ_t(n)}{n\log\log n}.$ We prove that, for all $t$, there e…

2010-12-03math.NT

互反LCM幂函数与罗宾准则

Reciprocal LCM powers and Robin's criterion

该研究针对κ>1的互反LCM幂函数，确定其平均阶与极值阶，利用定向区间算术证明对n>5040且1<κ≤100000时对应罗宾不等式成立，给出等价于RH的准则。

2026-10-12math.NT

On Robin's criterion for the Riemann Hypothesis

Robin's criterion states that the Riemann Hypothesis (RH) is true if and only if Robin's inequality sum_{d|n}d<e^{gamma}n loglog n is satisfied for n>=5041, where gamma denotes the Euler(-Mascheroni) constant. We show by elementary methods that if n>=37 does not satisfy Robin's criterion it must be even and is neither squarefree nor squarefull. Using a bound of Rosser and Schoenfeld we show, moreover, that n must be divisible by a fifth power >1. As a consequence we infer that RH holds true if and only if every natural number divisible by a fifth power >1 satisfies Robin's inequality.

2006-09-07math.NT

Subsets of colossally abundant numbers

Let $G(n)=σ(n)/(n \log \log n )$. Robin made hypothesis that $G(n)<e^γ$ for all integer $n>5040$. This article divides all colossally abundant numbers in to three disjoint subsets CA1, CA2 and CA3, and shows that Robin hypothesis is true if and only if all CA2 numbers $n>5040$ satisfy Robin inequality.

2019-03-08math.NT

Analogues of the Robin-Lagarias Criteria for the Riemann Hypothesis

Robin's criterion states that the Riemann hypothesis is equivalent to $σ(n) < e^γn \log\log n$ for all integers $n \geq 5041$, where $σ(n)$ is the sum of divisors of $n$ and $γ$ is the Euler-Mascheroni constant. We prove that the Riemann hypothesis is equivalent to the statement that $σ(n) < \frac{e^γ}{2} n \log\log n$ for all odd numbers $n \geq 3^4 \cdot 5^3 \cdot 7^2 \cdot 11 \cdots 67$. Lagarias's criterion for the Riemann hypothesis states that the Riemann hypothesis is equivalent to $σ(n) < H_n + \exp{H_n}\log{H_n}$ for all integers $n \geq 1$, where $H_n$ is the $n$th harmonic number. W…

2020-08-11math.NT