The unequal-GCD conjecture for odd perfect numbers

About 4 years old · traced to

Let N=qkn2N=q^k n^2 be an odd perfect number in Eulerian form, where qq is the special prime and gcd⁡(q,n)=1\gcd(q,n)=1. Consider the two greatest common divisors

gcd⁡(σ(qk),σ(n2))\gcd(\sigma(q^k),\sigma(n^2))

and

gcd⁡(n2,σ(n2)).\gcd(n^2,\sigma(n^2)).

Unequal-GCD conjecture. Unconditionally, these two quantities are unequal:

gcd⁡(σ(qk),σ(n2))≠gcd⁡(n2,σ(n2)).\gcd(\sigma(q^k),\sigma(n^2))\neq\gcd(n^2,\sigma(n^2)).

This is posed as a future research problem and remains open.

References

Primary source

Jose Arnaldo Bebita Dris, “A new approach to odd perfect numbers via GCDs”, arXiv:2202.08116 (2022).

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.