Solve the Collatz Conjecture yourself, by leaving your computer plugged in and running overnight. What is the Collatz Conjecture? The Collatz Conjecture is one of the massive unsolved questions in mathematics, and is easy enough that people who can add and divide can try to solve. The hypothesis is that every number, when the 3n+1 rule is applied enough, will eventually reach 1. The goal is to find a number that will never reach one. How does it work? The Collatz Conjecture Solver is a scout, if you will, searching for candidates that may never reach 1. Due to the limitations of Scratch, the list size only goes up to 200,000, so anything with a calculation size of over 199,999 is flagged as a candidate. Most of these will probably not be true candidates (if you think it may be a candidate, you may want to send it to a mathematician) It just pinged me with a candidate, what do I do? Send it to a mathematician, or fire up a Collatz Conjecture solver online and plug the number in. If you've reached average list sizes of 200,000, it's a good idea to stop the project. Why did you make this, instead of updating Experimental Research Submarine? I thought it would be a cool thing to do, so I spent some time making this. If you do find THE NUMBER that proves the Collatz Conjecture wrong using this, give me some credit too!
The Distributed Computing version of the Collatz Conjecture Solver is here (unstable): https://scratch.mit.edu/projects/805988362/
