Maximum excursion and stopping time record-holders for the problem: Computational results (Q4221986)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1229017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum excursion and stopping time record-holders for the problem: Computational results |
scientific article; zbMATH DE number 1229017 |
Statements
Maximum excursion and stopping time record-holders for the problem: Computational results (English)
0 references
3 December 1998
0 references
\(3x+1\) problem
0 references
Collatz problem
0 references
computational results
0 references
maximum excursion of the trajectory
0 references
algorithm
0 references
0.8159708976745605
0 references
0.8153992295265198
0 references
0.7843116521835327
0 references
0.7815614938735962
0 references
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\). The trajectory of \(n\) is the sequence \(\bigl(T^{(k)}(n)\bigr)_{k=0}^\infty\). The stopping time of \(n\), denoted by \(\sigma(n)\), is the least positive \(k\) for which \(T^{(k)}(n)<n\), if it exists, or infinity. The maximum excursion of the trajectory of \(n\), denoted by \(t(n)\), is the maximum value \(T^{(k)}(n)\) for \(k\geq 0\), if it exists, or infinity, otherwise. A number \(n>1\) is called a \(\sigma\)- or a \(t\)-record-holder if \(\sigma(m)<\sigma(n)\) or \(t(m)<t(n)\) holds for all \(1<m<n\), respectively. The main objective of the paper under review is to find all \(\sigma\)- and \(t\)-record-holders in the interval \(1<n<3\cdot 2^{53}\approx 2.702\cdot 10^{16}\). As a side result, the \(3x+1\)-conjecture is true in that range. Furthermore, the author describes some facts about the structure of \(T(n)\) leading to the construction of an efficient algorithm which is about 32 times faster than the `naive' approach. The computer search reported in this paper, which took approximately 4 CPU years, is still running.
0 references