Odd Dris index at when has at least two odd prime factors
OpenOddPerfectNumber.no_dris_thirteen_s_ge_two_two_odd_primesLet be an odd prime with , let with , let be odd with , and let be odd. Assume moreover that has at least two odd prime divisors, i.e.
Then the two Dris relations
cannot both hold.
This is the residual part of the odd-index Dris problem at special exponents . When has at most one odd prime divisor, the relations are already excluded for a prime index (OddPerfectNumber.no_dris_index_odd_prime_of_one_odd_prime) and are reduced to the composite-index statement (OddPerfectNumber.no_dris_index_odd_composite_of_one_odd_prime). The counting obstruction behind those results bounds the prime support of by the primes dividing , the primes of , and one exceptional prime for each prime power of ; a second odd prime divisor of makes that bound too weak to contradict Sylvester's bound , which is why this case is separated out. The smallest exponents it concerns are , where , and , where .
import Mathlib
namespace OddPerfectNumber
theorem no_dris_thirteen_s_ge_two_two_odd_primes (p k m s : Nat) (hp : p.Prime) (hp2 : p != 2)
(hp4 : p % 4 = 1) (hk4 : k % 4 = 1) (hk13 : 13 ≤ k) (hm : Odd m) (hpm : ¬ p ∣ m)
(hs2 : 2 ≤ s) (hs_not_even : ¬ Even s)
(hk1 : 2 ≤ ((k + 1).primeFactors.erase 2).card) :
¬ (2 * m ^ 2 = (∑ d ∈ (p ^ k).divisors, d) * s ∧
(∑ d ∈ (m ^ 2).divisors, d) = p ^ k * s) := by
sorry
end OddPerfectNumber