it's not very interesting but the collatz conjecture is much faster without the x3 term, it's only there for spice the conjecture is that with any positive integer, you can do the following process, and it will always eventually return to one From the starting number, if the number is odd, divide by two, if the number is even, times by 3 and add 1 then repeat this process with the resulting numbers and you should eventually reach 1 (if you find a number that breaks this rule then you might well become a millionaire) this code just does those calculations very quickly
veritasium kinda nuts how slow scratch is when rendering processes are attached
