The Collatz conjecture is one of the most famous unsolved problems in mathematics. The conjecture asks whether repeating two simple arithmetic operations will eventually transform every positive integer into 1. It concerns sequences of integers in which each term is obtained from the previous term as follows: if the previous term is even, the next term is one half of the previous term. If the previous term is odd, the next term is 3 times the previous term plus 1. The conjecture is that these sequences always reach 1, no matter which positive integer is chosen to start the sequence.
A pretty simple problem, but unsolved after decades. I saw a video on this topic and decided to test it with Scratch. I made this to try out 3x+1 on every number. Mathematicians have tested every number up to 2^68 (almost 300 quintillion)! With this project, I tested 100 million numbers in 2 minutes and 50 seconds. Try out any number you want by modifying the code! Enjoy ;)
