ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer, and let I(n)=σ(n)nI(n)=\frac{\sigma(n)}{n} denote its abundancy index, where σ(n)\sigma(n) is the sum of the positive divisors of nn. Theorem 1 states that nn is almost perfect if and only if

2nn+1≤I(n)<2n+1n+1.\frac{2n}{n+1}\leq I(n)<\frac{2n+1}{n+1}.

Best-possible bounds conjecture. The bounds in Theorem 1 are best-possible.

The preceding theorem characterizes almost perfect numbers through their abundancy index, and the open problem asks whether neither bound can be improved.

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.