he Riemann Hypothesis: This is one of the most famous unsolved problems in mathematics, which concerns the distribution of prime numbers. It proposes that the non-trivial zeros of the Riemann zeta function all lie on a specific line in the complex plane.

the Riemann Hypothesis

Proof the Riemann-Hypothesis and Goldbach’s conjecture

Understanding the distribution of primes can help us answer these questions and potentially lead to new insights about prime number

if ζ(1) is equal to 0, then there are an infinite number of rational points (solutions), and conversely, if ζ(1) is not equal to 0, then there is only a finite number of such points.

ScenarioIn 1937, a German mathematician named Lothar Collatz formulated an intriguing hypothesis (it still remains unproven) which can be described in the following way:take any non-negative and non-zero integer number and name it c0;if it's even, evaluate a new c0 as c0 ÷ 2;otherwise, if it's odd, evaluate a new c0 as 3 × c0 + 1;if c0 ≠ 1, go back to point 2.The hypothesis says that regardless of the initial value of c0, it will always go to 1.Of course, it's an extremely complex task to use a computer in order to prove the hypothesis for any natural number (it may even require artificial intelligence), but you can use Python to check some individual numbers. Maybe you'll even find the one which would disprove the hypothesis.Write a program which reads one natural number and executes the above steps as long as c0 remains different from 1. We also want you to count the steps needed to achieve the goal. Your code should output all the intermediate values of c0, too.Hint: the most important part of the problem is how to transform Collatz's idea into a while loop – this is the key to success.