Answers are grounded in this paper and cite their sources.
Analyzes Collatz conjecture levels, suggesting a potential linear relationship.
The Collatz conjecture concerns the iteration of the map f(n)=3n+1 for odd n and f(n)=n/2 for even n. In this paper, we study the level sets lx={n∈N∣L(n)=x}, where L(n) denotes the Collatz length. Using the parity representation of Collatz trajectories, we partition each lx according to the number of odd steps and analyze the corresponding means μx,k. Under a natural scaling assumption, these means satisfy an approximate geometric progression, so that logμx,k is approximately linear in k. Computations for n≤100,000 and 10≤x≤50 show highly stable regression parameters and near-perfect linear fits.
No takes yet. Share an insight, caveat, or question.
Koyuncu et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: