No odd perfect number of Dris index when has at most one odd prime factor
ProvedOddPerfectNumber.no_dris_index_three_of_one_odd_primeDris index is impossible when has at most one odd prime factor.
In the Dris parametrisation of a hypothetical odd perfect number (Euler form: the special prime, odd, ), the index is the number with
This statement rules out the index for every special exponent whose successor has at most one odd prime divisor, i.e. for a prime . In particular it settles the index-three case for the special exponents , where .
The hypothesis on is formalized as , and is written as the sum over the divisor finset.
The proof combines two ingredients. Fixing forces and makes a number with only two prime divisors; a lifting-the-exponent argument in the style of Dandapat–Hunsucker–Pomerance then shows that a prime with either divides or satisfies , where . Since , at most one prime of the second kind exists, so has at most three distinct prime divisors and at most four — contradicting Sylvester's bound for odd perfect numbers.
import Mathlib
namespace OddPerfectNumber
theorem no_dris_index_three_of_one_odd_prime (p k m : Nat)
(hp : p.Prime) (hk : k ≠ 0) (hm : Odd m) (hpm : ¬ p ∣ m)
(hk1 : ((k + 1).primeFactors.erase 2).card ≤ 1) :
¬ (2 * m ^ 2 = (∑ d ∈ (p ^ k).divisors, d) * 3 ∧
(∑ d ∈ (m ^ 2).divisors, d) = p ^ k * 3) := by
sorry
end OddPerfectNumber