The Collatz conjecture is a mathematical problem. Here is how it works: Pick any whole postive number. If it is Even, Divide your number by 2. If it is Odd, Multiply by 3 and Add 1. Then put the number you just got back into the sequence. The Collatz Conjecture suggests that all positive whole numbers put into this sequence will end on 1. I asked myself 2 questions after seeing this: What if we kept on putting our previous number to the sequence? And what if we tried Negative Numbers? So, I made this project to find out. Enter a starting value and see the algorithm work. If the number entered is a decimal, it is halved indefinitely until it reaches 0. s to show list, h to hide list 10/10/2023: Finally added input validation... By which I mean a Ceiling block.
