A simple Markov chain for the extended Collatz problem

  • Michele Aicardi DIBRIS) University of Genoa
DOI: https://doi.org/10.53555/cse.v2i9.804
Keywords: Collatz Problem, Dynamic System, Markov Chain

Abstract

The paper deals with the Collatz problem. A simple extension
of the classic 3n + 1 version is considered allowing the definition
of the algorithm for any target base. Then a simple three ”states”
Markov chain is built up to show the probabilistic convergence of the
algorithm to the equilibrium point.

Downloads

Download data is not yet available.

Author Biography

Michele Aicardi, DIBRIS) University of Genoa

Department of Informatics, Bioengineering,
Robotics and Systems’ Engineering (DIBRIS)
University of Genoa
Via Opera Pia 13, 16145, Genova, Italy

Published
2016-09-30
How to Cite
Aicardi, M. (2016). A simple Markov chain for the extended Collatz problem. IJRDO -Journal of Computer Science Engineering, 2(9), 20-24. https://doi.org/10.53555/cse.v2i9.804
Issue
Vol. 2 No. 9 (2016): IJRDO - Journal of Computer Science Engineering
Section
Articles

Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the IJRDO Journal will have the full right to remove the published article on any misconduct found in the published article.