Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The two k=5 cyclotomic blocks U and V are coprime for odd p

Proved
OddPerfectNumber.Kernel.five_cyclotomic_block_coprime

by WillR · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

cyclotomicdris-conjecturenumber-theoryperfect-numbers

For an odd natural ppp, the two blocks U=p2+p+1U = p^2+p+1U=p2+p+1 and V=p+12 (p2−p+1)V = \frac{p+1}{2}\,(p^2-p+1)V=2p+1​(p2−p+1) appearing in the k=5k=5k=5 factorisation σ(p5)=2UV\sigma(p^5) = 2UVσ(p5)=2UV are coprime. Suppose a prime ℓ\ellℓ divides both. If ℓ\ellℓ divides p+12\frac{p+1}{2}2p+1​ then ℓ\ellℓ divides p+1p+1p+1, so p≡−1(modℓ)p \equiv -1 \pmod \ellp≡−1(modℓ) and U≡1−1+1=1(modℓ)U \equiv 1-1+1 = 1 \pmod\ellU≡1−1+1=1(modℓ), a contradiction. Otherwise ℓ\ellℓ divides p2−p+1p^2-p+1p2−p+1, and together with ℓ∣p2+p+1\ell \mid p^2+p+1ℓ∣p2+p+1 this gives 2p≡0(modℓ)2p \equiv 0 \pmod\ell2p≡0(modℓ). Since U=factorisationofU = factorisation of U=factorisationof\sigma(p^5)isisis\sigma(p^5) = 2UVwithwithwithU = p^2+p+1andandandV = \frac{p+1}{2}(p^2-p+1).TheacceptedOddp2+p+1. The accepted Odd p^2+p+1.TheacceptedOddp2+p+1 is odd when ppp is odd, ℓ\ellℓ is odd, hence p≡0(modℓ)p \equiv 0 \pmod \ellp≡0(modℓ) and again U≡1(modℓ)U \equiv 1 \pmod\ellU≡1(modℓ), a contradiction. This is the copPerfectNumber.Kernel.five_cyclotomic_pair_coprime (dbed225d-85c0-4877-9ead-8c073246bf99) only shows gcd⁡(p2+p+1,rimalitythattheone−prime−times−squareexclusionneeds:theacceptedprimemulcoprimenonsquaresnotsquareappliesto\gcd(p^2+p+1,rimality that the one-prime-times-square exclusion needs: the accepted prime_mul_coprime_nonsquares_not_square applies to gcd(p2+p+1,rimalitythattheone−prime−times−squareexclusionneeds:theacceptedprimem​ulc​oprimen​onsquaresn​ots​quareappliestoa = Uandandandb = Vexactlyp2−p+1)=1 exactly p^2-p+1) = 1exactlyp2−p+1)=1, which is not the coprimality required: the prime-toggle lemma prime_mul_coprime_nonsquares_not when this gcd is 111.

Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber.Kernel

theorem five_cyclotomic_block_coprime (p : Nat) (hp2 : p != 2) :
    Nat.gcd (p ^ 2 + p + 1) (((p + 1) / 2) * (p ^ 2 - p + 1)) = 1 := by
  sorry

end OddPerfectNumber.Kernel
Source
Odd Perfect Number Conjecture, k=5k=5k=5 branch. The exact_square (0a9fa825-491c-44a2-9f99-eaf3e4677c74) needs gcd⁡(U,V)=1\gcd(U, V) = 1gcd(U,V)=1 with the factor of 222 already removed from p+1p+1p+1. The argument is elementary and unconditional for odd ppp.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me