Optimal bounds for the length of rational Collatz cycles

DOI10.4064/AA-78-3-227-239zbMATH Open0863.11015OpenAlexW1723921989MaRDI QIDQ4896087FDOQ4896087

Authors: Lorenz Halbeisen, Norbert Hungerbühler 

Publication date: 21 November 1996

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/206944

Recommendations

• scientific article; zbMATH DE number 746090
• The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths
• Two remarks on the Collatz cycle conjecture

zbMATH Keywords

iterationlengthCollatz problem\(3x+1\) problemrational Collatz cycles

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Recurrences (11B37) Iteration of real functions in one variable (26A18) Iteration theory, iterative and composite equations (39B12)

This page was built for publication: Optimal bounds for the length of rational Collatz cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896087)