The 3x + 1 problem, is a math problem that
has baffled mathematicians for over 50 years. It’s easy to explain: take any
positive number, if it’s even, divide it by 2; if it’s odd, multiply it by 3
and add 1. Repeat this process with the resulting number, and the conjecture
says that you will eventually reach 1. Despite testing all starting values up
to an enormous number, no one has proved the conjecture is true for all
possible starting values. The problem’s importance lies in its simplicity and
difficulty, inspiring new ideas in mathematics and advancing fields like number
theory, dynamical systems, and computer science. Proving or disproving the
conjecture would revolutionize our understanding of math. The presence of
infinite sequences is a matter of question. To investigate and solve this
conjecture, we are utilizing a novel approach involving the fields of number
theory and computer science.
References
[1]
Ren, W., Li, S.M., Xiao, R.Y. and Bi, W. (2018) Collatz Conjecture for 2ˆ 100000-1 Is True-Algorithms for Verifying Extremely Large Numbers. 2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/ IOP/SCI), Guangzhou, 8-12 October 2018, 411-416. https://doi.org/10.1109/SmartWorld.2018.00099
[2]
Lagarias, J.C. (2003) The 3x + 1 Problem: An Annotated Bibliography (1963-1999). https://doi.org/10.48550/arXiv.math/0309224
[3]
Belaga, E.G. and Mignotte, M. (1998) Embedding the 3x + 1 Conjecture in a 3x + d Context. Experimental Mathematics, 7, 145-151. https://doi.org/10.1080/10586458.1998.10504364
[4]
Applegate, D. and Lagarias, J. (2003) Lower Bounds for the Total Stopping Time of 3x + 1 Iterates. Mathematics of Computation, 72, 1035-1049. https://doi.org/10.1090/S0025-5718-02-01425-4
[5]
Lagarias, J.C. (2010) The Ultimate Challenge: The $3x + 1$ Problem. American Mathematical Society, Providence. https://doi.org/10.1090/mbk/078
[6]
Monks, K.M. (2006) The Sufficiency of Arithmetic Progressions for the 3x + 1 Conjecture. Proceedings of the American Mathematical Society, 134, 2861-2872. https://doi.org/10.1090/S0002-9939-06-08567-4
[7]
Krasikov, I. (1989) How Many Numbers Satisfy the 3x + 1 Conjecture? International Journal of Mathematics and Mathematical Sciences, 12, 791-796. https://doi.org/10.1155/S0161171289000979
[8]
Feinstein, C.A. (2004) The Collatz 3n + 1 Conjecture Is Unprovable. Science Direct Working Paper.
[9]
Mandadi, V. and Paramwswari, D. (2019) Verification of Collatz Conjecture: An Algorithmic Approach Based on Binary Representation of Integers. arXiv: 1912.05942.
[10]
Venkatesulu, M. and Parameswari, C.D. (2020) Verification of Collatz Conjecture: An Algorithmic Approach. WSEAS Transactions on Engineering World, 2, 71-75.
[11]
Lagarias, J.C. (1985) The 3x + 1 Problem and Its Generalizations. The American Mathematical Monthly, 92, 3-23. https://doi.org/10.1080/00029890.1985.11971528
[12]
Halmos, P.R. (2017) Naive Set Theory. Courier Dover Publications, New York.
[13]
Suppes, P. (1972) Axiomatic Set Theory. Courier Corporation, Chelmsford.
[14]
Burgess, J.P. (2022) Set Theory. Cambridge University Press, Cambridge.
[15]
Guy, R. (2004) Unsolved Problems in Number Theory. Springer Science & Business Media, Berlin. https://doi.org/10.1007/978-0-387-26677-0
