ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m≥2m\geq 2, and let nn be a positive integer. Define the divisor-sum function by

σ(n)=∑d∣nd.\sigma(n)=\sum_{d\mid n}d.

A positive integer is mm-perfect (or multiply perfect) if

σ(n)=mn.\sigma(n)=mn.

Generalized Sylvester conjecture. There is no odd mm-perfect number for m≥2m\geq 2.

For m=2m=2, an mm-perfect number is an ordinary perfect number, so this generalizes Sylvester's conjecture. The paper motivates the extension by observing that all known multiply perfect numbers are even; the existence of odd mm-perfect numbers 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.