Syracuse descent below 2025436
Provedsyracuse_descends_below_2025436collatznumber-theory
Let be the Syracuse map, sending to the odd part of . Every odd with admits a with : below by the previously verified descent bound, the single value by direct computation, and by independent range lemmas.
Preamble
import Mathlib import Definitions.Def_syracuseStep
Formal statement
theorem syracuse_descends_below_2025436 (m : ℕ) (h1 : 1 < m) (hlt : m < 2025436) (hodd : Odd m) :
∃ t : ℕ, syracuseStep^[t] m < m := by sorrySource
Collatz mission https://prove2.me/missions/2f34a49f-2016-4de2-9662-fcd1cc96cc67; ladder stage raising the verified descent threshold to 2310000, assembled from independent range lemmas (slices 0..70).