Abstract
lt is well known that the Collatz Conjecture is one of the unsolved problems in mathematics. Supercomputer simulation has confirmed that the Collatz conjecture is correct for all positive integers unti1 2.95*10^20. Recently, Terence Tao proved that almost all orbits of the Collatz map attain almost bounded values. It is to say that the Collatz conjecture is almost correct for almost all positive integers. This paper proposes an asymptotic approach for the Collatz Conjecture by the mathematical induction and probability theory. The result of this paper means that the Collatz conjecture is correct for almost all positive integers. Keywords: Collatz Conjecture, asymptotic approach, probability, mathematical induction.
Publisher
International Information Institute
Reference20 articles.
1. [1] L. Rade, R. D. Nelson, Solution of Mathematical Puzzle by Computer, Kaibundo Publishing, Tokyo, 1992.
2. [2] Interesting Kakutani's Conjecture, Computer World, Beijing, 1985.
3. [3] Manuel V.P. Garcia and Fabio A. Tal, A Note on the Generalized 3n+1 Problem, Acta Arithmetica XC 3(1999), pp.245-250.
4. [4] http://www.math.grin.edu/~chamberl/conf.html
5. [5] David Barina, Convergence Verification of the Collatz Problem, The Journal of Supercomputing, 77(2021),pp.2681-2688.