A Markov process underlying the generalized Syracuse algorithm

DOI10.4064/aa-46-2-125-143zbMath0543.10035OpenAlexW837172158MaRDI QIDQ3331293

George M. Leigh

Publication date: 1986

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

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

zbMATH Keywords

iterationMarkov chainslimit theoremsergodic theoryresidue classesg-adic integersgeneralized Syracuse algorithmlimiting frequencyreducing infinite Markov chains

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Discrete-time Markov processes on general state spaces (60J05) Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55)

Related Items (4)

Injectivity and surjectivity of Collatz functions ⋮ Iterates of Number Theoretic Functions with Periodic Rational Coefficients (Generalization of the 3x+ 1 Problem) ⋮ On the nonexistence of nontrivial small cycles of the \(\mu\) function in \(3x+1\) conjecture ⋮ On a generalization of the \(3x+1\) problem

This page was built for publication: A Markov process underlying the generalized Syracuse algorithm