ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S\mathcal{S} be the set of superabundant numbers, meaning the integers nn for which

σ(n)n>σ(m)σ(m)for 1≤m<n,\frac{\sigma(n)}{n}>\frac{\sigma(m)}{\sigma(m)}\qquad\text{for }1\leq m<n,

where σ(n)\sigma(n) denotes the sum of the divisors of nn. Consider the lattice whose vertices are the elements of S\mathcal{S} and whose links correspond to multiplication or division by primes.

Connectedness conjecture. Given a superabundant number nn, either there is a prime pp such that npnp is superabundant or there is a prime qq such that n/qn/q is superabundant; moreover, there is always a chain of primes p1,p2,…,pmp_1,p_2,\ldots,p_m such that successive multiplication or division by these primes reaches 11.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.