paper

An improved algorithm for checking the Collatz conjecture for all n < 2^N

arXiv:2602.10466

Abstract

We describe a new algorithm for verifying the Collatz conjecture for all n < 2^N for some fixed N. The algorithm takes less than twice as long to verify convergence for all n < 2^{N+1} as it does to verify convergence for all n < 2^N. We also discuss verification of the analogue of the Collatz conjecture for negative numbers.

Comments very welcome

An improved algorithm for checking the Collatz conjecture for all n < 2^N · wovepaper