Dris parametrisation: and
ProvedOddPerfectNumber.dris_parametrisationdivisor-sumsnumber-theoryperfect-numbers
Write for the sum-of-divisors function.
Let be an odd prime, let be odd and let satisfy the Euler equation
Then there is a positive integer — the Dris index of the solution — with
Context. By Euler's structure theorem an odd perfect number has the form with prime, and ; multiplicativity of on the coprime factors and turns perfection of into exactly the displayed Euler equation. The two relations above are the standard parametrisation of its solutions: they follow because , so divides and divides , with the same quotient in both cases.
The parametrisation is the starting point for size comparisons between the two parts of an odd perfect number: holds exactly in the extremal situation , and then and .
Preamble
import Mathlib open Finset
Formal statement
namespace OddPerfectNumber
theorem dris_parametrisation (p k m : ℕ) (hp : p.Prime) (hp2 : p ≠ 2) (hk : k % 2 = 1)
(hm : m ≠ 0)
(heq : (∑ d ∈ (p ^ k).divisors, d) * (∑ d ∈ (m ^ 2).divisors, d) = 2 * (p ^ k * m ^ 2)) :
∃ s : ℕ, 0 < s ∧ 2 * m ^ 2 = (∑ d ∈ (p ^ k).divisors, d) * s ∧
(∑ d ∈ (m ^ 2).divisors, d) = p ^ k * s := 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 (the relations sigma(p^k)/2 | m^2 and p^k | sigma(m^2) with common quotient).