3x+1, known as the Collatz Conjecture, 3n+1 (weird) and a million other names, is a simple cycle where if the number (x) is ODD, you multiple it by 3 and add 1. If it's even, it will be divided by two. If the number ends up being a perfect square, it will be stuck in a loop of 4, 2, 1, 4, 2, 1... Try to identify the highest amount of generations you can go without getting stuck in a loop. Getting stuck in the loop will end the simulation. There are many loops
RUN THIS ON TURBOWARP FOR BIG NUMBERS First to identify a counterexample to 3x + 1 is finite becomes a world famous mathematician. This project can't process any number larger than 1000000. 11/26/23 - Fixed (Hint anything less than 0.095 sextillion is false.)
