Abstract
Paul Erdös said about the 3 x +1 problem, "Mathematics is not yet ready for such problems". And he is seemingly right. Although we cannot solve this problem either, we provide some results about its structure. The so-called Collatz graph is iteratively transformed into a sequence of graphs by making use of some hidden structure information. It turns out that the transformation of graphs corresponds to a sequence of sets of numbers. It is shown that if the union of these number sets were equal to the set of integers greater than one, the famous Collatz conjecture would be true.
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 callMore From: Electronic Journal of Graph Theory and Applications
Disclaimer: 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.
