Abstract
Suppose that t is any positive integer. If d is bounded from above, then there exists a positive integer d + t such that d + t > d. However, if d is unbounded, then we cannot distinguish d + t from d, so that d+ t > d iff d is bounded from above. For this reason, we confirm that we have provided a proof that the Collatz conjecture cannot be proved to be true. To illustrate this point further, we consider the following algorithm which is simpler than Hasse’s algorithm.
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: British Journal of Mathematics & Computer Science
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.
