Related papers: 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 $\sigma(n):=\sum_{p|n}p<e^{\gamma} n \log \log n$ is satisfied for $n > 5040$, where $\gamma$ denotes the Euler-Mascheroni constant. We show…

Robin's criterion states that the Riemann hypothesis is equivalent to $\sigma(n) < e^\gamma n \log\log n$ for all integers $n \geq 5041$, where $\sigma(n)$ is the sum of divisors of $n$ and $\gamma$ is the Euler-Mascheroni constant. We…

In 1984, G. Robin proved that the Riemann hypothesis is true if and only if the Robin inequality $\sigma(n)<e^\gamma n\log\log n$ holds for every integer $n>5040$, where $\sigma(n)$ is the sum of divisors function, and $\gamma$ is the…

Let $\sigma(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 $\sigma(n) < e^{\gamma}n \log \log n$ holds for every positive integer $n \geq…

Robin's theorem is one of the ingenious reformulation of the Riemann hypothesis (RH). It states that the RH is true if and only if $\sigma(n)<e^\gamma n\log\log n$ for all $n>5040$ where $\sigma(n)$ is the sum of divisors of $n$ and…

The Robin criterion states that the Riemann hypothesis is equivalent to the inequality $\sigma(n) < e^\gamma n \log \log n$ for all $n>5040$, where $\sigma(n)$ is the sum of divisors of $n$, and $\gamma$ is the Euler--Mascheroni constant.…

As essential condition for the validy of Robin's Theorem as a precondition for the proof of the Riemann hypothesis, we show that the minimum of the function $F={\rm e}^{\gamma}\,\ln(\ln\,n)-\sigma(n)/n$ is found to be positive. Therefore,…

The conjectured Robin inequality for an integer $n>7!$ is $\sigma(n)<e^\gamma n \log \log n,$ where $\gamma$ denotes Euler constant, and $\sigma(n)=\sum_{d | n} d $. Robin proved that this conjecture is equivalent to Riemann hypothesis…

Robin's Inequality posits $G(n)<e^{\gamma}$ for $n>5040$. Robin also showed that if the Riemann Hypothesis (RH) is false, then $G(n)>e^{\gamma}\left(1+\displaystyle\frac{c}{(\log n)^{b}}\right)$ for infinitely many values of $n$. By…

In this paper, we make use of Robin and Lagarias' criteria to prove Riemann hypothesis. The goal is, using Lagarias criterion for $n\geq 1$ since Lagarias criterion states that Riemann hypothesis holds if and only if the inequality…

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

Let $\mathcal{P}$ be the set of all primes and $\psi(n)=n\prod_{n\in \mathcal{P},p|n}(1+1/p)$ be the Dedekind psi function. We show that the Riemann hypothesis is satisfied if and only if $f(n)=\psi(n)/n-e^{\gamma} \log \log n <0$ for all…

In 1984, Robin showed that the Riemann Hypothesis for $\zeta$ is equivalent to demonstrating $\sigma(n) < e^\gamma n \log \log n$ for all $n > 5040$. Robin's inequality has since been proven for various infinite families of power-free…

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…

For n>1, let G(n)=\sigma(n)/(n log log n), where \sigma(n) is the sum of the divisors of n. We prove that the Riemann Hypothesis is true if and only if 4 is the only composite number N satisfying G(N) \ge \max(G(N/p),G(aN)), for all prime…

Let $G(n)=\sigma (n)/(n \log \log n )$. Robin made hypothesis that $G(n)<e^\gamma$ for all integer $n>5040$. If Robin hypothesis fails, there will be a least counterexample. This article collects the requirements the least counterexample…

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 $\sigma(n) < e^\gamma n\log\log n,$ for $t-$free integers $n$ and apply it for $t=6,7.$ We introduce…

Let $G(n)=\sigma (n)/(n \log \log n )$. Robin made hypothesis that $G(n)<e^\gamma$ for all integer $n>5040$. If there exists counterexample to Robin hypothesis, then there must exist finite number of counterexamples $n>5040$ such that…

For sufficiently large n Ramanujan gave a sufficient condition for the truth Robin's InEquality $X(n):=\frac{\sigma(n)}{n\ln\ln n}<e^{\gamma}$ (RIE). The largest known violation of RIE is $n_8=5040$. In this paper Robin's multipliers are…

Let $G(n)=\sigma (n)/(n \log \log n )$. Robin made hypothesis that $G(n)<e^\gamma$ 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…