No odd perfect number whose Dris index is odd and composite, when has at most one odd prime factor
OpenOddPerfectNumber.no_dris_index_odd_composite_of_one_odd_primeComposite Dris index, at an exponent whose successor has 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
The index is necessarily odd. This statement asserts that no odd composite index occurs, for a special exponent whose successor has at most one odd prime divisor, i.e. with prime; the hypothesis is formalized as .
This is the residual index range for such exponents. The index is excluded by the theorem of Dandapat–Hunsucker–Pomerance, and every odd prime index is excluded by OddPerfectNumber.no_dris_index_odd_prime_of_one_odd_prime; together with the present statement these cover all indices, so proving it settles the Dris problem for the special exponents (where ).
The obstruction used for a prime index does not extend as it stands. For prime the divisor sum has only two prime divisors, which bounds the prime support of by three ( itself, the odd prime dividing , and one exceptional prime whose divisor sum absorbs the factor ), contradicting Sylvester's bound . For composite the same counting gives only , which is no longer smaller than .
import Mathlib
namespace OddPerfectNumber
theorem no_dris_index_odd_composite_of_one_odd_prime (p k m s : Nat)
(hp : p.Prime) (hk : k ≠ 0) (hm : Odd m) (hpm : ¬ p ∣ m)
(hk1 : ((k + 1).primeFactors.erase 2).card ≤ 1)
(hs2 : 2 ≤ s) (hs_not_even : ¬ Even s) (hs_not_prime : ¬ s.Prime) :
¬ (2 * m ^ 2 = (∑ d ∈ (p ^ k).divisors, d) * s ∧
(∑ d ∈ (m ^ 2).divisors, d) = p ^ k * s) := by
sorry
end OddPerfectNumber