1. Enter a number. (Can be big) 2. Wait. (Turbo mode is quick) 3. Watch the graph. (Big numbers go too high and too far right) 4. See how many steps it takes to get to 1 5. Look at the list "Numbers" to see the path. Explanation in Notes
The Collatz conjecture is a famous problem in math. The ruleset is: If the number is even, divide by 2 If the number is odd, multiply by 3 and add 1. Repeat this with the number you get until you reach 1. The question is: Will any number you start with end up at 1? So far, every number checked has been proven to end in 1. Try entering a ton of digits and see what happens. It isn't likely you will find something that breaks the conjecture, but you can try. The main purpose of the project is to understand what it is. Have fun :) (If you find a number that doesn't ever get to 1, tell me) Fun fact: I discovered that 27 and 1000 take the same number of steps! The right side of the graph is usually flat!!! This is because the values are super small compared to the high points. BTW: math stuff by me, but the scaling of the graph was helped by AI.
