Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Dris parametrisation: 2m2=σ(pk)s2m^2 = \sigma(p^k)s2m2=σ(pk)s and σ(m2)=pks\sigma(m^2) = p^k sσ(m2)=pks

Proved
OddPerfectNumber.dris_parametrisation

by Gabewhigham · Sep 8, 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 an odd prime, let kkk be odd and let m≥1m \ge 1m≥1 satisfy the Euler equation

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

Then there is a positive integer sss — the Dris index of the solution — with

2m2=σ(pk) sandσ(m2)=pk s.2m^{2} = \sigma(p^{k})\,s \qquad\text{and}\qquad \sigma(m^{2}) = p^{k}\,s .2m2=σ(pk)sandσ(m2)=pks.

Context. By Euler's structure theorem an odd perfect number has the form N=pkm2N = p^{k}m^{2}N=pkm2 with ppp prime, p≡k≡1(mod4)p \equiv k \equiv 1 \pmod 4p≡k≡1(mod4) and p∤mp \nmid mp∤m; multiplicativity of σ\sigmaσ on the coprime factors pkp^{k}pk and m2m^{2}m2 turns perfection of NNN into exactly the displayed Euler equation. The two relations above are the standard parametrisation of its solutions: they follow because p∤σ(pk)p \nmid \sigma(p^{k})p∤σ(pk), so 12σ(pk)\tfrac12\sigma(p^{k})21​σ(pk) divides m2m^{2}m2 and pkp^{k}pk divides σ(m2)\sigma(m^{2})σ(m2), with the same quotient sss in both cases.

The parametrisation is the starting point for size comparisons between the two parts of an odd perfect number: s=1s = 1s=1 holds exactly in the extremal situation m2≤pkm^{2} \le p^{k}m2≤pk, and then σ(pk)=2m2\sigma(p^{k}) = 2m^{2}σ(pk)=2m2 and σ(m2)=pk\sigma(m^{2}) = p^{k}σ(m2)=pk.

Preamble
import Mathlib
open Finset
Formal statement
namespace OddPerfectNumber

theorem dris_parametrisation (p k m : ℕ) (hp : p.Prime) (hp2 : p ≠ 2) (hk : k % 2 = 1)
    (hm : m ≠ 0)
    (heq : (∑ d ∈ (p ^ k).divisors, d) * (∑ d ∈ (m ^ 2).divisors, d) = 2 * (p ^ k * m ^ 2)) :
    ∃ s : ℕ, 0 < s ∧ 2 * m ^ 2 = (∑ d ∈ (p ^ k).divisors, d) * s ∧
      (∑ d ∈ (m ^ 2).divisors, d) = p ^ k * s := by sorry

end OddPerfectNumber
Source
J. A. B. Dris, 'The abundancy index of divisors of odd perfect numbers', Journal of Integer Sequences 15 (2012), Article 12.4.4, Section 2 (the relations sigma(p^k)/2 | m^2 and p^k | sigma(m^2) with common quotient).

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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me