Abstract
In mathematics, the Riemann Hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part $\frac{1}{2}$. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution. In 1915, Ramanujan proved that under the assumption of the Riemann Hypothesis, the inequality $\sigma(n)5040$ if and only if the Riemann Hypothesis is true. Let $n>5040$ be $n=r\timesq$, where $q$ denotes the largest prime factor of $n$. If $n>5040$ is the smallest number such that Robin inequality does not hold, then we show the following inequality is also satisfied: $\sqrt[q]{e}+\frac{\log\log r}{\log\log n}>2$.