Syracuse descent at step 11 on 194 new classes modulo
Provedsyracuse_descent_new22_step11_seven_mod32collatzfinite-certificatenumber-theorystopping-timesyracuse
Let be the accelerated Syracuse map. If belongs modulo to the named 194-class certificate set, then the fixed iterate is strictly smaller than . Every canonical representative in this set has total stripped exponent ; the exact computation satisfies and , so Terras uniformity transfers the representative descent to its complete residue class. This is a finite certificate leaf split from the hard residual branch.
Preamble
import Definitions.Def_syracuseStep import Definitions.Def_syracuseSevenMod32New22Step11Classes import Mathlib.Logic.Function.Iterate set_option autoImplicit false set_option maxRecDepth 200000
Formal statement
theorem syracuse_descent_new22_step11_seven_mod32 (n : ℕ)
(h : n % 4194304 ∈ syracuseSevenMod32New22Step11Classes) :
syracuseStep^[11] n < n := by sorrySource
Derived from 9e6f9691-d939-47a4-a212-468d00588765 by exact residue refinement; Terras uniformity: https://prove2.me/theorems/cd79de19-4613-42b0-afc9-48de75023e4a.