Euler equation for an odd perfect number with special exponent has no solution
OpenOddPerfectNumber.no_euler_equation_special_exponent_fiveconjecturedivisor-sumsnumber-theoryperfect-numbers
Write for the sum-of-divisors function.
Let be a prime with , 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 . The statement is therefore the special-exponent- case of the odd perfect number conjecture, isolated from the general case , .
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 sum-of-divisors function is written as an explicit sum over Nat.divisors.
Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber
theorem no_euler_equation_special_exponent_five (p m : ℕ) (hp : p.Prime) (hp4 : p % 4 = 1)
(hm : Odd m) (hpm : ¬ p ∣ m) :
(∑ d ∈ (p ^ 5).divisors, d) * (∑ d ∈ (m ^ 2).divisors, d) ≠ 2 * (p ^ 5 * m ^ 2) := by
sorry
end OddPerfectNumberSource
Subcase k = 5 of the special-exponent case of the Odd Perfect Number Conjecture, via Euler's structure theorem for odd perfect numbers (L. Euler, De numeris amicabilibus, Opera postuma 1 (1849), 88-101): N = q^alpha p_1^{2e_1} ... p_k^{2e_k} with q prime and q = alpha = 1 mod 4, as recorded in https://en.wikipedia.org/wiki/Perfect_number, section 'Odd perfect numbers'. The exponent alpha = 1 case is the Descartes-Frenicle-Sorli conjecture; see J. A. B. Dris, 'The abundancy index of divisors of odd perfect numbers', Journal of Integer Sequences 15 (2012), Article 12.4.4, Conjecture 1.