Collapsing from Collatz (300 followers problem!)

Calculus Level 4

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

f ( n ) = { n / 2 if n is even 3 n + 1 if n is odd f(n) = \begin{cases} n/2 & \text{if } n \text{ is even} \\ 3n+1 &\text{if } n \text{ is odd} \end{cases}

The conjecture states that all natural numbers when subjected to iteration of f f eventually end up at 1 1 .

Let the (minimum) number of iterations of f f taken by n n be ( n ) \ell(n) . For example,

5 16 8 4 2 1 5 \rightarrow 16 \rightarrow 8 \rightarrow 4 \rightarrow 2 \rightarrow 1

Hence, ( 5 ) = 5 \ell(5) = 5 .

If n n never reaches 1 1 , then ( n ) = \ell(n) = \infty , with the interpretation that 1 ( n ) = 0 \frac{1}{\ell(n)} = 0 .

What can be said about the convergence of the following series?

n = 2 1 ( n ) \sum_{n=2}^{\infty} \frac{1}{\ell(n)}

Image Credit: Wikimedia Cirne
Unknown if CC is not proven Unknown even if CC is proven It converges It diverges

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.

1 solution

Jake Lai
Apr 22, 2015

For n = 2 k n = 2^{k} , ( n ) = k \ell(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.

Precise and beautiful solution....good problem...liked&upvoted!!!!

rajdeep brahma - 3 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...