Dris configuration:
ProvedOddPerfectNumber.dris_index_lte_support_boundLet be prime, odd with , and suppose the Dris relations
hold, with Dris index . Then the prime support of obeys
where counts distinct prime factors and counts them with multiplicity.
The three terms correspond to a trichotomy for a prime . If , it is counted by . If , then , because and is prime to ; moreover the local divisor sum divides . If that local sum is prime to it is a power of , and lifting the exponent forces — the third term. Otherwise it contributes a prime factor of , and these contributions, taken one per prime, multiply to a divisor of , so they number at most .
Combined with Sylvester's bound , which gives , the inequality is the general form of the known impossibility of a Dris index equal to or to an odd prime when has at most one odd prime factor: those cases have . It is stated with no congruence hypotheses on , or .
import Mathlib
namespace OddPerfectNumber
theorem dris_index_lte_support_bound (p k m s : Nat)
(hp : p.Prime) (hm : Odd m) (hpm : ¬ p ∣ m)
(h1 : 2 * m ^ 2 = (∑ d ∈ (p ^ k).divisors, d) * s)
(h2 : (∑ x ∈ (m ^ 2).divisors, x) = p ^ k * s) :
m.primeFactors.card ≤
s.primeFactors.card + s.primeFactorsList.length + ((k + 1).primeFactors.erase 2).card := by
sorry
end OddPerfectNumber