The paper's 'novel' stopping-time algorithm is the standard skip-all-powers-of-two Collatz acceleration, and its O(log n) worst-case claim is an unsupported fit to small-range data.
$3n+3^k$: New Perspective on Collatz Conjecture
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Collatz conjecture is generalized to $3n+3^k$ ($k\in N$). Operating as usual, every sequence seems to reach $3^k$ and end up in the loop $3^k, 4.3^k, 2.3^k,3^k$. The usual $3n+1$ conjecture is recovered for $k=0$. For $k>0$, we noticed the existence of a sequence of period 3, namely, $3^{k-1}, 2.3^k, 3^k$, alongside the cycle $4.3^k, 2.3^k,3^k$ encountered in the $3n+1 (k=0)$ sequence. A term formula of the $3n+3^k$ conjecture has been derived, and hence the total stopping time.
citation-role summary
background 1
citation-polarity summary
fields
cs.MS 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach
The paper's 'novel' stopping-time algorithm is the standard skip-all-powers-of-two Collatz acceleration, and its O(log n) worst-case claim is an unsupported fit to small-range data.