Graphs the amount of steps the collatz conjecture takes to get to 1 Managed to get it to run somewhat fast without turbo mode
The collatz conjecture says that if you set x to any whole number - from 1 to infinity it doesn’t matter - and repeat this process: If (x is even) { Set x to x / 2 } If (x is odd) { Set x to 3x + 1 } The number will always eventually reach 1 This program makes a histogram graphing the amount of steps it takes to reach 1 for every number up to 48000. It makes a cool pattern
