So, this project simulates the collatz conjecture, where you multiply a number (x) by 3 and add 1 (3x+1) if it is odd, but if it is even, you divide by 2 (x/2). To discover the amount of changes done to the number, first let the project run (its a bit loud...) then pause/ stop it and look for the number in the 'lengths' list, the variable for than number is the amount of changes needed.
-------------- WARNING- This project only simulates numbers up to -------------- 200,000, if you want a bigger number, try to figure out how to do it (I'm not telling you) *insert sinister grin face here* because you came here ill tell you how to go over 200K- use turbowarp at some website link that I cant copy and paste for some reason
