Working in binary protects the repetends of \(1/3^{h}\): Comment on Colussi's ``The convergence classes of Collatz function

DOI10.1016/J.TCS.2015.12.033zbMath1330.68235OpenAlexW2506960244WikidataQ56069523 ScholiaQ56069523MaRDI QIDQ2634676

Patrick Chisan Hew

Publication date: 18 February 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.033

zbMATH Keywords

binary stringCollatz conjecture\(3n+1\) problem

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (2)

Collatz on the Dyadic Rationals in [0.5, 1) with Fractals: How Bit Strings Change Their Length Under 3x + 1 ⋮ A new approach on proving Collatz conjecture

Cites Work

• The convergence classes of Collatz function

This page was built for publication: Working in binary protects the repetends of \(1/3^{h}\): Comment on Colussi's ``The convergence classes of Collatz function