ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k>2k>2 be a prime such that 2k−12^k-1 is a Mersenne prime. For integers alpha,β>1alpha, \beta>1 and an odd prime p<3⋅2α−1−1p<3\cdot 2^{\alpha-1}-1, let

n=2α−1pβ−1.n=2^{\alpha-1}p^{\beta-1}.

Generalized perfect-number conjecture. One has

n∣σk(n)n\mid \sigma_k(n)

if and only if nn is an even perfect number different from 2k−1(2k−1)2^{k-1}(2^k-1).

This conjecture extends the preceding results for k=3k=3 and k=5k=5 to primes kk for which 2k−12^k-1 is a Mersenne prime. The source states that computation supports it, while the described method does not apply to other values of kk; its general status is therefore 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.