1. Introduction
In the study of number theory, odd and even numbers are a fundamental pair of ideas. Natural number sets come in two different varieties. Numerological theory frequently examines the connections between various numbers. There are numerous conjectures that attempt to generalize the law of different sorts of natural numbers discovered in a restricted range to the entire infinite set of natural numbers. This article will examine the famous Collatz conjecture, which states that for each natural number n, if it is even, divide by 2, if it is odd, multiply by 3, add 1, and so on, the result must finally reach 1. It is also referred to as the conjecture and was put forth in 1937 by Lothar Collatz, also known as the problem. The mathematician Paul Erdos once said of this conjecture: "Mathematics may not be ready for such problems".
The inconsistencies between the finite and the infinite, as well as the relation between various kinds, present difficulties in the study of number theory problems. We are talking about the connection between two different mathematical ideas: the iterated sequence is a ultimately periodic sequence whether the initial value is odd or even.
The finite and the infinite can be connected by the useful mathematical construct known as a function, and the resulting outcomes will also be finite and infinite. A special function that has particular significance in discrete mathematics is the piecewise function. Compound functions and piecewise functions combined is a highly clever mathematical trick. Particularly in number theory, which is the most fundamental idea and mathematical expression, the sequence of numbers is a close connection between functions and finite and infinite. Numerous conjectures are obtained through restricted iteration of an iterative algorithm, which is a widely used method in number theory, but people typically lack the means to demonstrate the accuracy and reasoned nature of conjectures. A fresh technique or new knowledge is frequently used to support a hypothesis. For the Collatz conjecture, we can describe it as a function:
The following sequence is obtained via the composite function (iteration): . Consequently, the Collatz conjecture can be stated as follows: The sequence a always leads to the integer 1, regardless of where you start with the natural number n, namely . The series a is an infinite sequence of ultimately period : the preperiod varies with the initial value n, but the ultimately period is always .
2. Composition of odd and even functions and binary representation of natural numbers
If a natural number can be divided by 2, it is said to be an even number; otherwise, it is said to be odd number. The Peano’s Axiom states that 1 is the smallest natural number. The set of natural numbers may be separated into odd and even sets, we will utilize the standard definition of natural numbers in this work.
.
In the set of natural numbers where 1 is the smallest odd number and 2 is the smallest even number, we can use the expression to indicate that it is an odd, and the expression to indicate that it is an even, where k is any natural number.
We introduce two functions to express odd numbers greater than 1, and to express even numbers.
Definition 1 A natural number n is obtained by composition of the odd function and the even function several times, namely , the function f is either odd function or even function .
For example, . In order to more clearly express the odd-even composition process of a natural number, we use binary representation of a natural number n, for example: , .
Similarly, we can have a piecewise function
If , then the inverse function is .
For generalization, we give the definitions of three natural numbers:
Definition 2(i) By applying the odd function m compositions, a natural number, namely , is obtained. such as , which we call it as pure odd number;
(ii) By applying the even function m compositions, a natural number, namely , is obtained, such as, , which we call it as pure even number;
(iii) The natural number obtained by the composition of odd function and even function , we call it mixed number. Such as, .
In particular, the natural numbers obtained by the finite alternately composition of the odd function and the even function , namely, . Such as , which we call hard number.
Definition 3 The binary string of a natural number is a representation of its odd-even composite function, where the 1 in the -bit from right to left is the sub-odd function, and 0 is the corresponding sub-even function.
For a natural number
n, if its binary string has
k bits, then the degree of composite function is
. The binary string of a pure odd number is made of all 1; and the binary string of a pure even number is all 0 aside from one 1 in left; the binary string of a mixed number is made of many 0 and 1.
Figure 1 shows the decomposition of the composite function (inverse of the composite function) of 60.
In this way, we can classify the set of natural numbers in another way,
Property 4 The set of natural numbers can be divided into three different sets:
The pure odd number is an odd number, the pure even number is an even number, and mixed numbers can be either an odd number or an even number when compared to the conventional classification. The last bit of the binary string, which is either 0 or 1, indicates whether it is even or odd. The entire binary string implicitly indicates one of the following three types: all bits are 0s with the exception of one 1 in the left implicitly pure even, all bits are 1s implicitly pure odd, and there are 0 and 1 in any number of bits of the binary string implicitly mixed.
Example 1 (1)60, 97 are mixed numbers.
(2)64,1180591620717411303424 are pure even numbers.
(3)63,1180591620717411303423 are pure odd numbers.
;
.
are pure even numbers:
are pure odd numbers.
This composite function has special significance, for example,
Example 2 Let be the integer part, that is, , be fractional part, namely . Assuming , is rational set and rational set can be expressed as respectively
,
.
See the references for proof.
3. Tabular and algebraic expressions
For the Collatz conjecture, if expressed by the function , we find that .
For the sake of discussion, we combine the compound function (iterative relation) to get the reduced Collatz function
The result is an odd number. We introduce tabular form and algebraic expression to express the reduced Collatz function .
For example, for
we use the formula (1.1) and iteration, get the following table. Where the last column is its algebraic expression:.
67→ |
202 → |
101 |
|
|
|
|
101→ |
304→ |
152→ |
76→ |
38→ |
19 |
|
19→ |
58→ |
29 |
|
|
|
|
29→ |
88→ |
44→ |
22→ |
11 |
|
|
11→ |
34→ |
17 |
|
|
|
|
17→ |
52→ |
26→ |
13 |
|
|
|
13→ |
40→ |
20→ |
10→ |
5 |
|
|
5→ |
16→ |
8→ |
4→ |
2→ |
1 |
|
1 |
|
|
|
|
|
|
Representing the numbers in the table by its binary string to get
1000011→ |
11001010→ |
1100101 |
|
|
|
|
1100101→ |
100110000→ |
10011000→ |
1001100→ |
100110→ |
10011 |
|
10011→ |
111010→ |
11101 |
|
|
|
|
11101→ |
1011000→ |
101100→ |
10110→ |
1011 |
|
|
1011→ |
100010→ |
10001 |
|
|
|
|
10001→ |
110100→ |
11010→ |
1101 |
|
|
|
1101→ |
101000→ |
10100→ |
1010→ |
101 |
|
|
101→ |
10000→ |
1000→ |
100→ |
10→ |
1 |
|
1 |
|
|
|
|
|
|
The above table is simplified with the help of the reduced Collatz function, and the simplified binary string table obtained is as follows, and we will use this form as the default table in the rest of this article.
1000011→ |
11001010→ |
1100101 |
|
|
1100101→ |
100110000→ |
10011 |
|
|
10011→ |
111010→ |
11101 |
|
|
11101→ |
1011000→ |
1011 |
|
|
1011→ |
100010→ |
10001 |
|
|
10001→ |
110100→ |
1101 |
|
|
1101→ |
101000→ |
101 |
|
|
101→ |
10000→ |
1 |
|
|
1 |
|
|
|
|
In the future, we will use this table as a research tool to write the algebraic expression of the last column in the table:
In general, the algebraic expressions are obtained: Starting from the last row of the table and going up to the binary corresponding to the initial value n of the first row, the numerator is
, The denominator is
,
,
here for the before k lines at the end of the second column of binary string number 0. The details are expressed in the last line of the corresponding table, and we write out the algebraic expression of them as follows:
4. The characteristics of sequence of binary string of the Collatz function iteration
The Collatz function is expressed in binary form as
The characteristics of the first and last parts are represented by the
Figure 2.
By observing the binary strings of iterated Collatz functions with initial values of 31,63 (see the tabulation procedure in reference [7]) and 97,10027 as the follows, we get some laws of pure even, pure odd and mixed numbers with initial values. In the following, we will analyze and discuss the table of the iterative process of the Collatz functions from the two dimensions of row and column of the tables.
|
|
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
|
|
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
→ |
→ |
|
|
|
|
|
|
|
|
|
|
|
|
|
10027 |
10027=(10011100101011)
|
(111010110000010)
|
(11101011000001)
|
|
15041=(11101011000001)
|
(1011000001000100)
|
(10110000010001)
|
|
11281=(10110000010001)
|
(1000010000110100)
|
(10000100001101)
|
|
8461=(10000100001101)
|
(110001100101000)
|
(110001100101)
|
|
3173=(110001100101)
|
(10010100110000)
|
(1001010011)
|
|
595=(1001010011)
|
(11011111010)
|
(1101111101)
|
|
893=(1101111101)
|
(101001111000)
|
(101001111)
|
|
335=(101001111)
|
(1111101110)
|
(111110111)
|
|
503=(111110111)
|
(10111100110)
|
(1011110011)
|
|
755=(1011110011)
|
(100011011010)
|
(10001101101)
|
|
1133=(10001101101)
|
(110101001000)
|
(110101001)
|
|
425=(110101001)
|
(10011111100)
|
(100111111)
|
|
319=(100111111)
|
(1110111110)
|
(111011111)
|
|
479=(111011111)
|
(10110011110)
|
(1011001111)
|
|
719=(1011001111)
|
(100001101110)
|
(10000110111)
|
|
1079=(10000110111)
|
(110010100110)
|
(11001010011)
|
|
1619=(11001010011)
|
(1001011111010)
|
(100101111101)
|
|
2429=(100101111101)
|
(1110001111000)
|
(1110001111)
|
|
911=(1110001111)
|
(101010101110)
|
(10101010111)
|
|
1367=(10101010111)
|
(1000000000110)
|
(100000000011)
|
|
2051=(100000000011)
|
(1100000001010)
|
(110000000101)
|
|
3077=(110000000101)
|
(10010000010000)
|
(1001000001)
|
|
577=(1001000001)
|
(11011000100)
|
(110110001)
|
|
433=(110110001)
|
(10100010100)
|
(101000101)
|
|
325=(101000101)
|
(1111010000)
|
(111101)
|
|
61=(111101)
|
(10111000)
|
(10111)
|
|
23=(10111)
|
(1000110)
|
(100011)
|
|
35=(100011)
|
(1101010)
|
(110101)
|
|
53=(110101)
|
(10100000)
|
(101)
|
|
5=(101)
|
(10000)
|
(1)
|
|
4.1. Row characteristic
1) In each row, the first column is always odd (empty when the initial value is even), and the last bit of its binary string must be 1,
The second column must be even, its binary string must end with at least one 0, the number of subsequent even numbers must be as many as the number of zeros at the end of the second column’s binary string, and the number of zeros at the end of each even number to the right is one less than the previous one, until all zeros are deleted to become the last odd number in the row.
The last column must be odd, and the last bit of its binary string must be 1.
2) When there are only three numbers in a row, that is, only one even number, the last odd number must be greater than the first odd number (the first column); When there are more than three numbers in a row, that is, more than two even numbers, the last odd number must be smaller than the first odd number.
3) The preceding binary string is identical from the second column to the last column in one line, except for the all 0 at the end.
4.2. Column characteristic
From top to bottom, the binary string in the first column of two adjacent rows has the following two characteristics:
1) If the number of bits of 1 in the last substring of the previous row is greater than 1, the number of bits of 1 in the last substring of the next row is reduced by one, and the momentum of this reduction of one bit remains unchanged until it finally becomes only one; The corresponding number is greater than the number in the previous row;
2) If the last substring of the binary string in a row contains only one bit of 1, then the last substring of the binary string in the next row contains either one bit of 1 or many bits of 1, and the corresponding number is smaller than the number in the previous row;
3) Within each line, the number of bits in the first binary string is increased by 1 bit with the number in the second binary string, but for hard numbers, the number is increased by 2 bits. The reduction is at least 1 bit, and when it is a hard number of bits, the number is reduced by .
4.3. Comprehensive characteristic
1) The substring at the end of the binary (right) is observed that when the substring is 1, the units digit of the corresponding decimal number can be any one of . For instance, , , , , .
2) The number ending in decimal is 9 and the corresponding binary number can end in any digits of 1, for instance, , ,,,,.
3) When the last substring of binary is reduced by one bit from many, the corresponding decimal number’s units are always reciprocated within the three groups of numbers: , or , and unit bit is always 9.
4.4. 4.4 Discussion according three sets
The following is a discussion of the natural numbers according to our classification, that is, when the initial value of the iteration process of the Collatz function is pure even, pure odd and mixed numbers, it always reaches the smallest natural number 1, thus proving the establishment of Collatz conjecture.
(1)For a pure even , it requires only an iteration of the times Collatz function to reach the smallest natural number 1, that is, the conjecture holds.
(2)For a special class of mixed numbers, if
in the iteration sequence
of the Collatz function is a special class of mixed numbers - the hard number
, then its sequent iteration result is
This means that the Collatz conjecture is valid at this point. For ordinary mixed numbers, this is a complicated process, which is carried out in conjunction with the discussion of pure odd numbers in follows.
(3) For a pure odd number , if the Collatz function is iterated in binary form, that is, the second column in the preceding table becomes a mixed number, which can be observed by several examples. Research papers on this topic are . By checking the change law of the last substring in the binary string and the change law of the total length of the binary string, we show that the Collatz function always reaches the minimum natural number 1 in the finite iteration value, thus proving the correctness of Collatz conjecture.
In view of the general, a pure odd , there is a mathematical formula: . Two numbers and in the following tables are the values we verify for the Collatz conjecture by iterating , in the Maple program below:
restart;
By verifying the first 203 pure odd number , we can get the following rule:
1) Odd number greater than 1, the corresponding test Collatz function value has the following relation:
if , then .
2)
3)
4)
5)
6)
7)
8)
r |
m |
r |
m |
r |
m |
r |
m |
r |
m |
r |
m |
r |
m |
1 |
0 |
30 |
449 |
59 |
858 |
88 |
1360 |
117 |
1451 |
146 |
2010 |
175 |
2039 |
2 |
7 |
31 |
450 |
60 |
859 |
89 |
1454 |
118 |
1452 |
147 |
2011 |
176 |
2040 |
3 |
16 |
32 |
451 |
61 |
860 |
90 |
1455 |
119 |
1484 |
148 |
2012 |
177 |
2041 |
4 |
17 |
33 |
527 |
62 |
861 |
91 |
1456 |
120 |
1485 |
149 |
2013 |
178 |
2042 |
5 |
106 |
34 |
528 |
63 |
862 |
92 |
1457 |
121 |
1455 |
150 |
2014 |
179 |
2061 |
6 |
107 |
35 |
529 |
64 |
863 |
93 |
1458 |
122 |
1456 |
151 |
2015 |
180 |
2062 |
7 |
46 |
36 |
530 |
65 |
856 |
94 |
1459 |
123 |
1457 |
152 |
2016 |
181 |
2063 |
8 |
47 |
37 |
531 |
66 |
857 |
95 |
1460 |
124 |
1458 |
153 |
2017 |
182 |
2064 |
9 |
61 |
38 |
532 |
67 |
729 |
96 |
1461 |
125 |
1658 |
154 |
2018 |
183 |
2047 |
10 |
62 |
39 |
533 |
68 |
730 |
97 |
1462 |
126 |
1659 |
155 |
2019 |
184 |
2048 |
11 |
156 |
40 |
534 |
69 |
930 |
98 |
1463 |
127 |
1660 |
156 |
2020 |
185 |
2049 |
12 |
157 |
41 |
535 |
70 |
931 |
99 |
1464 |
128 |
1661 |
157 |
2021 |
186 |
2050 |
13 |
158 |
42 |
536 |
71 |
932 |
100 |
1465 |
129 |
1662 |
158 |
2022 |
187 |
2069 |
14 |
159 |
43 |
586 |
72 |
933 |
101 |
1466 |
130 |
1663 |
159 |
2023 |
188 |
2070 |
15 |
129 |
44 |
587 |
73 |
934 |
102 |
1467 |
131 |
1995 |
160 |
2024 |
189 |
2071 |
16 |
130 |
45 |
588 |
74 |
935 |
103 |
1437 |
132 |
1996 |
161 |
2025 |
190 |
2072 |
17 |
224 |
46 |
589 |
75 |
1073 |
104 |
1438 |
133 |
1604 |
162 |
2026 |
191 |
2073 |
18 |
225 |
47 |
590 |
76 |
1074 |
105 |
1439 |
134 |
1605 |
163 |
2027 |
192 |
2074 |
19 |
177 |
48 |
591 |
77 |
938 |
106 |
1440 |
135 |
1606 |
164 |
2028 |
193 |
2972 |
20 |
178 |
49 |
592 |
78 |
939 |
107 |
1441 |
136 |
1607 |
165 |
2029 |
194 |
2973 |
21 |
303 |
50 |
593 |
79 |
940 |
108 |
1442 |
137 |
1608 |
166 |
2030 |
195 |
2974 |
22 |
304 |
51 |
594 |
80 |
941 |
109 |
1474 |
138 |
1609 |
167 |
2031 |
196 |
2975 |
23 |
473 |
52 |
595 |
81 |
1446 |
110 |
1475 |
139 |
2003 |
168 |
2032 |
197 |
2728 |
24 |
474 |
53 |
852 |
82 |
1447 |
111 |
1476 |
140 |
2004 |
169 |
2033 |
198 |
2729 |
25 |
444 |
54 |
853 |
83 |
1448 |
112 |
1477 |
141 |
1961 |
170 |
2034 |
199 |
2730 |
26 |
445 |
55 |
598 |
84 |
1449 |
113 |
1646 |
142 |
1962 |
171 |
2035 |
200 |
2731 |
27 |
384 |
56 |
599 |
85 |
1450 |
114 |
1647 |
143 |
2007 |
172 |
2036 |
201 |
2980 |
28 |
385 |
57 |
856 |
86 |
1451 |
115 |
1648 |
144 |
2008 |
173 |
2037 |
202 |
2981 |
29 |
448 |
58 |
857 |
87 |
1359 |
116 |
1649 |
145 |
2009 |
174 |
2038 |
203 |
2085 |
5. Comparison of two piecewise functions and the proof of Collatz conjecture
Comparing the Collatz function and the function , if their domain is defined as the set of natural numbers, we find that they have the following relation:
1) The function is strictly monotonically decreasing,
2) When is purely even, the function is only one case of the functions, is strictly monotonically decreasing;
3) When
is a pure or mixed odd number, the function
is wavy, which is increasing, followed by one or more decreasing processes, that is, "increase – decrease – increase", or "increase – decrease ⋯ decrease – increase". For example,
Figure 3 and
Figure 4 are the plots of the iterated sequence of Collatz functions with initial values of pure odd
and mixed odd number
, respectively.
Due to the fact that an odd number can be either pure or mixed, when is odd, the Collatz function can be parted into two parts. i.e., .
(i) when is a pure odd number, i.e., , The binary string is even, with just one 0 at the end, and the other part is pure even. As a result, is a mixed even number with only one 0 in the last bit and bits 1 in the second-to-last substring, corresponding , it means function T(x) is increase.
(ii) When is a mixed odd number, it just has one 1 in the last binary substring, the value is smaller odd than , it means function T(x) is decrease. The last binary substring of number has two kinds, which :
(a) There many 1 in the last binary substring. For example, , , .
(b) Only 1 in the last binary substring. For example, , , .
When the end of the binary substring is 1, using × denotes either 1 or 0, we discuss the changes of the last substring three digits and four digits in the procedure of the Collatz function sequences:
,
,
can adjust the structure of its binary substring, when the end of the binary substring is 1, the value of Collatz function decrease, thus the number of binary string digits decrease at least 2. This process continues several times, and eventually you can reach the minimum value of 1. The Collatz function shows that the Collatz conjecture holds.
Another Proof We give the statement "period three implies chaos" another interpretation: for any positive integer n, the sequence of the Collatz is an ultimately periodic sequence, its preperiod is a related-to n positive, and the least period , .
We use the inversion of "period three implies chaos" is the Collatz sequence of any initial value . when the Collatz Conjecture is correct, then the reverse order of sequence obtained for any natural initial n, the sequence of the Collatz function is an ultimately periodic of period 3, .
6. Conclusion
From previous proof of the conjecture, it becomes a theorem.
Theorem For any natural number , if it is even, divide by 2, if it is odd, multiply by 3, add 1, and so on, the result must finally reach 1. Give another statement: for any positive integer n, the sequence of the Collatz function is an ultimately periodic sequence, its preperiod is a related-to n positive, and the least period , .
Funding
Educational technology innovation project of Gansu Province (No. 2022A-13).
References
- Jeffrey C. Lagarias. The 3x + 1 Problem and Its Generalizations. American Mathematical Monthly, Vol. 92, No. 1, 3-23(1985). [CrossRef]
- Jeffrey, C. Lagarias. The 3x+1 Problem: An Overview. arXiv:2111.02635.
- Li, T., Yorke, J. A. Period three implies chaos. Am. Mat. Monthly, 82, 985–992 (1975). [CrossRef]
- TERENCE TAO, Almost all orbits of the Collatz map attain almost bounded values. 2022, arXiv:1909.03562v51, 15.
- https://www.sohu.com/a/611510165_107944.
- Alf : Alf Kimms. The structure of the 3x+1 problem, Electronic Journal of Graph Theory and Applications. 9(1)(2021)157–174. [CrossRef]
- Richard Kaufman. A reduced forward Collatz algorithm: How binary strings change their length under 3x+1. arXiv:2301.07466.
- Patrick Chisan Hew. Collatz on the Dyadic rdtional in [0.5,1) with fractals: how bit strings change their length under 3x+1. Experimental Mathematics, 2021, 30(4): 481-488. [CrossRef]
- G. Ganesan. Linear recurrences over a finite field with exactly two periods. Advances In Applied Mathematics 127(2021)102180. [CrossRef]
- D. Quijada. Periods of linearly recurring sequences. Bachelor thesis, Washington and LeeUniversity, 2015.
- Leonel Sternberg, Predictable trajectories of the reduced Collatz iteration and a possible pathway to the proof of the Collatz conjecture(Version 2). arXiv:2209.14230.
- F. Jishe, Proof the Collatz Conjecture in Binary Strings. [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. |
© 2020 by the author. 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 (https://creativecommons.org/licenses/by/4.0/).