A square Dris index forces and
ProvedOddPerfectNumber.dris_square_index_exp_mod_sixteennumber-theory
Let be an odd perfect number in Euler form, so that is prime with , , is odd, and the Dris relations
hold with index . Suppose in addition that the index is a perfect square, . Then
The point is that a square index collapses the first Dris relation to the classical equation " is twice a square": the index is odd and divides , so and
The two known constraints on that equation — the congruences , and its insolubility when — then apply verbatim.
Consequently no odd perfect number can have a square Dris index at a special exponent ; in particular not at , or . This covers every index of the form with prime, the smallest composite case left open by the treatment of the indices and an odd prime.
Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber
theorem dris_square_index_exp_mod_sixteen (p k m s u : Nat)
(hp : p.Prime) (hp4 : p % 4 = 1) (hk4 : k % 4 = 1) (hm : Odd m)
(hsq : s = u ^ 2)
(h1 : 2 * m ^ 2 = (∑ d ∈ (p ^ k).divisors, d) * s)
(h2 : (∑ x ∈ (m ^ 2).divisors, x) = p ^ k * s) :
p % 16 = 1 ∧ k % 16 = 1 ∧ (k + 1) % 6 ≠ 0 := by
sorry
end OddPerfectNumberSource
J. A. B. Dris, The abundancy index of divisors of odd perfect numbers, Journal of Integer Seq. 15 (2012), Article 12.4.4, Section 2 (Dris parametrisation); the constraints on sigma(p^k) = 2 w^2 are the platform theorems OddPerfectNumber.prime_and_exp_mod_sixteen_of_sigma_eq_two_mul_sq and OddPerfectNumber.sigma_prime_pow_ne_two_mul_sq_of_six_dvd.