Special exponent :
ProvedOddPerfectNumber.k_one_special_prime_lt_sqLet be an odd perfect number in Euler form with special exponent (the configuration predicted by the Descartes–Frenicle–Sorli conjecture): is prime, is odd, , and the Dris relations
hold, with the Dris index. Then the special prime is small compared with the square part:
Trivially divides , which alone gives only . The point of the statement is the explicit constant: it comes from a lower bound for the Dris index at , since . That lower bound in turn is a counting statement: at the divisor sum has -adic valuation , so at most one of the local divisor sums , , is divisible by , and each of the others is a factor of of size at least . Sylvester's bound leaves at least three such factors.
The result is unconditional given the two Dris relations: no congruence conditions on , or are assumed.
import Mathlib
namespace OddPerfectNumber
theorem k_one_special_prime_lt_sq (p m s : Nat)
(hp : p.Prime) (hm : Odd m) (hpm : ¬ p ∣ m)
(h1 : 2 * m ^ 2 = (∑ d ∈ p.divisors, d) * s)
(h2 : (∑ x ∈ (m ^ 2).divisors, x) = p * s) :
1098 * p < m ^ 2 := by
sorry
end OddPerfectNumber