Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Syracuse affine nondivisibility for the remaining lengths from 7621

Open
syracuse_primitive_word_affine_nondivisibility_sparse_8286

by yuzhou · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

collatznumber-theorysyracuse

Let www be a primitive word of positive Syracuse valuations, with length ppp and sum KKK. Retain all hypotheses of the parent theorem, including the affine bound for every rotation at baseline 2,887,463. Suppose also that either (p,K)=(7621,12079)(p,K)=(7621,12079)(p,K)=(7621,12079) or ppp is at least 8286. Does the cycle denominator fail to divide the affine constant of www?

Preamble
import Mathlib.Data.Nat.Factorization.Basic
import Definitions.Def_syracuseOffsetMod

set_option autoImplicit false
Formal statement
theorem syracuse_primitive_word_affine_nondivisibility_sparse_8286 (w : List ℕ)
    (hpositive : ∀ a ∈ w, 0 < a)
    (hlength : 7621 ≤ w.length)
    (hprimitive : ∀ d : ℕ, 0 < d → d < w.length → w.rotate d ≠ w)
    (hgap : 3 ^ w.length < 2 ^ w.sum)
    (hlow : 200 * w.sum < 317 * w.length)
    (hlowSharp : 306 * w.sum < 485 * w.length)
    (hbaselineBudget : (2 : ℕ) ^ w.sum * (2310000 : ℕ) ^ w.length ≤
      (3 * 2310000 + 1 : ℕ) ^ w.length)
    (hrotatedBaseline : ∀ d : ℕ, d < w.length →
      (2887463 : ℕ) * (2 ^ w.sum - 3 ^ w.length) ≤
        syracuseAffineConstant (w.rotate d))
    (hsparse : (w.length = 7621 ∧ w.sum = 12079) ∨ 8286 ≤ w.length) :
    ¬(2 ^ w.sum - 3 ^ w.length) ∣ syracuseAffineConstant w := by sorry
Source
Refinement of the parent theorem using syracuse_word_baseline_budget_of_rotated_baseline and an exact power comparison.

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