No label defined (Q4353526)

The well-known ``Collatz''-problem (or ``3N+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\). In the note under review the author continues his studies of the densities of the predecessor set \(P(a)\), which consists of all integers \(n\) whose iterates \(T^{(k)}(n)\) eventually hit \(a\). For special values of \(a\) he gives a sufficient condition for the so-called ``sub-positive asymptotic density conjecture'', which means that the counting function \(Z_a(x)\) of \(P(a)\) increases with sufficiently large \(x\) like \(Z_a(x)\geq x^c\) for any real \(c\) with \(0 < c <1\). Furthermore, the author conjectures that some of the assumptions he assumed in his main theorem (the label 11 is missing!) on page 238 are fulfilled by much more numbers \(a\). For the entire collection see [Zbl 0868.00042].