preprints.org > computer science and mathematics > mathematics > doi: 10.20944/preprints202408.2050.v4

Preprint Article Version 4 Preserved in Portico This version is not peer-reviewed

Version 1 : Received: 28 August 2024 / Approved: 28 August 2024 / Online: 28 August 2024 (11:44:44 CEST)
Version 2 : Received: 29 August 2024 / Approved: 29 August 2024 / Online: 29 August 2024 (10:16:53 CEST)
Version 3 : Received: 30 August 2024 / Approved: 30 August 2024 / Online: 30 August 2024 (19:22:09 CEST)
Version 4 : Received: 3 September 2024 / Approved: 4 September 2024 / Online: 4 September 2024 (14:59:10 CEST)

Let an odd integer \(\mathcal{X}\) be expressed as $\mathcal{X} = \left\{\sum\limits_{M > m} 2^M\right\} + 2^m - 1,$ where $2^m - 1$ is referred to as the Governor. In Collatz-type functions, a high index Governor is eventually reduced to $2^1 - 1$. For the $3\mathcal{Z} + 1$ sequence, the Governor occurring in the trivial cycle is $2^1 - 1$, while for the $5\mathcal{Z} + 1$ sequence, the Trivial Governors are $2^2 - 1$ and $2^1 - 1$. Therefore, in these specific sequences, the Collatz function reduces $\mathcal{X}$ to $\mathcal{X} = \left\{\sum\limits_{N > \mathcal{T}} 2^N\right\} + 2^{\mathcal{T}} - 1,$ where $2^{\mathcal{T}} - 1$ is the Trivial Governor. Once this Trivial Governor is reached, it can evolve to a higher index Governor through interactions with other terms. This feature allows $\mathcal{X}$ to reappear in a Collatz-type sequence, since $2^m - 1 = 2^{m - 1} + \cdots + 2^{\mathcal{T} + 1} + 2^{\mathcal{T}} + (2^{\mathcal{T}} - 1).$ Thus, if $\mathcal{X}$ reappears, at least one odd ancestor of $2^{m - 1} + \cdots + 2^{\mathcal{T} + 1} + 2^{\mathcal{T}} + (2^{\mathcal{T}} - 1)$ must have a Governor $2^m - 1$. Ancestor mapping shows that all odd ancestors of $\mathcal{X}$ have the Trivial Governor for the respective Collatz sequence. This implies that odd integers that repeat in the $3\mathcal{Z} + 1$ sequence have the Governor $2^1 - 1$, while those forming a repeating cycle in the $5\mathcal{Z} + 1$ sequence have either $2^2 - 1$ or $2^1 - 1$ as the Governor. Successor mapping for the $3\mathcal{Z} + 1$ sequence further indicates that there are no auxiliary cycles, as the Trivial Governor is always transformed into a different index Governor. Similarly, successor mapping for the $5\mathcal{Z} + 1$ sequence reveals that the smallest odd integers forming an auxiliary cycle are smaller than $2^5$. Finally, attempts to identify integers that diverge for the $3\mathcal{Z} + 1$ sequence suggest that no such integers exist.

Collatz, 3x+1, 5x+1, collatz conjecture

Computer Science and Mathematics, Mathematics

* All users must log in before leaving a comment