Dandapat–Hunsucker–Pomerance (1975): and are incompatible
ProvedOddPerfectNumber.dandapat_hunsucker_pomerance_twodivisor-sumsnumber-theoryperfect-numbers
Write for the sum-of-divisors function.
Let be a prime, let and let be odd. Then the pair of equations
has no simultaneous solution.
Context. If is an odd perfect number in Euler form, the Dris parametrisation writes and for a positive integer , the index of the solution. The value is the extremal case , and it is exactly the pair of equations displayed above. Suryanarayana asked whether an odd perfect number must satisfy them; the statement here says it cannot, for any exponent , so that every hypothetical odd perfect number has index .
This is the case , of Theorem 1 of Dandapat, Hunsucker and Pomerance (1975), which determines all solutions of , : they are and , , , . Neither is of the above shape with odd.
Preamble
import Mathlib open Finset
Formal statement
namespace OddPerfectNumber
theorem dandapat_hunsucker_pomerance_two (p k m : ℕ) (hp : p.Prime) (hm : Odd m) (hk : k ≠ 0)
(h1 : (∑ d ∈ (p ^ k).divisors, d) = 2 * m ^ 2)
(h2 : (∑ d ∈ (m ^ 2).divisors, d) = p ^ k) : False := by sorry
end OddPerfectNumberSource
G. G. Dandapat, J. L. Hunsucker and C. Pomerance, Some new results on odd perfect numbers, Pacific J. Math. 57 (1975), 359-364, Theorem 1 and its Corollary (case t = 2, n = m^2; the equations (1) of the introduction, raised as a question by Suryanarayana).