calculates how many steps it takes for a positive whole number to become 1 in the collatz conjecture, and all steps it takes to get there the collatz conjecture is an unsolved problem in mathematics in which putting a number through the function enough times results in one, but we don't know if that is true for every number
doesn't really work once numbers get too high because of scratch's list limit. devlog - - 1.0 - March 24, 2026 - the release - 1.1 - March 30, 2026 - made it so you don't have to press space to input another number, made text slightly funnier, cat now thanks you for giving numbers - 1.2 - March 31, 2026 - made text even more slightly funnier, added 3 text options from the cat, made the thanking text appear for less time, added text to the description explaining what the collatz conjecture is - 1.2.1 - April 1, 2026 - added a variable saying the step count so you don't have to look at the list planned updates - - implementing a workaround to the list limit without turbowarp - better UI - fix the bug where seeing inside the project makes it stop working
