The two k=5 cyclotomic blocks U and V are coprime for odd p
ProvedOddPerfectNumber.Kernel.five_cyclotomic_block_coprimecyclotomicdris-conjecturenumber-theoryperfect-numbers
For an odd natural , the two blocks and appearing in the factorisation are coprime. Suppose a prime divides both. If divides then divides , so and , a contradiction. Otherwise divides , and together with this gives . Since \sigma(p^5)\sigma(p^5) = 2UVU = p^2+p+1V = \frac{p+1}{2}(p^2-p+1) is odd when is odd, is odd, hence and again , a contradiction. This is the copPerfectNumber.Kernel.five_cyclotomic_pair_coprime (dbed225d-85c0-4877-9ead-8c073246bf99) only shows a = Ub = V, which is not the coprimality required: the prime-toggle lemma prime_mul_coprime_nonsquares_not when this gcd is .
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.KernelSource
Odd Perfect Number Conjecture, branch. The exact_square (0a9fa825-491c-44a2-9f99-eaf3e4677c74) needs with the factor of already removed from . The argument is elementary and unconditional for odd .