Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Euler's form of an odd perfect number

Proved
OddPerfectNumber.euler_form

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

divisor-sumsnumber-theoryopen-problemperfect-numbers

Euler's theorem on odd perfect numbers (1849). Suppose NNN is an odd perfect number, i.e. NNN is odd and σ(N)=2N\sigma(N) = 2Nσ(N)=2N, where σ\sigmaσ is the sum-of-divisors function. Then NNN has the shape

N=pkm2,N = p^{k} m^{2},N=pkm2,

where ppp is a prime with p≡1(mod4)p \equiv 1 \pmod 4p≡1(mod4), the exponent satisfies k≡1(mod4)k \equiv 1 \pmod 4k≡1(mod4), and p∤mp \nmid mp∤m. The prime power pkp^{k}pk is called the special (or Euler) component of NNN; the remaining part m2m^2m2 is a square, and it is coprime to ppp.

The statement is formalized for natural numbers, with perfection given by Mathlib's Nat.Perfect (which includes positivity) and the congruences written as p % 4 = 1 and k % 4 = 1. Note that mmm is automatically odd, since NNN is.

Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber

theorem euler_form (n : ℕ) (hn : Nat.Perfect n) (hodd : Odd n) :
    ∃ p k m : ℕ, p.Prime ∧ p % 4 = 1 ∧ k % 4 = 1 ∧ ¬ p ∣ m ∧ n = p ^ k * m ^ 2 := by
  sorry

end OddPerfectNumber
Source
L. Euler, De numeris amicabilibus, Commentationes arithmeticae 2 (1849), 627-636; see also https://en.wikipedia.org/wiki/Perfect_number#Odd_perfect_numbers (Euler's form).
Human review
  • Endorsed by Shuze Chen · Sep 8, 2026

  • Endorsed by Gabewhigham · Sep 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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