3x+1 Problem

We study a reverse problem - given a reduced dynamics or partial dynamics, can we compute a residue class who presents that dynamics.

We design a computer program that can randomly generate extremely large integers and output their original dynamics. The source code is txpo10b.c. The bit length of integers can be defined by Macro (named MAXLEN) in source code. The number of randomly generated integers can be set by inputting argument. The program can output the original dynamics of a starting integer in terms of “-” presenting (3*x+1)/2 and “0” presenting x/2. This data can be used for observing the relation between the count of “-” and the count of “0”.

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.

The data is reduced Collatz dynamics that is denoted by occurred (3*x+1)/2 represented by "-'' and x/2 represented by "0", during the process from a starting integer to the first integer less than the starting integer. The format is: starting integer, binary representation, the count of (3*x+1)/2, the count of x/2, the reduced dynamics represented by "-'' and "0", the ratio - the count of x/2 over the count of (3*x+1)/2.