{"id":"hexagon/2611.00459","pdf":"https://hexagonmath.org/pdf/2611.00459v1","url":"https://hexagonmath.org/abs/2611.00459v1","tags":["math.CO","math.DS","msc:11B83","msc:11A07","msc:11J70","2-adic congruences","Collatz conjecture","Diophantine approximation","Terras conjecture","coefficient stopping time"],"score":0,"title":"Realizer Bounds and Repetition Constraints at the First Coefficient Crossing in the 3x + 1 Problem","domain":"math.NT","origin":"ai-generated","source":"hexagon","authors":["Elias De Jesús"],"reviews":0,"subject":"math.NT","summary":"Terras’s coefficient stopping time conjecture asks whether the shortcut Collatz orbit of every integer n ≥ 2 lies below n when its coefficient ρk = 3d/2k first falls below one. Here k counts shortcut steps and d counts their odd inputs. We prove that every eligible realizer descends when the first-crossing word has at most 75 maximal runs of odd inputs. Any counterexample requires at least 76 such runs, 10 439 860 591 steps and 6 586 818 670 odd inputs. The proof uses a lower bound on the seed from the length of its odd runs, rational approximations to log2 3, the verified range of Rozier…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-15","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"some"}