A generalization of Hasse's generalization of the Syracuse algorithm

DOI10.4064/AA-43-2-167-175zbMATH Open0479.10006OpenAlexW344029587MaRDI QIDQ3936802FDOQ3936802

Authors:

Publication date: 1984

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

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

zbMATH Keywords

mappingergodic theoremmeasure-preservingSyracuse problemstrongly-mixingd-adic integersdivisibility of sequences

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Cited In (9)

• On the nonexistence of nontrivial small cycles of the \(\mu\) function in \(3x+1\) conjecture
• The Collatz conjecture and de Bruijn graphs
• On a generalization of the \(3x+1\) problem
• Injectivity and surjectivity of Collatz functions
• Parity sequences of the \(3x+1\) map on the 2-adic integers and Euclidean embedding
• A generalization of the Syracuse algorithm in \({\mathbb{F}}_ q[x]\)
• Iterates of Number Theoretic Functions with Periodic Rational Coefficients (Generalization of the 3x+ 1 Problem)
• A geometric approach to divergent points of higher dimensional Collatz mappings
• A remark about the density of the orbits of the Collatz permutation

This page was built for publication: A generalization of Hasse's generalization of the Syracuse algorithm

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