The math problem says if a number is even divide it by two, if a number is odd, triple it and add one. The Conjecture is, if you do it repeatedly, any number you start with will eventually drop to 1.
The proof eliminates the division step, and just multiplies by 3 times and adds 2 to a power that correlates with how many divisions by two are in the number.
It then uses that equation to examine what is happening with the odd numbers and finds they are all being represented as one plus various powers of two, and the powers of two are dividing and decreasing with each cycle. So the odd numbers will always go to 2 to a power of zero.
Anybody math anons have feedback on this?
Proof is here:
https://easyupload.io/8yx8a4
The proof eliminates the division step, and just multiplies by 3 times and adds 2 to a power that correlates with how many divisions by two are in the number.
It then uses that equation to examine what is happening with the odd numbers and finds they are all being represented as one plus various powers of two, and the powers of two are dividing and decreasing with each cycle. So the odd numbers will always go to 2 to a power of zero.
Anybody math anons have feedback on this?
Proof is here:
https://easyupload.io/8yx8a4
