Density Bounds for the 3x + 1 Problem. I. Tree-Search Method

DOI10.2307/2153345zbMath0820.11006OpenAlexW2028956244MaRDI QIDQ4325740

No author found.

Publication date: 31 August 1995

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2153345

zbMATH Keywords

cyclescomputer-assisted proofnonlinear programming problemsrecurrences\(3x+1\) problemsystem of difference inequalitiesCollatz-Hasse-Syracuse problemtree of preimages

Mathematics Subject Classification ID

Recurrences (11B37) Special sequences and polynomials (11B83)

Related Items (5)

Lower bounds for the total stopping time of 3𝑥+1 iterates ⋮ A topological approach to the Ulam-Kakutani-Collatz conjecture ⋮ A probabilistic model for the 5\(x\)+1 problem and related maps ⋮ On the \(3n+1\) problem ⋮ 3x+1 inverse orbit generating functions almost always have natural boundaries

This page was built for publication: Density Bounds for the 3x + 1 Problem. I. Tree-Search Method