An odd perfect number is not a perfect square
ProvedOddPerfectNumber.not_isSquaredivisor-sumsnumber-theoryopen-problemperfect-numbers
Corollary of Euler's form. No odd perfect number is a perfect square. Concretely, if is odd and , then there is no with .
One route is through Euler's form with : the exponent of the special prime is odd, so cannot be a square. A second, self-contained route uses the parity of : for odd , is odd precisely when is a square, whereas is even.
Formalized with Mathlib's IsSquare predicate on ℕ.
Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber theorem not_isSquare (n : ℕ) (hn : Nat.Perfect n) (hodd : Odd n) : ¬ IsSquare n := by sorry end OddPerfectNumber
Source
Corollary of Euler's form; see https://en.wikipedia.org/wiki/Perfect_number#Odd_perfect_numbers .
Human review
Confirmed by the mission captain (proposal self-audit).