1. Introduction
We will use the following well-known fact: if, for the members of the Collatz sequence, zeros predominate in their binary representation, then these members will lead to a decrease in the subsequent members according to the Collatz rule. A striking example is when the initial number in the Collatz sequence is equal to . Let’s write the solution of the equation in the form and note that the smaller x, the more zeros in the corresponding binary representation for n. Developing this idea, we come to the following steps.
Analysis of the binary representation of simple cases of natural numbers.
Creation of a process for decomposing an arbitrary natural number into powers of two.
Analysis of the proximity of the process to binary decomposition at the completion of decomposition at each stage.
Calculation of the number of zeros in the binary decomposition of a natural number.
Estimation of the Collatz sequence members depending on the number of ones in the binary decomposition.
2. Results
This document reveals a comprehensive solution to the Collatz Conjecture, as first proposed in [
1]. The Collatz Conjecture, a well-known unsolved problem in mathematics, questions whether iterative application of two basic arithmetic operations can invariably convert any positive integer into 1. It deals with integer sequences generated by the following rule: if a term is even, the subsequent term is half of it; if odd, the next term is the previous term tripled plus one. The conjecture posits that all such sequences culminate in 1, regardless of the initial positive integer. Named after mathematician Lothar Collatz, who introduced the concept in 1937, this conjecture is also known as the 3n + 1 problem, the Ulam conjecture, Kakutani’s problem, the Thwaites conjecture, Hasse’s algorithm, or the Syracuse problem. The sequence is often termed the hailstone sequence due to its fluctuating nature, resembling the movement of hailstones. Paul Erdős and Jeffrey Lagarias have commented on the complexity and mathematical depth of the Collatz Conjecture, highlighting its challenging nature. Consider an operation applied to any positive integer:
This operation is mathematically defined as:
A sequence is formed by continuously applying this operation, starting with any positive integer, where each step’s result becomes the next input. The Collatz Conjecture asserts that this sequence will always reach 1 Recent substantial advancements in addressing the Collatz problem have been documented in works [
2].
Now let’s move on to our research, which we will conduct according to the announced plan. For this, we will start with the following
Proof.
Next, we move to the functional relations between
and
:
Calculating for
, we get:
Continuing the calculations for
, we obtain:
Thus, we arrive at the final formulas. □
Proof.
Using Theorem 1, we create a sequence
Assume
and for such cases we have
Repeating
j times, we obtain
By Theorem 1 and the conditions of this theorem, we get
From the smallness of
and the last estimate,
Now, let’s consider the number of terms where
. Assume our zero-generation process stopped within
d steps, i.e.,
Then applying formula (2) we get
This implies that
. According to formula (1) and Theorem (1), for each value of
d, we have
. Assuming the binary decomposition process has stopped and
then we can apply reasoning about the appearance of a zero and get another zero. Continuing this process, we find that each group of ones is accompanied by at least one zero. We show that in fact, the group of zeros will be no less than the corresponding group of ones. Analyzing the situation of the group of zeros using formulas (1-2), assume we have a group consisting of three ones and
□
Proof. Let’s introduce operators defined by the formulas
Consider all possible scenarios of the behavior of the Collatz sequence, which can be written in the following form:
It is necessary to calculate an estimate for each
-th member of the Collatz sequence based on the number of
operators applied during
n steps.
Let
have
m units in its binary representation, then calculate the number of applications of the
Z operator by the following formula:
and calculate the number of applications of the
P operator by the following formula:
Since each application of
Z is accompanied by the
P operator, and the number of applications of the
P operator corresponds to the number of zeros in
, which is equal to
. According to the rules of Collatz after
n steps, we have:
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 units on the
-th step leads to an increase in the number of zeros in the
-th step for the binary representation according to previous theorems, hence the reduction of subsequent members of the sequence:
Repeating the reasoning of Theorem 2, consider the equation
From the last equation, in order to apply the results of theorem 2, we need
. To fulfill the last inequality, consider
,
Consider
we get
Choosing
, if the inequalities
are true,
Choosing
, if the inequalities
are true,
Using
we also satisfy the condition
According to theorem 2 we get
According to our application of the Collatz rules, we have the element
, and the order of its binary representation is
After
steps of applying the Collatz rules, we have
By definition of
we get
Using , implies . □
Theorem 4.
then for the Collatz conjecture is true.
Proof. The proof follows from Theorems 1-3. □
Proof. Proof follows from theorem 1-3
3. Conclusions
Our assertion proves that after 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.
References
- O’Connor, J.J.; Robertson, E.F. (2006). "Lothar Collatz". St Andrews University School of Mathematics and Statistics, Scotland.
- Tao, Terence (2022). "Almost all orbits of the Collatz map attain almost bounded values". Forum of Mathematics, Pi. 10: e12. arXiv:1909.03562. ISSN 2050-5086. [CrossRef]
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).