Related papers: On Robin's Inequality and the Kaneko-Lagarias Ineq…

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…

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…

We study the Lagarias inequality, an elementary criterion equivalent to the Riemann Hypothesis. Using a continuous extension of the harmonic numbers, we show that the sequence $B_n=\frac{H_n+e^{H_n}\log(H_n)}{n}$ is strictly increasing for…

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…

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…

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…

Define $s (n) := n^{- 1} \sigma (n)$ ($\sigma (n):=\sum_{d|n}d )$ and $\omega(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…

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…

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…

This article defines a new type of abundant numbers, called largest rho-value (abbreviate LR) numbers, and then shows that Robin hypothesis is true if and only if all LR numbers $>5040$ satisfy Robin inequality.

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…

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…

A well known result of Newman says that upto a limit, multiples of $3$ with even number of 1's in binary representation always exceed multiples of $3$ with odd number of 1's. The phenomenon of preponderance of even number of 1's is now…

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

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…

In this paper, we give a short and entirely elementary proof of the proposition ``For any positive integer $ N $, there exists a real number $ L $ such that for any real number $ x \geqq L $, there are at least $ N $ primes in the interval…

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

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…

A work by Nicolas has shown that if it can be proven that a certain inequality holds for all $n$, the Riemann hypothesis is true. This inequality is associated with the Mertens theorem, and hence the Euler totient at $\prod_{k=1}^n p_k$,…

Let $\Omega(n)$ denote the total number of prime divisors of $n$ (counting multiplicity) and let $\omega(n)$ denote the number of distinct prime divisors of $n$. Various inequalities have been proved relating $\omega(N)$ and $\Omega(N)$…