Theoretical and computational bounds for m-cycles of the 3n+1-problem
From MaRDI portal
Publication:4677368
DOI10.4064/aa117-1-3zbMath1136.11019WikidataQ56069519 ScholiaQ56069519MaRDI QIDQ4677368
Benne de Weger, John L. Simons
Publication date: 20 May 2005
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/aa117-1-3
Related Items
On the nonexistence of $2$-cycles for the $3x+1$ problem, Unnamed Item, On the nonexistence of nontrivial small cycles of the \(\mu\) function in \(3x+1\) conjecture, A simple (inductive) proof for the non-existence of 2-cycles of the \(3x+1\) problem, Arithmetic sequences and blocks of powers of two in the Collatz array, Lower bounds for Z-numbers, A Dual-Radix Approach to Steiner’s 1-Cycle Theorem