The Collatz conjecture is a conjecture (an idea which many people think is likely) in mathematics. It is named after Lothar Collatz. He first proposed it in 1937. It is about what happens when something is done repeatedly (over and over) starting at some positive integer n:
- If n is even (divisible by two), n is halved (divide by two = take its half).
- If n is odd (not divisible by two), n is changed to .
The conjecture states that if n is positive, n will always reach one. The problem is computationally verified for all numbers below . Here is an example sequence:
- 28 (9 is odd, so we triple it and add one)
- 14 (28 is even; 14 is half of 28)
- 7 (14 is even, 7 is its half)
- 22 ()
- 16 (16 is a power of two, so it will lead to 1, halving each time)
- 1 (after 1 comes 4, 2, 1, 4, 2, 1, etc.)
Debate[change | change source]
Many mathematicians argue over if it is really true. Numbers in the quadrillions have been tested but it has still remained true. However, this is still very less compared to another conjecture that had been proved false in 1978. There are two outcomes where it is false: a number keeps growing towards infinity, or an extremely large number forms its own loop.
References[change | change source]
- ↑ 1.0 1.1 "Collatz Problem - from Wolfram MathWorld". Mathworld.wolfram.com. Retrieved 2012-01-20.
- ↑ Garner, Lynn E. (1981). "On the Collatz $3n + 1$ Algorithm". Proceedings of the American Mathematical Society. 82 (1): 19–22. doi:10.2307/2044308. JSTOR 2044308.
- ↑ D. Barina. Convergence verification of the Collatz problem. The Journal of Supercomputing, 2020. DOI: 10.1007/s11227-020-03368-x