Abstract
This paper further defines the Collatz-leaf node (corresponding to the Collatz-leaf integer) on the decimal tree. The Collatz-leaf nodes satisfy the strong Collatz conjecture. Through mathematical derivation, we prove that the Collatz-leaf node (Collatz-leaf integer) has the characteristics of inheritance. With computer large numbers and big data calculation, we conclude that all nodes at a depth of 800 are Collatz-leaf nodes. Thus, we prove that the strong Collatz conjecture is true, and therefore the Collatz conjecture must also be true. For any positive integer N greater than 1, the minimum number of Collatz transforms from N to 1 is log2 N, the maximum number of Collatz transforms is 800 * (N-1). The non-negative integer inheritance decimal tree proposed and constructed in this paper also can be used for proofs of other mathematical problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
