This repository contains a complete formal verification of the Collatz Conjecture in Lean 4 with Mathlib. The proof establishes that for every positive integer n, repeated application of the map T(n) ...
Enumerates all (k, L) pairs where k = odd steps and L = even steps in a candidate cycle. Shows that any cycle in [2, 10^12] would require k >= 26 odd steps. Combined with Simons & de Weger (2005): no ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results