Collatz Conjecture
One Of The hardest Math Problems That A Fifth Grader Can Understand
The Collatz Conjecture, also known as 3n + 1 conjecture, Ulam Conjecture, Kakutani’s problem, Thwaites conjecture, Hasse’s algorithm or the Syracuse problem , is a opinion or conclusion formed on the basis of incomplete information in mathematics that no matter what value of a positive integer that we will call ‘n’, the sequence will always reach 1. The Collatz Conjecture is named after Lothar Collatz.
The sequence is defined as follows: start with any positive integer n. Then each term is obtained from the previous term as follows: if the previous term is even, the next term is one half the previous term. If the previous term is odd, the next term is 3 times the previous term plus 1. -Wikipedia
Mathematicians have tried over 2⁶⁰ integers which is almost 10²⁰ integer values, and all of them eventually reach the value 1. The algorithm is below.
Collatz Conjecture Rules:
1. Start with any positive integer value 'n'
2. If the value is an even number then the next term is halved (n/2) 3. If the value is an odd number then the next term is that number times 3 plus 1 (3n+1)
4. Repeat this operation for the next term, and use that term as the new input(new positive integer value)
