Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Parity bridge: the cofactor mmm of the packaged Euler configuration is odd

Proved
OddPerfectNumber.dris_packaged_cofactor_odd

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

number-theory

Euler's form of a hypothetical odd perfect number N=pkm2N = p^k m^2N=pkm2 is frequently packaged into the three identities

σ(pk)=2t,m2=t d,σ(m2)=pkd,\sigma(p^k) = 2t, \qquad m^2 = t\,d, \qquad \sigma(m^2) = p^k d,σ(pk)=2t,m2=td,σ(m2)=pkd,

together with the Euler congruences p≡k≡1(mod4)p \equiv k \equiv 1 \pmod 4p≡k≡1(mod4). Many statements about this configuration also carry the hypothesis that the cofactor mmm is odd. This theorem says that this hypothesis is redundant: as soon as m≠0m \neq 0m=0, the three identities and the two congruences already force mmm to be odd.

The argument is 222-adic. The divisor sum of a nonzero perfect square is always odd (for an even square the 222-part contributes 22a+1−12^{2a+1}-122a+1−1, and every odd prime contributes a sum of an odd number of odd terms). Since p≡1(mod4)p \equiv 1 \pmod 4p≡1(mod4) we have σ(pk)≡k+1≡2(mod4)\sigma(p^k) \equiv k+1 \equiv 2 \pmod 4σ(pk)≡k+1≡2(mod4), so ttt is odd. Multiplying the last two identities gives σ(m2) t=pkm2\sigma(m^2)\,t = p^k m^2σ(m2)t=pkm2, whose left-hand side is a product of two odd numbers; as ppp is odd, the right-hand side can be odd only if mmm is odd.

Preamble
import Mathlib
open Finset
Formal statement
namespace OddPerfectNumber

theorem dris_packaged_cofactor_odd (p k m t d : Nat)
    (hp : p.Prime) (hp4 : p % 4 = 1) (hk4 : k % 4 = 1) (hm0 : m ≠ 0)
    (hsig : (∑ x ∈ (p ^ k).divisors, x) = 2 * t)
    (hdvd : m ^ 2 = t * d)
    (hsigm : (∑ x ∈ (m ^ 2).divisors, x) = p ^ k * d) :
    Odd m := 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 (packaging of the Euler equation); Euler (1849) congruences p = k = 1 (mod 4).

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