The convergence classes of Collatz function

DOI10.1016/J.TCS.2011.05.056zbMATH Open1226.68075OpenAlexW2089218984WikidataQ56069522 ScholiaQ56069522MaRDI QIDQ719281FDOQ719281

Authors: Livio Colussi 

Publication date: 10 October 2011

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

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

Recommendations

• Working in binary protects the repetends of \(1/3^{h}\): Comment on Colussi's ``The convergence classes of Collatz function
• On the (3N+1)-conjecture
• scientific article; zbMATH DE number 3871450
• On the Collatz conjecture
• About the Collatz conjecture

zbMATH Keywords

Collatz conjecture\(3n+1\) problem

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Combinatorics on words (68R15) Recurrences (11B37) Software, source code, etc. for problems pertaining to number theory (11-04)

Cites Work

• Tag systems and Collatz-like functions
• Small Turing machines and generalized busy beaver competition
• Some holomorphic functions connected with the Collatz problem
• The Collatz conjecture. A case study in mathematical problem solving
• Title not available (Why is that?)
• The real 3x+1 problem

Cited In (6)

• 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\)
• Collatz on the dyadic rationals in \([0.5, 1)\) with fractals: how bit strings change their length under \(3x+1\)
• Working in binary protects the repetends of \(1/3^{h}\): Comment on Colussi's ``The convergence classes of Collatz function
• Title not available (Why is that?)
• A new approach on proving Collatz conjecture
• Accelerated Collatz dynamic

This page was built for publication: The convergence classes of Collatz function

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