ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive odd integer. Call nn abundant if σ(n)≥2n\sigma(n) \geq 2n, and call it nonsquare if it is not a perfect square. Nonsquare odd abundant numbers conjecture. Every nonsquare odd abundant number is {−1,1}\{-1,1\}-perfect. The paper notes that this holds for every such number checked computationally, while Theorem 3 rules out odd square abundant numbers; the conjecture remains open.

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.