Sylvester's conjecture on odd perfect numbers

Let nn be a positive integer, and let σ(n)\sigma(n) denote the sum of the positive divisors of nn. A positive integer is perfect if

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

Sylvester's conjecture. There is no odd perfect number.

The conjecture asserts that every perfect number is even; all currently known perfect numbers are even, while the existence of any odd perfect number remains open. The paper notes that any odd perfect number, if one exists, must exceed 10150010^{1500}.

Sources & referencesView supporting material

Primary source

Keneth Adrian Dagal, “Sylvester's Conjecture and the Egyptian Fractions”, arXiv:2007.14305 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.