A Formal Proof of the Non-Existence of Odd Perfect Numbers for Euler Primes p ≥ 5 via Structural Divisibility Constraints.
euler euclid perfect index prime-numbers formal-verification number-theory odd interactive-theorem-proving abundance mathlib computational-number-theory inequalities stuctural lean4 proof-by-contradiction math-proof
-
Updated
Apr 8, 2026 - Lean