Preprint
Article

This version is not peer-reviewed.

Proof the Collatz Conjecture in Binary Strings

Submitted:

24 April 2023

Posted:

26 April 2023

Read the latest preprint version here

Abstract
The following is the Collatz Conjecture: Suppose we begin with a positive number, multiply it by 3 and add 1 if it is odd, and divide it by 2 if it is even. Then continue doing this as long as you can. Will it matter where you start, whether you end up at the number 1? The Collatz conjecture has been studied for around 85 years. We transform the Collatz function from decimal to binary, then use the binary string's character to prove the Collatz conjecture. In addition, we use mathematics to give another interpretation to chaos, which is the ultimately periodic positive integer sequence.
Keywords: 
;  ;  ;  
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated