Article
Version 3
Preserved in Portico This version is not peer-reviewed
Collatz Conjecture
Version 1
: Received: 30 December 2023 / Approved: 3 January 2024 / Online: 4 January 2024 (03:23:16 CET)
Version 2 : Received: 5 January 2024 / Approved: 6 January 2024 / Online: 8 January 2024 (06:22:04 CET)
Version 3 : Received: 8 January 2024 / Approved: 8 January 2024 / Online: 8 January 2024 (10:32:51 CET)
Version 4 : Received: 10 January 2024 / Approved: 11 January 2024 / Online: 11 January 2024 (07:17:52 CET)
Version 5 : Received: 12 January 2024 / Approved: 12 January 2024 / Online: 15 January 2024 (03:45:13 CET)
Version 6 : Received: 21 January 2024 / Approved: 22 January 2024 / Online: 22 January 2024 (10:11:28 CET)
Version 7 : Received: 23 January 2024 / Approved: 23 January 2024 / Online: 23 January 2024 (09:59:20 CET)
Version 8 : Received: 24 January 2024 / Approved: 24 January 2024 / Online: 24 January 2024 (09:02:39 CET)
Version 9 : Received: 25 January 2024 / Approved: 26 January 2024 / Online: 29 January 2024 (04:21:12 CET)
Version 10 : Received: 1 February 2024 / Approved: 2 February 2024 / Online: 2 February 2024 (06:12:54 CET)
Version 11 : Received: 5 February 2024 / Approved: 5 February 2024 / Online: 5 February 2024 (08:16:07 CET)
Version 12 : Received: 5 February 2024 / Approved: 6 February 2024 / Online: 6 February 2024 (05:13:21 CET)
Version 13 : Received: 6 February 2024 / Approved: 7 February 2024 / Online: 7 February 2024 (06:25:43 CET)
Version 14 : Received: 7 February 2024 / Approved: 8 February 2024 / Online: 8 February 2024 (07:39:16 CET)
Version 15 : Received: 8 February 2024 / Approved: 8 February 2024 / Online: 10 February 2024 (05:58:49 CET)
Version 16 : Received: 18 February 2024 / Approved: 20 February 2024 / Online: 20 February 2024 (11:29:01 CET)
Version 17 : Received: 20 February 2024 / Approved: 22 February 2024 / Online: 22 February 2024 (11:40:27 CET)
Version 18 : Received: 3 March 2024 / Approved: 4 March 2024 / Online: 4 March 2024 (09:50:10 CET)
Version 19 : Received: 4 March 2024 / Approved: 5 March 2024 / Online: 5 March 2024 (05:59:39 CET)
Version 20 : Received: 17 March 2024 / Approved: 17 March 2024 / Online: 18 March 2024 (10:20:10 CET)
Version 21 : Received: 24 March 2024 / Approved: 24 March 2024 / Online: 25 March 2024 (08:12:10 CET)
Version 2 : Received: 5 January 2024 / Approved: 6 January 2024 / Online: 8 January 2024 (06:22:04 CET)
Version 3 : Received: 8 January 2024 / Approved: 8 January 2024 / Online: 8 January 2024 (10:32:51 CET)
Version 4 : Received: 10 January 2024 / Approved: 11 January 2024 / Online: 11 January 2024 (07:17:52 CET)
Version 5 : Received: 12 January 2024 / Approved: 12 January 2024 / Online: 15 January 2024 (03:45:13 CET)
Version 6 : Received: 21 January 2024 / Approved: 22 January 2024 / Online: 22 January 2024 (10:11:28 CET)
Version 7 : Received: 23 January 2024 / Approved: 23 January 2024 / Online: 23 January 2024 (09:59:20 CET)
Version 8 : Received: 24 January 2024 / Approved: 24 January 2024 / Online: 24 January 2024 (09:02:39 CET)
Version 9 : Received: 25 January 2024 / Approved: 26 January 2024 / Online: 29 January 2024 (04:21:12 CET)
Version 10 : Received: 1 February 2024 / Approved: 2 February 2024 / Online: 2 February 2024 (06:12:54 CET)
Version 11 : Received: 5 February 2024 / Approved: 5 February 2024 / Online: 5 February 2024 (08:16:07 CET)
Version 12 : Received: 5 February 2024 / Approved: 6 February 2024 / Online: 6 February 2024 (05:13:21 CET)
Version 13 : Received: 6 February 2024 / Approved: 7 February 2024 / Online: 7 February 2024 (06:25:43 CET)
Version 14 : Received: 7 February 2024 / Approved: 8 February 2024 / Online: 8 February 2024 (07:39:16 CET)
Version 15 : Received: 8 February 2024 / Approved: 8 February 2024 / Online: 10 February 2024 (05:58:49 CET)
Version 16 : Received: 18 February 2024 / Approved: 20 February 2024 / Online: 20 February 2024 (11:29:01 CET)
Version 17 : Received: 20 February 2024 / Approved: 22 February 2024 / Online: 22 February 2024 (11:40:27 CET)
Version 18 : Received: 3 March 2024 / Approved: 4 March 2024 / Online: 4 March 2024 (09:50:10 CET)
Version 19 : Received: 4 March 2024 / Approved: 5 March 2024 / Online: 5 March 2024 (05:59:39 CET)
Version 20 : Received: 17 March 2024 / Approved: 17 March 2024 / Online: 18 March 2024 (10:20:10 CET)
Version 21 : Received: 24 March 2024 / Approved: 24 March 2024 / Online: 25 March 2024 (08:12:10 CET)
How to cite: Durmagambetov, A.; Durmagambetova, A. Collatz Conjecture. Preprints 2024, 2024010227. https://doi.org/10.20944/preprints202401.0227.v3 Durmagambetov, A.; Durmagambetova, A. Collatz Conjecture. Preprints 2024, 2024010227. https://doi.org/10.20944/preprints202401.0227.v3
Abstract
This paper presents an analysis of the number of zeros in the binary representation of natural numbers. The primary method of analysis involves the use of the concept of the fractional part of a number, which naturally emerges in the determination of binary representation. This idea is grounded in the fundamental property of the Riemann zeta function, constructed using the fractional part of a number. Understanding that the ratio between the fractional and integer parts of a number, analogous to the Riemann zeta function, reflects the profound laws of numbers becomes the key insight of this work. The findings suggest a new perspective on the interrelation between elementary properties of numbers and more complex mathematical concepts, potentially opening new directions in number theory and analysis."
Keywords
binary representation; Collatz conjecture
Subject
Computer Science and Mathematics, Analysis
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 (1)
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
Commenter: Asset Durmagambetov
Commenter's Conflict of Interests: Author
Theorem 4. Let
$$
a_{n}=\sum_{i=0}^{n} \gamma_{i} 2^{i}, \quad n>1000, \quad \gamma_{i} \in\{0,1\}
$$
then
$$
a_{4 n}<a_{n}
$$
\begin{proof}
. Let's introduce operators defined formulas
$$
P f=f / 2, \quad T f=3 f+1, Z f=3 f\\
$$
$$
T_{i} \in\{P, T\}, R_{i} \in\{Z, P\},
$$
Let's consider all possible scenarios of the behavior of the Syracuse sequence , the same possible scenarios can be written in the following form
$$
\begin{gathered}
a_{n+n}=T_{1} T_{2} \ldots . T_{n} a_{n} \\
% a_{n+n}=R_{1} R_{2} \ldots . R_{n} a_{n}+A_{2n}
\end{gathered}
$$
We need to calculate an estimate for every 2n-th member of the Collatz sequence based on the number of applied operators P ,T,Z over n step.\\
$$
\begin{gathered}
a_{n+n}=T_{n} T_{n-1} \ldots . T_{1} a_{n} \\
% a_{n+n}=R_{1} R_{2} \ldots . R_{n} a_{n}+A_{2n}
\end{gathered}
$$
Let $a_n $have m ones in binary representation, then
count the number of applications of the Z operator in the following formula.
$$
m=\sum_{R_{i}=Z,\,i\le n} 1
$$
and count the number of applications of the P operator in the following formula.
$$
\sum_{R_{i}=P,\, i\le n} 1= m+n-m
$$
Because, each application Z is accompanied by an operator P and the number of applications of the operator P according to the zeros $a_n$ has a corresponding n-m
By rules of Collatz we have after $n$ steps
$$
a_{n+n}=3^{m} / 2^{n} a_{n}+T_{n} T_{n-1} \ldots . T_{1} 1=3^{m} / 2^{n} a_{n}+B_{n}
$$
$$
B_{n} \leq \sum_{j=1, m} 3^{j}/2^{j}<23^{m} / 2^{m} \leq 3(3/2)^{m} 2^{-n}a_{n}
$$
$$
B_{n} \leq 3(3/4)^{m} 2^{m-n}a_{n}
$$
According to the last formula, we see that the growth of each member of the sequence depends on the number of units in the binary representation. Next, we will show that a large number of ones at the * step leads to an increase in the number of zeros in the binary representation according to the previous theorems. Where will the decrease in the following terms of the sequence follow
$$
\begin{gathered}
a_{2 n}=3^{m}\left(a_{n} * 2^{-n}+B_{n}\right)=\left(a_{n} * 2^{-n}+B_{n}\right) 3^{m} \\
a_{2 n}=\sum_{i=0}^{\left[\alpha_{1}\right]} \gamma_{i} 2^{i}, \quad \gamma_{i} \in\{0,1\}, \quad \alpha_{1}=m * \ln 3 / \ln 2+\ln \left(2^{-n} a_{n}\right)
\end{gathered}
$$
Repeating the reasoning of Theorem 3, let's consider the equation
$$
2^x=a_{2 n}=3^{m}a_{n} \cdot 2^{-n}+B_{n} =3^{m} +3^{m}(a_{n}-2^{n} )\cdot 2^{-n} +B_{n}
$$
$$
x\ln2= m\ln(3) +\ln\left(1+(a_{n}-2^{n})\cdot 2^{-n}+ B_n \cdot 3^{-m}\right)
$$
We come to the following
$$
x\ln2= m\ln(3) + \ln(1+\theta) + O( \frac{1}{2^n\ln2})
$$
$$
\{x\}= \left\{\frac{m\ln(3)}{\ln(2)} +\frac{\ln(1+\theta)}{\ln2} + O( \frac{1}{2^n\ln2}) \right\}
$$
From the last equation, in order to apply the results of Theorem 3, we need $\{x\} >\ln2 $.
To execute the last inequality, consider the following cases
\begin{enumerate}
\item $\gamma_{n-1}=0,\gamma_{n-2}=0$
\item $\gamma_{n-1}=1,\gamma_{n-2}=1$
\item $\gamma_{n-1}=0,\gamma_{n-2}=1$
\item $\gamma_{n-1}=1,\gamma_{n-2}=0$
\end{enumerate}
In addition, we accept the possibility of changing m $\Rightarrow m\pm 1$. The latter is possible by changing the number of applications of the Collatz rules or, in other words, by decreasing or increasing the elements of the sequence by one. As a result, we have
$$
\{x\}= \left\{\frac{(m \pm 1)\ln(3)}{\ln(2)} +\frac{\ln(1+\theta)}{\ln2} + O( \frac{1}{2^n\ln2}) \right\}
$$
Considering the following cases for $m=m, m=m-1, m=m+1$ depending on the behavior of $\gamma_{n-1},\gamma_{n-2}$ we have the following three variants for the fractional part of x
$$
\{x\}= \left\{\frac{(m \pm 1)\ln(3)}{\ln(2)} +\frac{\ln(1+\theta)}{\ln2} +O( \frac{1}{2^n\ln2}) \right\}
$$
$$
\{x\}= \left\{\frac{m \ln(3)}{\ln(2)} +\frac{\ln(1+\theta)}{\ln2} +O( \frac{1}{2^n\ln2}) \right\}
$$
Thus, depending on the behavior of $\gamma_{n-1},\gamma_{n-2}$ we can always choose an option where the fractional part of x will satisfy the conditions of Theorem 3.
Denoting
$$
\begin{aligned}
& m^{*} \text { is the number of non-zero } \gamma_{i} \\
& l^{*} \text { is the number of zero } \gamma_{i}
\end{aligned}
$$
by theorem 3 we will have
$$
\begin{gathered}
m^{*} \leq\left[\alpha_{1}\right] / 2+5=[m \ln 3 / \ln 2] / 2+5 \\
l^{*} \geq\left[\alpha_{1} / 2-5=[m \ln 3 / \ln 2] / 2-5\right.
\end{gathered}
$$
After $3n$ steps of applying Collatz rules, we have
$$
a_{4n} = \frac{3^{m^{*} } }{2^{2n }}a_{2n}+T_{3n} T_{3n-1} \ldots . T_{1} 1= \frac{3^{m^{*} } }{2^{2n }} a_{2n}+B_{3n }
$$
$$
a_{4n} = \frac{3^{m^{*} } }{2^{2n }} a_{2n}+T_{3n} T_{3n-1} \ldots . T_{1} 1=
\frac{3^{m^{*} } }{2^{2n }} \left( \frac{3^{m } }{2^{n }} a_{n}+B_{n}\right)+B_{3n }
$$
$$
a_{4n} =3^{m^{*}+m } 2^{-3n} a_{n}+ 3^{m^{*} } 2^{-2n}B_{n}+B_{3n }
$$
$$
B_{3n }=3^{m^{*}}2^{-2n} B_{n }=3^{m^* +m} 2^{-2n-n} a_{n }
$$
$$
a_{4n} \le q_{1} * a_{n}
$$
by definitions $ m^*, l^*,B_{n} $ we get
$$
q_{1}<1
$$
Using $n > 1000 \Rightarrow q_{1} < 1 \Rightarrow a_{4n } < a_{n}$.
\end{proof}
Theorem 5. Let
$$
a_{n}=\sum_{i=0}^{n} \gamma_{i} 2^{i}, \quad n>1000, \quad \gamma_{i} \in\{0,1\}
$$
then for $a_{n}$ Collatz conjecture is true
Proof. Proof follows from theorem 1-4
\section*{6. Conclusions}
Our assertion proves that after $3n$ steps, a sequence with an initial binary length of $n$ arrives at a number strictly smaller than the initial one, from which the solution to the Collatz conjecture follows. This is because by applying this process $n$ times, we are guaranteed to arrive at 1.