Findings on the Collatz Conjecture Binary Representation: Every positive odd integer can be represented by an equation of the form 2^{n+1}x + (2^n - 1) for some positive integers n and x. In the binary representation of these numbers, the rightmost digits always have the same amount of 1s for ea...

[Collatz][1] [1]: https://docs.google.com/spreadsheets/d/1jSDQsewqVmvSdlgjMUcHEGrftKO7my5rRptH1Uy3-ws/edit?usp=sharing Here is a link to my work on the Collatz Conjecture. ((3^n(2^(n+1) x+(2^n) -1)+3^n)/2^n)-1=2(3^n)X+(3^n...