Syracuse descent for large inputs congruent to three modulo four
OpenCollatzMission.syracuse_descent_large_three_mod_fourcollatzstopping-timesyracuse
Let be the odd part of . For each with , does some Syracuse iterate fall strictly below ? This is the remaining descent case after applying the platform’s finite descent bound below and the one-step bound when and .
Preamble
import Definitions.Def_syracuseStep import Mathlib.Logic.Function.Iterate
Formal statement
theorem CollatzMission.syracuse_descent_large_three_mod_four
(n : ℕ) (hn : 2310000 ≤ n) (hmod : n % 4 = 3) :
∃ t : ℕ, syracuseStep^[t] n < n := by sorrySource
Descent subproblem for CollatzMission.syracuse_odd_conjecture, with cutoff from syracuse_descends_below_2310000.