Euler's form of an odd perfect number
ProvedOddPerfectNumber.euler_formdivisor-sumsnumber-theoryopen-problemperfect-numbers
Euler's theorem on odd perfect numbers (1849). Suppose is an odd perfect number, i.e. is odd and , where is the sum-of-divisors function. Then has the shape
where is a prime with , the exponent satisfies , and . The prime power is called the special (or Euler) component of ; the remaining part is a square, and it is coprime to .
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 is automatically odd, since 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 OddPerfectNumberSource
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
Confirmed by the mission captain (proposal self-audit).