Five ordinary steps for one alternating expansion block
ProvedBlindCollatz.AlternatingGrowth.ordinary_fivecollatz-work-import
Let be the ordinary Collatz map: for even and for odd . Write for its -fold iterate.
For every ,
This computes the ordinary-map timing for the residue family, without substituting shortcut and ordinary step counts.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_ArchiveAlternatingGrowth
Formal statement
theorem BlindCollatz.AlternatingGrowth.ordinary_five (q : Nat) :
ordinarySteps 5 (16 * q + 11) = 18 * q + 13 := by sorry
Source