Solve the 3x+1 Problem by the Multiplication and Division of Binary Numbers
3x + 1 problem, binary number, collatz conjecture, sharkovskii ordering, lattice path.
Abstract
The 3x + 1 problem is the following: Suppose we start with a positive integer, and if it is odd then multiply it by 3 and add 1, and if it is even, divide it by 2. Then repeat this process as long as you can. Will you eventually reach the integer 1, no matter what you started with? Collatz conjecture (or 3n + 1 problem) has been explored for about 85 years. In this paper, we convert an integer number from decimal to binary and convert the Collatz function to a binary function, which involves the multiplication and division of two binary numbers. Finally, by iterating the Collatz function, we eventually reach the integer number 1.
Downloads
How to Cite
References
Jeffrey Lagarias (1985) The 3x + 1 Problem and Its Generalizations. 92(1), 3.
Jeffrey Lagarias The 3x+1 Problem: An Overview.
P Stefan (1977) A theorem of Šarkovskii on the existence of periodic orbits of continuous endomorphisms of the real line. 54(3), 237-248.
T Li, J Yorke (1975) Period three implies chaos. 82, 992.
Terence Tao (2022) Almost all orbits of the Collatz map attain almost bounded values. 10(1), 15.
Feng Jishe, Wang Xiaomeng, Gao Xiaolu, Pan Zhuo (2022) The research and progress of the enumeration of lattice paths. 17(5), 747-766.
Alf Kimms (2021) The structure of the 3x + 1 problem. 9(1), 157.
Published
2023-04-03
Issue
Section
License
Copyright (c) 2023 Authors and Global Journals Private Limited

This work is licensed under a Creative Commons Attribution 4.0 International License.