Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dris index at k=9k=9k=9: some prime ℓ≡1(mod10)\ell\equiv 1 \pmod{10}ℓ≡1(mod10) dividing p8+p6+p4+p2+1p^8+p^6+p^4+p^2+1p8+p6+p4+p2+1 divides sss to an odd power

Proved
OddPerfectNumber.nine_dris_index_odd_valuation_prime

by Himan · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

divisor-functionnumber-theory

Let ppp be an odd prime and let m,sm,sm,s be natural numbers with s>0s>0s>0 satisfying the first Dris relation at special exponent k=9k=9k=9,

2m2=σ(p9) s,2m^{2}=\sigma(p^{9})\,s,2m2=σ(p9)s,

where σ\sigmaσ denotes the sum of all positive divisors. Then there is a prime ℓ\ellℓ with

ℓ≡1(mod10),ℓ∣p8+p6+p4+p2+1,vℓ(s) odd,\ell\equiv 1 \pmod{10},\qquad \ell \mid p^{8}+p^{6}+p^{4}+p^{2}+1,\qquad v_\ell(s)\ \text{odd},ℓ≡1(mod10),ℓ∣p8+p6+p4+p2+1,vℓ​(s) odd,

where vℓv_\ellvℓ​ is the ℓ\ellℓ-adic valuation.

In particular the Dris index sss at k=9k=9k=9 is divisible by a prime ℓ≥11\ell\ge 11ℓ≥11, so s≥11s\ge 11s≥11, and sss is not a power of 333, 555 or 777. The number p8+p6+p4+p2+1p^{8}+p^{6}+p^{4}+p^{2}+1p8+p6+p4+p2+1 is the product Φ5(p) Φ10(p)\Phi_5(p)\,\Phi_{10}(p)Φ5​(p)Φ10​(p) of the two quartic cyclotomic factors of σ(p9)=(p+1) Φ5(p) Φ10(p)\sigma(p^{9})=(p+1)\,\Phi_5(p)\,\Phi_{10}(p)σ(p9)=(p+1)Φ5​(p)Φ10​(p). This is the k=9k=9k=9 counterpart of OddPerfectNumber.five_dris_index_odd_valuation_prime, with the congruence on ℓ\ellℓ recorded in addition. Only the first Dris relation is used; the second relation σ(m2)=p9s\sigma(m^{2})=p^{9}sσ(m2)=p9s and the congruence p≡1(mod4)p\equiv 1\pmod 4p≡1(mod4) are not needed.

Formalization Note The statement is an elementary lemma written for this mission; it is not taken from the literature. The hypothesis s>0s>0s>0 only excludes the degenerate solution m=s=0m=s=0m=s=0. The divisor sum is written as ∑ d ∈ (p ^ 9).divisors, d, matching the Dris leaves of the mission.

Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber

theorem nine_dris_index_odd_valuation_prime (p m s : Nat) (hp : p.Prime) (hp2 : p ≠ 2)
    (hs : 0 < s) (heq : 2 * m ^ 2 = (∑ d ∈ (p ^ 9).divisors, d) * s) :
    ∃ ℓ : Nat, ℓ.Prime ∧ ℓ % 10 = 1 ∧ ℓ ∣ p ^ 8 + p ^ 6 + p ^ 4 + p ^ 2 + 1 ∧
      Odd (padicValNat ℓ s) := by sorry

end OddPerfectNumber
Source
https://prove2.me/missions/f37bda44-314b-4d8e-8917-fe26209e0c9c

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me