math.NT — Number Theory
Explicit positive lower density for the Collatz Conjecture
Lech Mazur proved that a positive proportion of integers reach under the Collatz map in at most steps. We give a quantitative refinement of his construction. For every , at least odd positive integers reach within ordinary steps and accelerated steps. We also obtain results for paths that include any prescribed integer not divisible by . AxiomProver was used to obtain and formalize this result in Lean.