A new approach on proving Collatz conjecture (Q2337122)

Summary: The Collatz Conjecture (\(3x+1\) problem) states any natural number \(x\) will return to 1 after \(3\ast x+1\) computation (when \(x\) is odd) and \(x/2\) computation (when \(x\) is even). In this paper, we propose a new approach for possibly proving the Collatz Conjecture (CC). We propose the Reduced Collatz Conjecture (RCC) -- any natural number \(x\) will return to an integer that is less than \(x\). We prove that RCC is equivalent to CC. For proving RCC, we propose exploring laws of Reduced Collatz Dynamics (RCD), i.e., from a starting integer to the first integer less than the starting integer. RCC can also be stated as follows: RCD of any natural number exists. We prove that RCD is the components of the original Collatz dynamics (from a starting integer to 1); i.e., RCD is more primitive and presents better properties. We prove that RCD presents a unified structure in terms of \((3\ast x+1)/2\) and \(x/2\), because \(3\ast x+1\) is always followed by \(x/2\). The number of forthcoming \((3\ast x+1)/2\) computations can be determined directly by inputting \(x\). We propose an induction method for proving RCC. We also discover that some starting integers present RCD with short lengths no more than 7. Hence, partial natural numbers are proved to guarantee RCC in this paper, e.g., 0 module 2; 1 module 4; 3 module 16; 11 or 23 module 32; 7, 15, or 59 module 128. The future work for proving CC can follow this direction, to prove that RCD of left portion of natural numbers exists.