Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

No odd perfect number of Dris index 333 when k+1k+1k+1 has at most one odd prime factor

Proved
OddPerfectNumber.no_dris_index_three_of_one_odd_prime

by Gabewhigham · Sep 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

Dris index 333 is impossible when k+1k+1k+1 has at most one odd prime factor.

In the Dris parametrisation of a hypothetical odd perfect number N=pkm2N = p^k m^2N=pkm2 (Euler form: ppp the special prime, mmm odd, p∤mp \nmid mp∤m), the index is the number sss with

2m2=σ(pk) s,σ(m2)=pks.2m^2 = \sigma(p^k)\, s, \qquad \sigma(m^2) = p^k s .2m2=σ(pk)s,σ(m2)=pks.

This statement rules out the index s=3s = 3s=3 for every special exponent k≥1k \ge 1k≥1 whose successor k+1k+1k+1 has at most one odd prime divisor, i.e. k+1=2aqbk + 1 = 2^{a} q^{b}k+1=2aqb for a prime qqq. In particular it settles the index-three case for the special exponents k=1,5,9,13k = 1, 5, 9, 13k=1,5,9,13, where k+1=2,6,10,14k+1 = 2, 6, 10, 14k+1=2,6,10,14.

The hypothesis on k+1k+1k+1 is formalized as #(primeFactors(k+1)∖{2})≤1\#\bigl(\text{primeFactors}(k+1) \setminus \{2\}\bigr) \le 1#(primeFactors(k+1)∖{2})≤1, and σ\sigmaσ is written as the sum over the divisor finset.

The proof combines two ingredients. Fixing s=3s = 3s=3 forces 3∣m3 \mid m3∣m and makes σ(m2)=3pk\sigma(m^2) = 3p^kσ(m2)=3pk a number with only two prime divisors; a lifting-the-exponent argument in the style of Dandapat–Hunsucker–Pomerance then shows that a prime q∣mq \mid mq∣m with q≠3q \ne 3q=3 either divides k+1k+1k+1 or satisfies 3∣σ(q2a)3 \mid \sigma(q^{2a})3∣σ(q2a), where qa ∥ mq^{a} \,\|\, mqa∥m. Since v3(σ(m2))=1v_3(\sigma(m^2)) = 1v3​(σ(m2))=1, at most one prime of the second kind exists, so mmm has at most three distinct prime divisors and NNN at most four — contradicting Sylvester's bound ω(N)≥5\omega(N) \ge 5ω(N)≥5 for odd perfect numbers.

Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber

theorem no_dris_index_three_of_one_odd_prime (p k m : Nat)
    (hp : p.Prime) (hk : k ≠ 0) (hm : Odd m) (hpm : ¬ p ∣ m)
    (hk1 : ((k + 1).primeFactors.erase 2).card ≤ 1) :
    ¬ (2 * m ^ 2 = (∑ d ∈ (p ^ k).divisors, d) * 3 ∧
      (∑ d ∈ (m ^ 2).divisors, d) = p ^ k * 3) := by
  sorry

end OddPerfectNumber
Source
Dris index parametrisation: 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. Lifting-the-exponent technique: G. G. Dandapat, J. L. Hunsucker and C. Pomerance, Some new results on odd perfect numbers, Pacific J. Math. 57 (1975), 359-364, Theorem 1. Prime-count input: J. J. Sylvester (1888), omega(N) >= 5 for odd perfect N, as recorded on the Odd Perfect Number Conjecture mission (OddPerfectNumber.sylvester_five_distinct_prime_factors).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me