Verifying whether extremely large integer guarantees Collatz conjecture (can return to 1 finally)

Wei Ren
Currently, the largest integer being verified for Collatz conjecture is about 2^60 . To verify whether extremely large integers such as 2^{100000}-1 can return 1, we design a new algorithm. This dedicated algorithm can change numerical computation into bit or charter computation, hence, original dynamics for extremely large integer without upper bound can be computed. By this algorithm, we thus design computer program that can output original dynamics for extremely large integers without upper-bound such...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.