Connectedness conjecture for the lattice of superabundant numbers
Statement
Let be the set of superabundant numbers, meaning the integers for which
where denotes the sum of the divisors of . Consider the lattice whose vertices are the elements of and whose links correspond to multiplication or division by primes.
Connectedness conjecture. Given a superabundant number , either there is a prime such that is superabundant or there is a prime such that is superabundant; moreover, there is always a chain of primes such that successive multiplication or division by these primes reaches .
This is proposed as a weaker version of the Alaoglu–Erdős conjecture after computational counterexamples to both its upward and downward halves. The source does not report a resolution of this weaker conjecture.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.