Adaptive Search in Collatz Exponent-Code Space via 2-adic and 3-adic Constraints

We study a symbolic search space for the Collatz conjecture based on finite exponent codes of the accelerated map. Each code records the number of divisions by two after every 3n + 1 step and determines three quantities: real drift, a 2-adic start representative, and a 3-adic endpoint representative. Their combination defines the 2-3-infinity diagnostic. Counterexample-like codes should exhibit…

Paper

Similar papers

© 2026 NYSGPT2525 LLC