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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Discussed: 0 Published: 2026-11-15 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00459 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…