Parity bridge: the cofactor of the packaged Euler configuration is odd
ProvedOddPerfectNumber.dris_packaged_cofactor_oddnumber-theory
Euler's form of a hypothetical odd perfect number is frequently packaged into the three identities
together with the Euler congruences . Many statements about this configuration also carry the hypothesis that the cofactor is odd. This theorem says that this hypothesis is redundant: as soon as , the three identities and the two congruences already force to be odd.
The argument is -adic. The divisor sum of a nonzero perfect square is always odd (for an even square the -part contributes , and every odd prime contributes a sum of an odd number of odd terms). Since we have , so is odd. Multiplying the last two identities gives , whose left-hand side is a product of two odd numbers; as is odd, the right-hand side can be odd only if is odd.
Preamble
import Mathlib open Finset
Formal statement
namespace OddPerfectNumber
theorem dris_packaged_cofactor_odd (p k m t d : Nat)
(hp : p.Prime) (hp4 : p % 4 = 1) (hk4 : k % 4 = 1) (hm0 : m ≠ 0)
(hsig : (∑ x ∈ (p ^ k).divisors, x) = 2 * t)
(hdvd : m ^ 2 = t * d)
(hsigm : (∑ x ∈ (m ^ 2).divisors, x) = p ^ k * d) :
Odd m := by
sorry
end OddPerfectNumberSource
J. A. B. Dris, The abundancy index of divisors of odd perfect numbers, Journal of Integer Sequences 15 (2012), Article 12.4.4, Section 2 (packaging of the Euler equation); Euler (1849) congruences p = k = 1 (mod 4).