A generalization of Hasse's generalization of the Syracuse algorithm
From MaRDI portal
Publication:3936802
DOI10.4064/aa-43-2-167-175zbMath0479.10006OpenAlexW344029587MaRDI QIDQ3936802
No author found.
Publication date: 1984
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/205897
mappingergodic theoremmeasure-preservingSyracuse problemstrongly-mixingd-adic integersdivisibility of sequences
Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)
Related Items (9)
Injectivity and surjectivity of Collatz functions ⋮ Iterates of Number Theoretic Functions with Periodic Rational Coefficients (Generalization of the 3x+ 1 Problem) ⋮ A remark about the density of the orbits of the Collatz permutation ⋮ On the nonexistence of nontrivial small cycles of the \(\mu\) function in \(3x+1\) conjecture ⋮ A geometric approach to divergent points of higher dimensional Collatz mappings ⋮ On a generalization of the \(3x+1\) problem ⋮ Parity sequences of the 3x+1 map on the 2-adic integers and Euclidean embedding ⋮ The Collatz conjecture and de Bruijn graphs ⋮ A generalization of the Syracuse algorithm in \({\mathbb{F}}_ q[x\)]
This page was built for publication: A generalization of Hasse's generalization of the Syracuse algorithm