Iterating the Collatz Map on Real and Complex Numbers

The Collatz conjecture (also known as the problem or the Syracuse problem) is an unproved conjecture in number theory. It states that starting from any natural number and iterating the rule

always ends at 1. In its original formulation, the Collatz conjecture's domain is only that of the natural numbers , but this domain can be extended by way of the standard Collatz map , which can be optimized by substituting for , yielding . Since the domain of this smooth map is the complex numbers , we can now iterate the Collatz map over the complex numbers, which is precisely what this Demonstration does. Since this Demonstration uses the optimized map, it operates on integer parameters according to the revised algorithm

which is for all purposes identical in function to the original Collatz algorithm.

THINGS TO TRY

SNAPSHOTS

DETAILS

This Demonstration uses the smooth real and complex optimized Collatz map to explore the behavior of the sequence of iterates for parameters in an extended domain when iterated. Use the 2D slider to explore parameters in the complex plane with coarse precision, or manipulate only the real or imaginary parts of the values using the sliders. To find convergent complex parameters, activate the checkbox titled "fine controls", which limits the real part of the parameter to between - and .

This Demonstration displays the Collatz path numerically and graphically. When the parameter's complex part is 0, the graphical chart plots successive iterations on the axis and the number of iterations on the axis. When the parameter has a nonzero imaginary part, the graphical plot switches to plotting the Collatz path in the complex plane.

In both cases, the color of the numerical path is green when the Collatz path reaches the number 1, signifying that the Collatz path is considered to have converged. The color changes to red when the parameter has been iterated 100 times without reaching the number 1 or escapes beyond the limit .