Convergence verification of the Collatz problem

Details

This repository contains computer programs implementing a completely new approach to calculating iterates of the Collatz function. The trick is that, when calculating the function iterates, the programs switch between two domains in such a way that they can always use the count trailing zeros (ctz) operation and a small lookup table with pre-computed powers of three. This approach differs significantly from the commonly used approach utilizing a space-time tradeoff using huge lookup tables. Mathematical details on this approach are given here. The programs can check 128-bit numbers.

Contact

David Barina [email protected]

License

This project is licensed under the terms of the MIT license.

References

• Barina, D. Convergence verification of the Collatz problem. J Supercomput 77, 2681–2688 (2021). https://doi.org/10.1007/s11227-020-03368-x