Every odd number below 12825 reaches one under the Syracuse map
Provedsyracuse_reaches_one_below_12825collatznumber-theory
Let be the Syracuse map, sending to the odd part of . For every odd with there is a with .
This is a finite verification. The odd starting values below have orbits meeting distinct odd numbers in total, the largest being , and every one of those orbits terminates at .
Its role is to supply the small-value input to the margin criterion for excluding Syracuse cycles: combined with the fact that a periodic point whose orbit reaches must equal , it shows no nontrivial Syracuse cycle contains a value below , which in turn excludes every cycle of period at most .
Preamble
import Mathlib import Definitions.Def_syracuseStep
Formal statement
theorem syracuse_reaches_one_below_12825 (m : ℕ) (hm : 0 < m) (hodd : Odd m) (hle : m ≤ 12824) :
∃ k : ℕ, syracuseStep^[k] m = 1 := by sorrySource
Collatz mission https://prove2.me/missions/2f34a49f-2016-4de2-9662-fcd1cc96cc67; extension of syracuse_reaches_one_below_6725 (45c3282c-ba70-4217-a69c-0b2bf4aaead2) from bound 6724 to bound 12824. Orbit data agrees with the standard 3x+1 tables, cf. J. C. Lagarias, The 3x+1 Problem and Its Generalizations, Amer. Math. Monthly 92 (1985), Section 2.