Just press the flag to start the search for the solution of the Collatz problem. Use the seed slider to change the next seed. The y axis displays the output numbers of the seed. The x axis displays the algorithm index.
This project is based off an unsolved mathmatical problem and took me 2 minutes to make initual release. If the project freezes/crashes post/comment the seed. The Collatz problem (also known as the Syracuse problem, Kakutani's problem, Hasse's algorithm and Ulam's problem) is a mathmatical algorith that has baffled scientist for decades. The algorithm starts with a seed whole number n and from there determines if n is odd or even, If odd, the algorithm sets n++ *= 3; (or 3n + 1). If even, the algorithm sets n /= 2; (or n/2). The algorithm repeats the odd-even equtions forever and is found that the algorithm always ends on 1 which loops from 4 back to 1; Mathmeticians so far have not found a seed that doesn't end on 1 and loops some place else. (not including negative and decimal valued numbers). In my project, the algorithm ends at one and starts a new algorithm at the next seed, if a seed crashes the project that means you found the solution. Which I asked before to comment/post the solution. Inspiration for this project: https://www.youtube.com/watch?v=094y1Z2wpJg&t=8s Version History: 1.0 Project Released: build time 2 minutes. 1.1 Replaced data list with graph, added music and the seed automatically add: build time 15 minutes. 2.0 Added a visual graph measurement system and removed Height and Width default variable visual. Background and measurement system scrolls through a rainbow like visuals: build time 3 hours.
