1. What is this? This is known as the math problem 3n+1. You start by picking a number, any number. As an example, pick the number 7. If you get an odd number, multiply it by 3, and add 1. So, 7 will become 22. Next, if the number is even, divide by 2. So 22 becomes 11. Keep repeating this with the rules, and you get 7>22>11>34>16>8>4>2>1 and so on. This project finds the starting position (remember the 7?) needed to create the longest chain. This one has a chain of 9, starting at 7, and ending at 1. 2. Why did you make this? Because I was bored 3. Why have you not uploaded a pokémon project in so long? I'm working on something. 4. What are the variables for? The top left is for the starting position the code is checking, the bottom left is the longest chain, and the bottom right is the starting position for the longest chain. You'll see that one update alongside the bottom left.
Code all by me, probably could be improved, though. Sorry for not making a pokémon game in so long, but I have something coming up, that I think you'll all like. Thumbnail from a screenshot of the video: The Simplest Math Problem No One Can Solve - Collatz Conjecture. minorly edited by me 0111000001101111011010111110100101101101011011110110111000100000011100100110010101100100001000000110000101101110011001000010000001100010011011000111010101100101
