The
Collatz conjecture
(CC) is a well-known unsolved problem in mathematics, first proposed in 1937 by Lothar Collatz. Because of its overwhelming simplicity, the conjecture has been attacked many times - never successfully. The great Paul Erdős himself admitted: "Mathematics may not be ready for such problems."
Consider the function
The conjecture states that all natural numbers when subjected to iteration of eventually end up at .
Let the (minimum) number of iterations of taken by be . For example,
Hence, .
If never reaches , then , with the interpretation that .
What can be said about the convergence of the following series?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
For n = 2 k , ℓ ( n ) = k clearly. This implies the sum is greater than or equal to the harmonic series, which is divergent, implying the divergence of the sum in consideration.