Let$\ \sigma(n)$ be the sum-of divisors function, with the divisors raised to$\ 1$. If the Riemann Hypothesis is false, Robin proved there are infinitely many counterexamples to the inequality$$\ \sigma(n)<e^\gamma n \log \log n.$$ There are 27 small counterexamples, but the conjecture is that it holds for every$\ n>5040$. Akbary and Friggstad showed the least counterexample to it must be a superabundant number, i.e. a number$\ a$ such that$\ \frac{\sigma(a)}{a}>\frac{\sigma(b)}{b}$ for all$\ b<a$. Now, it is a virtual certainty that if the inequality fails (for some$\ n>5040$), the maximum of the ratio$\ \frac{\sigma(n)}{n \log \log n}$ will be reached by a colossally abundant number, namely a number$\ c$ such that$\ \frac{\sigma(c)}{c^{1+\epsilon}}>\frac{\sigma(d)}{d^{1+\epsilon}}$, for all$\ d<c$ and for some$\ \epsilon>0$. Since it could lead me to something on the subject, what I'm asking is: if the inequality fails, will only a finite number of colossally abundant numbers satisfy Robin's inequality?
2026-03-25 14:25:24.1774448724
If Robin's inequality ever fails, are there only finitely many colossally abundant numbers that satisfy it?
499 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in RIEMANN-HYPOTHESIS
- Verify the Riemann Hypothesis for first 1000 zeros.
- Reference for von Koch's 1901 theorem (RH characterization)
- How to contour integrate the Riemann Zeta function with a goal to verify the Riemann hypothesis?
- contributions of Riemann Hypothesis to physics if the Riemann zeta function is a solution for known differential equation?
- Heuristics on the asymptotic behaviour of the divisor funcion
- How to locate zeros of the Riemann Zeta function?
- Questions on Riemann's Prime-Power Counting Function $\Pi(x)$ and a Related Staircase Function
- Questions on Prime Counting Functions, Explicit Formulas, and Related Zeta Functions
- What is upper bound for the largest prime in a counter-example for robin's inequality
- How much of the Riemann Hypothesis has been solved?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
For the benefit of those who may not be familiar with all this:
In 1915 Ramanujan proved that if the Riemman Hypothesis is true, then for all sufficiently large $n$ we have an inequality on $\frac{\sigma(n)}{n}$, where $\sigma(n)$ is the sum of the divisors of the positive integer $n$. The inequality was $$\sigma(n)<e^\gamma n \ln\ln n$$ In 1984 Robin elaborated this to show that if there is a single exception to this for $n>5040$ (the largest currently known exception and a "colossally abundant number" - hereafter a "CA"), then the Riemann Hypothesis is false.
Because of the importance of the RH, this attracted a good deal of attention. But 30 years later nothing seems to have come of it.
Obviously the most plausible candidates to break the inequality are numbers with lots of divisors. I believe, though I am weak on the history, that the concept, if not the name, of CA came from Ramanujan during his 1915 work.
To give a little perspective: few people are interested in CA per se. But vast numbers of people are interested in RH, even if only a tiny number do serious work on it (because of the risk to one's reputation). So the immediate interest of the inequality was that it provided another way, superficially at least totally different, to disprove the RH by computation. People had got fed up with results that the first zillion zeros were on the line, particularly when analysts quoted Littlewood's "Miscellany" on the Skewes' number (which is now a somewhat less compelling point :) ). So this was something else to try.
However, after 30 years nothing has so far come of that. In the meantime people have been working on CA as objects of interest in their own right.
The question is whether if the RH is false (so that the inequality fails - Robin's result was an iff type result), then only a finite number of CA will satisfy the Robin inequality.
[Added later - the precise question having been clarified]
If I had realised that would be the question, I would never have started to answer it! I had earlier understood it to be a quite different question. But there are a few points to be made.
I have never read Robin's paper - my interest is in RH, and I do not regard Robin's inequality as a useful way of tackling the RH (a judgment which of course is of zero interest to anyone else). So I am at a serious disadvantage - in not having read the paper and to compound that, I cannot immediately lay my hands on it.
It is fairly easy to show that if $a,b$ are coprime counterexamples to the inequality, then so is $ab$ provided $a,b$ are sufficiently big (which they would be). It is also fairly clear that unless something weird happens at huge values, counterexamples are likely to be CA. So it seems a fairly safe guess that if RH is false then there will be infinitely many CA not satisfying the Robin inequality.
But unfortunately the question asks for something much stronger than that, namely will all but finitely many CA fail to satisfy it?
Short answer: good question; I have no idea and should delete this entire answer. But pending a little digging early in the coming week I will leave it here until a better answer comes.
In my defence, I would only say that I have only been using this site for less than 3 weeks. I have answered lots of daft questions, and had fun competing putting up answers fast. I failed to adjust adequately when this one came along. But it does illustrate the wisdom of the concept of clarifying the question with comments before writing Answers. I had started to do that, but got impatient when I could not immediately grasp the clarifications. That was entirely my fault. I apologise unreservedly.