Abstract
It is shown that infinites of the subsequence of odd numbers is not a
counterargument of the violation of the Collatz hypothesis, but a universal
characteristic of transformations of natural numbers by the 3n + 1 algorithm. A
recurrent relationship is established between the parameters of the sequence of Collatz
transformations of an arbitrary pair of natural numbers n and 2n.
Publisher
Lviv Polytechnic National University
Reference13 articles.
1. 1.L. Collatz On the motivation and origin of the (3n + 1) - Problem, J. Qufu Normal University, Natural Science Edition,1986, 12(3), 9-11.
2. 2. The On-line encyclopedia of integer sequences. The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation, https://oeis.org/A002450
3. 3. R. Terras. A stopping time problem on the positive integers. Acta Arith. 1976, 30, 241-252. https://doi.org/10.4064/aa-30-3-241-252
4. 4.Terras, R. On the Existence of a Density. Acta Arith. 1979, 35, 101-102. https://doi.org/10.4064/aa-35-1-101- 102
5. 5. T. Tao. Almost all orbits of the Collatz map attain almost bounded values, 2020. 6.A. Rahn, E. Sultanow, M. Henkel, S. Ghosh, I. Aberkane. An Algorithm for Linearizing the Collatz Convergence.Mathematics 2021, 9(16), 1898; https://doi.org/10.3390/math9161898