Collatz on the dyadic rationals in [0.5, 1) with fractals: how bit strings change their length under 3x+1

DOI10.1080/10586458.2019.1577765zbMATH Open1504.11021OpenAlexW2950068864MaRDI QIDQ3383697FDOQ3383697

Authors: Patrick Chisan Hew 

Publication date: 16 December 2021

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10586458.2019.1577765

Recommendations

• Almost all orbits of the Collatz map attain almost bounded values
• The convergence classes of Collatz function
• Working in binary protects the repetends of \(1/3^{h}\): Comment on Colussi's ``The convergence classes of Collatz function
• scientific article; zbMATH DE number 746090
• Statistical properties of an iterated arithmetic mapping

zbMATH Keywords

binary stringsCollatz conjecture\(3x+1\) problembit stringsSyracuse function

Mathematics Subject Classification ID

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

Cites Work

• The ultimate challenge. The \(3x+1\) problem
• The 3x + 1 Problem and Its Generalizations
• Title not available (Why is that?)
• The convergence classes of Collatz function
• Itinerary of a discontinuous map from the continued fraction expansion
• Working in binary protects the repetends of \(1/3^{h}\): Comment on Colussi's ``The convergence classes of Collatz function

Cited In (3)

• A reduced Collatz dynamics maps to a residue class, and its count of \((x/2)\) over the count of \(3\ast x+1\) is larger than \(\ln 3/\ln 2\)
• Working in binary protects the repetends of \(1/3^{h}\): Comment on Colussi's ``The convergence classes of Collatz function
• Quantifying the degree of average contraction of Collatz orbits

This page was built for publication: Collatz on the dyadic rationals in \([0.5, 1)\) with fractals: how bit strings change their length under \(3x+1\)

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