×

The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths. (English) Zbl 0786.11012

The “Collatz”-problem (or “\(3x+1\)”- or “Hasse”- or “Syracuse”- or “Kakutani”-problem) is to prove that for every \(n\in\mathbb{N}\) there exists a \(k\) with \(T^{(k)}(n)=1\) where the function \(T(n)\) takes odd numbers \(n\) to \((3n+1)/2\) and even numbers \(n\) to \(n/2\). This conjecture has been verified with a computer at least up to \(n=2^{40}\).
Given \(n\in\mathbb{N}\), a trajectory of \(n\) is defined as the set of iterates \(\Omega(n):= \{n,T(n), T^{(2)}(n),\dots\}\). A trajectory \(\Omega\) will be called a cycle (of length \(k\)) if \(T^{(k)}(x)=x\) for all \(x\in \Omega\), where \(k= \text{Card }\Omega\). For example, \(\Omega(1)= \{1,2\}\) is a cycle of length 2, called the trivial cycle.
Now the “\(3x+1\)”-conjecture reads as \(1\in\Omega(n)\) for all \(n\in\mathbb{N}\) and implies that \(\Omega(1)\) should be the only cycle of \(T\). Various authors have observed that nontrivial cycles of \(T\) (if any) must be very big. In this paper the author proves that for any nontrivial cycle of \(T\) with \(\text{Min} \Omega>2^{40}\) holds the equation \[ \text{Card }\Omega= 301 994a+ 17 087 915b+ 85 137 581c, \] where \(a\), \(b\), \(c\) are nonnegative numbers, \(b>0\), and \(ac=0\). In particular, the smallest admissible values for \(\text{Card }\Omega\) are 17 087 915, 17 389 909, 17 691 903, and so on.
In his proof the author uses classical facts about continued fractions to obtain a sufficient sharp one-sided diophantine approximation of \(\log_ 2(3)\).

MSC:

11B83 Special sequences and polynomials
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Chrystal, G., Algebra, Vol. II (1952), Chelsea: Chelsea New York
[2] Crandall, R. E., On the “ \(3x+1\)” Problem, Math. Comp., 32, 1281-1292 (1978) · Zbl 0395.10013
[3] Lagarias, J. C., The \(3x+1\) problem and its generalizations, Amer. Math. Monthly, 92, 3-23 (1985) · Zbl 0566.10007
[4] Richards, I., Continued Fractions Without Tears, Math. Mag., 54, 163-171 (1981) · Zbl 0466.10003
[5] Wagon, S., The Collatz Problem, Math. Intelligencer, 7, 72-76 (1985) · Zbl 0566.10008
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.