Hi! This is an addition to this project here: https://scratch.mit.edu/projects/632035942/ Check it out!
As said in the first project, the Collatz conjecture is a patter, where if you number is odd, you multiply by 3 and add 1, And if even, then you divide by 2. Now the catch is that no matter what number you choose, theoretically, you will always end in a loop where 4 divides by 2 which is 2, 2 divides by 2 which is 1, and 1 multiplies by 3 (3) and then you add one (4), and this process repeats in an endless loop. This project is built to prove that. the list on the left is running hundreds of numbers through the pattern at once, and when it see that it has hit the loop, it restarts at the next number. Before that, it adds how many steps it took for that number to reach the loop and the number itself to the length pairs list, and finally if there are over 300 steps, then it is added to the long lengths list. feel free to look through it to see if anything never ends, and thanks for reading to the end. (Just to prove it further, I ran it to like 10000 and made a seperate list with just lengths of over 500, and nothing came up.) potato
