Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Dandapat–Hunsucker–Pomerance (1975): σ(pk)=2m2\sigma(p^k)=2m^2σ(pk)=2m2 and σ(m2)=pk\sigma(m^2)=p^kσ(m2)=pk are incompatible

Proved
OddPerfectNumber.dandapat_hunsucker_pomerance_two

by Gabewhigham · Sep 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

divisor-sumsnumber-theoryperfect-numbers

Write σ(n)=∑d∣nd\sigma(n)=\sum_{d\mid n} dσ(n)=∑d∣n​d for the sum-of-divisors function.

Let ppp be a prime, let k≥1k \ge 1k≥1 and let mmm be odd. Then the pair of equations

σ(pk)=2m2,σ(m2)=pk\sigma(p^{k}) = 2m^{2}, \qquad \sigma(m^{2}) = p^{k}σ(pk)=2m2,σ(m2)=pk

has no simultaneous solution.

Context. If N=pkm2N = p^{k}m^{2}N=pkm2 is an odd perfect number in Euler form, the Dris parametrisation writes 2m2=σ(pk)s2m^{2} = \sigma(p^{k})s2m2=σ(pk)s and σ(m2)=pks\sigma(m^{2}) = p^{k}sσ(m2)=pks for a positive integer sss, the index of the solution. The value s=1s = 1s=1 is the extremal case m2≤pkm^{2} \le p^{k}m2≤pk, 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 kkk, so that every hypothetical odd perfect number has index s≥2s \ge 2s≥2.

This is the case t=2t = 2t=2, n=m2n = m^{2}n=m2 of Theorem 1 of Dandapat, Hunsucker and Pomerance (1975), which determines all solutions of σ(n)=pa\sigma(n) = p^{a}σ(n)=pa, σ(pa)=tn\sigma(p^{a}) = tnσ(pa)=tn: they are (n,p,a,t)=(21,2,5,3)(n,p,a,t) = (21,2,5,3)(n,p,a,t)=(21,2,5,3) and n=2cn = 2^{c}n=2c, p=2c+1−1p = 2^{c+1}-1p=2c+1−1, a=1a = 1a=1, t=2t = 2t=2. Neither is of the above shape with mmm 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 OddPerfectNumber
Source
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).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me