ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N=qkn2N=q^k n^2 be an odd perfect number in Eulerian form: qq is prime, q≡k≡1(mod4)q\equiv k\equiv 1\pmod 4, and gcd⁡(q,n)=1\gcd(q,n)=1. Let σ(m)\sigma(m) denote the sum of the positive divisors of mm. Divisibility conjecture. The following assertions hold:

  • If q=qk<nq=q^k<n, then q∤σ(n)q\nmid\sigma(n).
  • If n<q=qkn<q=q^k, then n∤σ(q)n\nmid\sigma(q).

These assertions are proposed as open problems concerning the two possible orderings of the components. The existence of odd perfect numbers is unknown, so the conjecture has not been settled.

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.