Year-end Sale % OFF 
Abstract
Summary In a straightforward proof by induction of the Collatz conjecture, it is easy to show that the statement is true for n = 1 (the base case) but proving the induction step is more challenging—in fact, no one has done so to date. In this work, a different induction proof of the conjecture, based on a binary representation of the starting integer, is given in which it is possible to prove the induction step but there is no known proof for the base case. In fact, if one could prove the base case, then the Collatz conjecture is true.
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.
