I have asked this question in MSE a few weeks back, but did not receive any responses. I have cross-posted it to MO, hoping that it is appropriate for this site.

Let $\sigma(x)$ be the (classical) sum of the divisors of $x$.

A number $N \in \mathbb{N}$ is called perfect if $\sigma(N)=2N$.

An even perfect number $U$ is said to be given in Euclidean form if $U=(2^p - 1){2^{p-1}}$ (where $2^p - 1$ is called the Mersenne prime). On the other hand, an odd perfect number $L$ is said to be given in Eulerian form if $L = {q^k}{n^2}$ (where $q$ is called the Euler prime).

Notice that for even perfect numbers, trivially we have $1 < 2^p - 1$ (where $1$ is the exponent of the Mersenne prime $2^p - 1$).

Does a similar statement hold for odd perfect numbers? That is, does $k < q$ always hold?

  • $\begingroup$ Note that the statement is true when $n < q$, as then we have $1 = k < n < q$. $\endgroup$ – Arnie Bebita-Dris Apr 25 '15 at 4:11
  • $\begingroup$ You left out the essential condition that $k$ is odd. $\endgroup$ – Richard Stanley Apr 25 '15 at 13:34
  • 1
    $\begingroup$ Since squares are not perfect, I think that it is implicit that $k$ must be odd. (In fact, it is known that $k \equiv 1 \pmod 4$ holds.) $\endgroup$ – Arnie Bebita-Dris May 15 '15 at 6:21
  • $\begingroup$ Trivially, $k < q$ always holds when $k = 1$. $\endgroup$ – Arnie Bebita-Dris Jul 19 '16 at 14:17
  • $\begingroup$ However, Brown has recently announced a proof for the inequality $q < n$. $\endgroup$ – Arnie Bebita-Dris Jul 19 '16 at 14:22

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.