Can you solve Collatz Conjecture? Those who don't like jokes must try
In Mathematics, there are many problems which are unsolved mysteries. Some of these problems are more than 200 years old. Generations of mathematicians have been trying unsuccessfully to solve these mysteries.Some of such unsolved mathematical problems are:
(a) Riemann Hypothesis
(b) P vs. NP Problem
(c) Goldbach Conjecture
(d) Collatz Conjecture
(e) Twin Prime Conjecture
(f) Navier-Stokes Existence and Smoothness
(g) Birch and Swinnerton-Dyer Conjecture
Out of these mysteries let us take Collatz Conjecture. The Collatz Conjecture was proposed by Lothar Collatz in 1937 and it is deceptively simple.
Let us take any positive whole number: If the number is even, divide it by 2. If the number is odd, multiply it by 3 and add 1.
Then, repeat the process with the result.
The conjecture states that no matter what number you start with, you will eventually reach the number 1.
Let me give an example. Let us take a random number 6. Divide it by 2, you will get 3. So, you will multiply 3 with 3 and add 1. You will get 10. Divide it by 2, you will get 5. Again multiply 5 with 3 and add 1. You get 16. Divide it by 2. You will get 8. Then repeat the process. Ultimately, you will get 1.
Despite its simplicity, the Collatz Conjecture is incredibly hard to prove. Mathematician Paul Erdos famously said, "Mathematics is not yet ready for such problems." While it is very easy to check for specific cases using computers, a general proof for every possible number has not been possible till now.
Serious members of ISC, will you give this Conjecture a try and provide a general proof to establish it?