Arbitrarily long finite sequences of expanding alternating blocks
ProvedBlindCollatz.AlternatingGrowth.arbitrarily_long_expansioncollatz-work-import
Let be the shortcut Collatz map: for even and for odd . Write for its -fold iterate, with . Write , and let be its j-fold iterate. A start has good blocks if for every .
For every natural ,
The starting value may depend on the finite requested length. This does not assert the existence of one infinitely expanding orbit.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_ArchiveAlternatingGrowth
Formal statement
theorem BlindCollatz.AlternatingGrowth.arbitrarily_long_expansion (m : Nat) (hm : 0 < m) :
∃ n : Nat, goodBlocks m n ∧ n < blocks m n := by sorry
Source