Article
Version 2
Preserved in Portico This version is not peer-reviewed
Numerical Approach on Collatz Conjecture
Version 1
: Received: 23 April 2024 / Approved: 23 April 2024 / Online: 25 April 2024 (15:14:50 CEST)
Version 2 : Received: 1 May 2024 / Approved: 3 May 2024 / Online: 3 May 2024 (11:22:09 CEST)
Version 2 : Received: 1 May 2024 / Approved: 3 May 2024 / Online: 3 May 2024 (11:22:09 CEST)
How to cite: Lee, Y. Numerical Approach on Collatz Conjecture. Preprints 2024, 2024041570. https://doi.org/10.20944/preprints202404.1570.v2 Lee, Y. Numerical Approach on Collatz Conjecture. Preprints 2024, 2024041570. https://doi.org/10.20944/preprints202404.1570.v2
Abstract
We can analyze the properties of the Collatz Conjecture by using Terras’ Theorem, and computational graphical calculations. To do this, we introduce the concept of “tree" which shows the relationship between the input and output positive integers of the Collatz process. This approach offers a novel way for determining the non-existence of loops and diverge trees through computer simulations.
Keywords
collatz conjecture; 3x+1 problem; Terras Theorem
Subject
Computer Science and Mathematics, Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment