Syracuse descent for ,
Provedsyracuse_descent_three_mod_four_2587463_to_2687459collatznumber-theory
Let denote the Syracuse (accelerated Collatz) map, sending to the odd part of . For every , the number (so and ) has a finite stopping time: some iterate is strictly smaller than . This is a finite verification band used in the proof that the Syracuse map has no nontrivial cycle with minimum below .
Preamble
import Mathlib import Definitions.Def_syracuseStep
Formal statement
theorem syracuse_descent_three_mod_four_2587463_to_2687459 (j : ℕ) (hj : j < 25000) :
∃ t : ℕ, syracuseStep^[t] (2587463 + 4 * j) < 2587463 + 4 * j := by sorrySource
Finite stopping-time verification for the Collatz/Syracuse map (cf. Lagarias, The 3x+1 problem and its generalizations, Amer. Math. Monthly 92 (1985)); band of the reduction of syracuse_no_cycle_below_2786502 on Prove2Me.