A Markov approach to the generalized Syracuse algorithm
DOI10.4064/AA-45-1-29-42zbMATH Open0521.10008OpenAlexW995303445MaRDI QIDQ3671243FDOQ3671243
Authors:
Publication date: 1985
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/205953
numerical examplessequence of iteratesgeneralized Syracuse algorithmdistribution among congruence classes mod mirreducible closed setsstationary vectors of Markov matrix
Congruences; primitive roots; residue systems (11A07) Radix representation; digital problems (11A63) Stochastic matrices (15B51)
Cited In (7)
- 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
- The Collatz conjecture \& non-Archimedean spectral theory. I: Arithmetic dynamical systems and non-Archimedean value distribution theory
- Injectivity and surjectivity of Collatz functions
- Quantifying the degree of average contraction of Collatz orbits
- Iterates of Number Theoretic Functions with Periodic Rational Coefficients (Generalization of the 3x+ 1 Problem)
This page was built for publication: A Markov approach to the generalized Syracuse algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671243)