Article
Version 2
Preserved in Portico This version is not peer-reviewed
$2^m - 1$ as the Integer Formulation to Govern the Dynamics of Collatz-Type Sequences
Version 1
: Received: 10 July 2024 / Approved: 11 July 2024 / Online: 11 July 2024 (12:28:15 CEST)
Version 2 : Received: 17 July 2024 / Approved: 18 July 2024 / Online: 18 July 2024 (14:33:11 CEST)
Version 3 : Received: 19 July 2024 / Approved: 22 July 2024 / Online: 22 July 2024 (11:55:52 CEST)
Version 4 : Received: 22 July 2024 / Approved: 23 July 2024 / Online: 23 July 2024 (16:06:28 CEST)
Version 5 : Received: 24 July 2024 / Approved: 25 July 2024 / Online: 25 July 2024 (14:59:59 CEST)
Version 2 : Received: 17 July 2024 / Approved: 18 July 2024 / Online: 18 July 2024 (14:33:11 CEST)
Version 3 : Received: 19 July 2024 / Approved: 22 July 2024 / Online: 22 July 2024 (11:55:52 CEST)
Version 4 : Received: 22 July 2024 / Approved: 23 July 2024 / Online: 23 July 2024 (16:06:28 CEST)
Version 5 : Received: 24 July 2024 / Approved: 25 July 2024 / Online: 25 July 2024 (14:59:59 CEST)
How to cite: Goyal, G. $2^m - 1$ as the Integer Formulation to Govern the Dynamics of Collatz-Type Sequences. Preprints 2024, 2024070961. https://doi.org/10.20944/preprints202407.0961.v2 Goyal, G. $2^m - 1$ as the Integer Formulation to Govern the Dynamics of Collatz-Type Sequences. Preprints 2024, 2024070961. https://doi.org/10.20944/preprints202407.0961.v2
Abstract
It has been discovered that representing odd integers as modified binary expressions ending with $2^m - 1$ for $m \geq 1$ helps in understanding the dynamics of Collatz-type sequences. Starting with the original Collatz sequence $3n + 1$, it is found that when the odd step is applied to an odd integer ending with $2^m - 1$, an even integer that ends in $2^{m+1} + 2^m - 2$ is obtained, which is exactly once divisible by 2, unless the lowest index reduces to zero. This implies that the sequence alternates between odd and even steps $m$ times. This governs the dynamics of the Collatz-type sequences because the value of $m$ determines the number of times the integer can be divided by 2 in each even step. A shortcut method is then presented that gives the even integer after $m$ odd-even steps are completed. This formulation also allows construction of odd integers to follow specific patterns of odd and even steps. The shortcut method for the modified Collatz sequence $5n+1$ is also presented.
Keywords
Collatz; 3n+1
Subject
Computer Science and Mathematics, Algebra and Number Theory
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