Euler equation for an odd perfect number with special exponent has no solution
OpenOddPerfectNumber.no_euler_equation_special_exponent_ge_nineWrite for the sum-of-divisors function.
Let be a prime with , let be a natural number with and , and let be an odd natural number with . The assertion is that
Since and are coprime and is multiplicative, the displayed equation says exactly that satisfies , i.e. that is an odd perfect number written in Euler's form with special (Euler) prime and special exponent . Together with the case , this covers every special exponent with , that is, the whole complement of the case predicted by the Descartes-Frenicle-Sorli conjecture.
Formalization Note Perfection is expressed directly through the divisor-sum equation rather than through Nat.Perfect; the two are equivalent here because and are coprime and is odd. The congruences are written as p % 4 = 1 and k % 4 = 1, and the sum-of-divisors function as an explicit sum over Nat.divisors.
import Mathlib
namespace OddPerfectNumber
theorem no_euler_equation_special_exponent_ge_nine (p k m : ℕ) (hp : p.Prime) (hp4 : p % 4 = 1)
(hk4 : k % 4 = 1) (hk9 : 9 ≤ k) (hm : Odd m) (hpm : ¬ p ∣ m) :
(∑ d ∈ (p ^ k).divisors, d) * (∑ d ∈ (m ^ 2).divisors, d) ≠ 2 * (p ^ k * m ^ 2) := by
sorry
end OddPerfectNumber