See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/378366520

Simple arithmetic statements equivalent to the proof of the Collatz conjecture

Preprint · February 2024

DOI: 10.13140/RG.2.2.22861.41444

CITATIONS READS
0 430

1 author:

Akram Louiz
University of Applied Sciences Landshut
42 PUBLICATIONS 62 CITATIONS

SEE PROFILE

All content following this page was uploaded by Akram Louiz on 01 March 2024.

The user has requested enhancement of the downloaded file.

 Simple arithmetic statements equivalent to the proof of the
Collatz conjecture.

Akram Louiz
Independent researcher, Settat, Morocco.
[email protected]

Abstract:
Let’s stay optimistic and believe that the logic and the modern mathematical tools can be enough in order to
develop solutions for any mathematical problem, especially the Collatz conjecture.
We could use previous published short works in making a new approach in the study of the Collatz conjecture.
This article proposes new results with easy tools and gives simple arithmetic statements which are equivalent to
the proof of the famous Collatz conjecture. I hope that this article helps the lovers of sequences and number
theory in understanding new aspects of this conjecture and I hope that even the scientists who only apply
mathematics in their fields of study can use the results of this work.

Keywords : Collatz conjecture, Syracuse, sequence, process, recurrence, even, odd, expression, natural
numbers, solution, form, equivalent proof.

1. Introduction:
After publishing previous mathematics works regarding Calculus and Analysis [1,4,5] and regarding
applied mathematics [2,3], I had the opportunity to contribute in the field of arithmetic and number
theory by publishing short simple mathematics letters [8,9] which formed a larger work which is a new
basis in the study of the Collatz conjecture [10].
Many works still try to explain the meanings and the consequences of the Collatz conjecture [6],
whereas other works propose new approaches in studying this problem [7]. And thus, we have the right
to believe that the field of mathematics has all the tools to find solution of arithmetic problems such as
the Collatz conjecture. We carry on consequently in our previous efforts in proposing new results [10]
in order to better explain the aspects of this conjecture and in order to collaborate with all the lovers of
mathematics who dream of finding a solution for the Collatz conjecture.

In our previous work [10], we concluded for x n≠0 that all the natural numbers x n which respect the
Collatz conjecture can be written in at least one of these five forms:

-The first form is: x n=2 M ∀ M ∈ℕ∖ {0 }

2×M
2 −1
-The second form is: x n= ∀ M ∈ℕ∖ {0 } since the recurrence relation demonstrated above
3
is only for n≥2 and this is the case for n=0. All the possible values of x n in this expression can be
deduced without any divisions from a sequence demonstrated above.
-The third form is: 3×x n=22×M + p −2 p ∀ M ∈ℕ∖ { 0} since the recurrence relation demonstrated
1 1

above is only for n≥2 and this is the case for n=1. We have in this expression p1 can be any natural
number with: p1≥1.
n
2
n n
2
n n 2
+1 ∑ pi ∑ pi
-The fourth form is: 3 2
×x n+ 3 =2 2 i=0
−∑ (3 j−1×2 i= j
) where n can be any even natural number
j=1
with n≥2 and the numbers pi can be any natural numbers which respect that pi≥1 ∀ i∈ℕ∖ { 0}
and respect that: p0=2×M where M can be any strictly positive natural number.
n+1
2
n+1 n +1
2
n +1 2
∑ pi ∑ pi
−∑ (3
2 j−1
-The fifth form is: 3 ×x n=2 i=0
×2 i= j
) where n can be any odd natural number with
j=1
n≥2 and the numbers pi can be any natural numbers which respect that pi≥1 ∀ i∈ℕ∖ { 0} and
respect that: p0=2×M where M can be any strictly positive natural number.

We also concluded that we can prove that the Collatz conjecture is always true if we prove that all the
natural numbers can be expressed in these five forms demonstrated above only. We proposed that the
artificial intelligence and many mathematics software can simplify this task of proving that all the
natural numbers can be expressed in these five forms demonstrated above only. However, we could
simplify this task in this article without any informatics.

2. The proof that the first form of the numbers which respect the Collatz
conjecture is included in the fifth form:

Let’s consider that n is an odd natural number with n>2 and that M is a strictly positive natural number.

n +1 n+1 n+ 1 n+ 1
−1 −1 −1
We have: 3 2 M
×2 =3 2
×3×2 =3 M 2
×(2+1)×2 =3 M 2
×(2 M +1 +2 M ) (1)

n +1 n+1 n+1
−1 −1
Hence, we have: 3 2
×2M =3 2
×(2 M +1 +2M +1−2 M )=3 2
×(2M +2−2 M ) (2)

n +1 n+1 n+1
−1 −1
Consequently: 3 2
×2M =3 2
×2 M +2 −3 2
×2 M (3)

n +1
−1
We repeat the same method for 3 2
×2M +2 (4)

n +1 n +1 n+1
−1 −2 −2
2 M +2 2 M +4 2 M +2
Hence, we get: 3 ×2 =3 ×2 −3 ×2 (5)

n +1 n+1 n+1 n +1
−2 −2 −1
M M+ 4 M +2
Consequently, we have: 3 2
×2 =3 2
×2 −3 2
×2 −3 2
×2M (6)

n +1
−2
We repeat the same method for 3 2
×2M +4 (7)
 n +1 n+1 n+1
−2 −3 −3
M +4 M +6
Hence, we get: 3 2
×2 =3 2
×2 −3 2
×2M + 4 (8)

Consequently, we have:

n +1 n+1 n +1 n+1 n+1

−3 −3 −2 −1
M M+ 6 M +4 M +2
3 2
×2 =3 2
×2 −3 2
×2 −3 2
×2 −3 2
×2 M (9)

And thus we can guess the following recurrence relation:

n+1
n +1 2 n +1
−i
−∑ 3
2 M M +n+1 2 M +2×(i−1)
3 ×2 =2 ×2 (10)
i=1

Let’s prove this recurrence relation:

n +1
For n=3 we have: 3 2
×2M =9×2M (11)

n+1
2 n +1
−i
And also for n=3 we have: 2 M +n +1
−∑ 3 2
×2 M +2×(i−1)=2M + 4−3×2 M −2M +2=2 M ×(24−3−22 ) (12)
i=1

n+1
2 n +1
−i
−∑ 3
M +n +1 2 M +2×(i−1) M
Hence, we have: 2 ×2 =9×2 (13)
i=1

n+1
n +1 2 n +1
−i
And thus, for n=3 we respected that: 3 2
×2 =2M M +n+1
−∑ 3 2
×2M +2×(i−1) . (14)
i=1

Now let’s consider that this recurrence relation is correct until the number n and let’s prove it correct
for n+2 since n can only be an odd number.

n +3 n+ 1 n+1
+1
M M
We have: 3 2
×2 =3 2
×2 =3×3 2
×2 M (15)

n+1 n+1
2 n+1 2 n +3
−i −i
Consequently: 3×(2 M +n +1−∑ 3 2
×2
M +2×(i−1)
)=3×2
M +n+1
−∑ 3 2
×2
M +2×(i−1)
(16)
i=1 i=1

And we have: 3×2M +n+1=2 M + n+2 +2M +n+1 =2M +n+3−2M +n+1 (17)

n+1 n+1
2 n+1 2 n +3
−i −i
And thus, we have: 3×(2 M +n +1−∑ 3 2
×2 M +2×(i−1) )=2 M +n +3−2 M +n +1−∑ 3 2
×2 M +2×(i−1) (18)
i=1 i=1
 n+1 n+3
2 n+1 2 n+3
−i −i
−∑ 3 −∑ 3
M +n +1 2 M +2×(i−1) M +n +3 2 M +2×(i−1 )
And this is equivalent to: 3×(2 ×2 )=2 ×2 (19)
i=1 i=1

n+3
n +3 2 n+3
−i
Hence, we proved that: 3 2
×2 M =2M +n+3 −∑ 3 2
×2 M +2×(i−1) (20)
i=1

And this means that our recurrence relation is correct also for n+2.

n+1
n +1 2 n +1
−i
−∑ 3
2 M M +n+1 2 M +2×(i−1)
We conclude that the recurrence relation 3 ×2 =2 ×2 is correct for any
i=1

odd natural number n with n>2 and for any strictly positive natural number M.

n+1
Also, by substituting −i with j-1 in the series of our recurrence relation, we get:
2

n+1
n +1 2
−∑ 3
2 M M +n+1 j−1 M +n+1−2× j
3 ×2 =2 ×2 . (21)
j =1

We remark that this equation can be equivalent to the fifth form of the numbers which respect the
n+1
2
n+1 n +1
2
n +1 2
∑ pi ∑ pi
Collatz conjecture and which have this form: 3 2
×x n=2 i=0
−∑ (3 j−1 ×2 i= j
) . (22)
j=1

n+1
2

∑ pi
And in this case, we have this equation: 2 M +n +1=2 i=0
(23)
n+ 1
2

∑ pi n+1
and we have also this equation: 2 M +n +1−2× j=2 i=j
for any natural number j with: 1≤ j≤ . (24)
2

However, in this case, we should respect the fact that the numbers pi can only be natural numbers
which respect that pi≥1 ∀ i∈ℕ∖ { 0} and respect that: p0=2×N 0 where N0 can be any strictly
positive natural number.

n +1
2
n+1
Hence, since we should have: pi≥1 ∀ i∈ℕ∖ { 0} , then we should have: ∑ p i≥ − j+1 (25)
i= j 2
n+ 1
2
n+ 1
∑ pi − j+1 n+1
2
And this means that we should have: 2 i=j
≥2 for any natural number j with: 1≤ j≤ (26)
2
 n +1
M +n +1−2× j 2
− j+1 n+1
Hence, we should have 2 ≥2 for any natural number j with: 1≤ j≤ . (27)
2

n+1 n+1
We have: M +n+1−2× j−( − j+1)=M + −1− j (28)
2 2

n+1
And for any natural number j with: 1≤ j≤ , (29)
2

n+1
we have: M + −1− j≥M −1≥0 since M>0. (30)
2

n +1
− j+1
M +n +1−2× j 2
Consequently, we have always: 2 ≥2 , (31)

n+1
and this means that we respect indeed that for any natural number j with: 1≤ j≤ , we have:
2
n+ 1
2
n+ 1
∑ pi − j+1
2
2 i=j
≥2 (32)

n+1
2
We can remark also that for j=1 we have: p0=M + n+ 1−∑ pi =M + n+1−(M + n+1−2× j)=2 (33)
i=j

Consequently we respected also that p0 is an even number.

n+ 1
We can remark also that for j= we have: p n+ 1 =M + n+1−2× j=M (34)
2 2

Finally, we conclude that all the natural numbers which respect the first form of the numbers which
respect the Collatz conjecture and which have this form: x n=2 M ∀ M ∈ℕ∖ {0 } respect also the fifth
n+1
2
n+1 n +1
2
n +1 2
∑ pi ∑ pi
−∑ (3
2 j−1
form which is: 3 ×x n=2 i=0
×2 i= j
) .
j=1

2N
2 −1
However, this result doesn’t mean that x n=2 M should be transformed to the number x 0= of
3
the Collatz conjecture process after exactly n operations as explained in the previous article [10] since
we should only divide x n=2 M by a power of two in order to reach the number 1 of the Collatz
conjecture.
3. The proof that the second form of the numbers which respect the Collatz
conjecture is included in the fourth form:
n+1 n+ 1
2
n+ 1 n +1
2
n +1 2 2
∑ pi ∑ pi
−∑ 3 −∑ (3
2 M M +n+1 j−1 M +n+1−2× j j−1
We proved that: 3 ×2 =2 ×2 =2 i=0
×2 i=j
) (35)
j =1 j=1
Where: p n+ 1 =M and p0=2 and M can be any strictly positive natural number and n is an odd natural
2
number.

And thus, we have also:

n +1 n +1
2
n+1 n+ 1
2
n +1 2 2
∑ pi ∑ pi
−∑ 3 −∑ (3
2 2×M 2×M + n+1 j−1 2× M +n +1−2× j j−1
3 ×2 =2 ×2 =2 i=0
×2 i= j
) (36)
j=1 j=1
Where: p n+ 1 =2×M and p0=2 (37)
2

n +1 n+1 n+1 n +1 2× M n +1
2 2×M 2 2×M 2 2
+1 (2 −1) 2
And we know that: 3 ×2 =3 ×(2 −1)+3 =3 × +3 (38)
3
n+1
n +1 2× M n +1 2
+1 (2 −1)
Hence, we have: 3 2
× +3 2
=22×M +n+1 −∑ 3 j−1×22×M +n+1−2× j (39)
3 j=1

We have n+1 is an even number. Let’s consider that m=n+1 and we have m>3.
m
m 2× M m 2
+1 (2 −1)
−∑ 3
2 2 2×M + m j−1 2×M +m−2× j
We have: 3 × +3 =2 ×2 (40)
3 j=1

We remark that this equation can be equivalent to the fourth form of the numbers which respect the
m
2
m m
2
m m 2
+1 ∑ pi ∑ pi
Collatz conjecture and which have this form: 3 2
×x m +3 =2 2 i=0
−∑ (3 j−1×2 i= j
) (41)
j=1

m
2

∑ pi
And in this case, we have this equation: 22× M +m=2 i=0
(42)
m
2

∑ pi m
and we have also this equation: 22× M +m−2× j =2 i= j
for any natural number j with: 1≤ j≤ (43)
2

We have also: p m =2×M and p0=2 . (44)

2

m
Like the previous case, we should have for any natural number j with: 1≤ j≤ :
2
 m
− j +1
2× M +m−2× j 2
2 ≥2 (45)

m m
We have: 2×M +m−2× j−( − j+1)=2×M + −1− j (46)
2 2

m
And for any natural number j with: 1≤ j≤ ,
2

m
we have: 2×M + −1− j≥2×M −1≥0 since M>0. (47)
2

m
− j +1
2× M +m−2× j
Consequently, we have always: 2 ≥2 2 , (48)
m
2
m
∑ pi − j +1 m
2
and this means that we respect indeed that: 2 i=j
≥2 for any natural number j with: 1≤ j≤ .
2

Finally, we conclude that all the natural numbers which respect the second form of the numbers which
2×M
2 −1
respect the Collatz conjecture and which have this form: x m= ∀ M ∈ℕ∖ { 0} respect also the
3
m
2
m m
2
m m 2
+1 ∑ pi ∑ pi
−∑ (3
2 2 j−1
fourth form which is: 3 ×x m +3 =2 i=0
×2 i= j
) .
j=1

2×M
2 −1
However, this result doesn’t mean that x m= should be transformed to the number
3
2N
2 −1
x 0= of the Collatz conjecture process after exactly m operations as explained in the previous
3
2× M
2 −1
article [10] since we have already x m=x 0= without any operations related to the process of
3
the Collatz conjecture.

4. The proof that the third form of the numbers which respect the Collatz
conjecture is included in the fifth form:
m m
2
m m
2
m 2× M m 2 2
+1 (2 −1) ∑ pi ∑ pi
−∑ 3 −∑ (3
2 2 2×M + m j−1 2×M +m−2× j j−1
We proved that: 3 × +3 =2 ) (49) ×2 =2 i=0
×2 i=j

3 j=1 j=1
Where: p m =2×M and p0=2 and M can be any strictly positive natural number and m=n+1 is an even
2
natural number with m>3. Let’s consider that p is a strictly positive natural number.
 m
m 2× M m 2
+1 (2 −1)
−∑ 3
2× M +m 2× M +m −2× j
And thus, we have also: 2 p×(3 2
× 2
+3 )=2 ×(2
p j−1
×2 ) (50)
3 j=1
m
(22× M + p−2 p ) 2×M +m+ p m2
m 2
+1
Consequently, we have: 3 2
× =2 −3 ×2 p−∑ 3 j−1×22×M +m+ p −2× j (51)
3 j=1

m L+1
Let’s consider that: +1= ⇒ L=m+ 1=n+2 where L is an odd natural number with L>4. (52)
2 2
L+1
−1
(22×M + p−2 p ) 2×M +L+ p−1 L+1
L+1 2
−1
We get: 3 2
×
3
=2 −3 2 ×2 p− ∑ 3 j−1×22× M + L+ p−1−2× j (53)
j=1

Let’s consider that: p= p L+1 and since the number p is added to the powers of all the numbers
2
2× M + L+ p −1−2× j L+ 1
2 −1 , then we remark that this equation can
for any natural number j with: 1≤ j≤
2
be equivalent to the fifth form of the numbers which respect the Collatz conjecture and which have this
form:
L+ 1
2
L+1 L+ 1
2
L+1 2
∑ pi ∑ pi
− ∑ (3
2 j−1
3 ×x L =2 i=0
×2 i= j
) (54)
j=1
L+ 1
2

∑ pi
And in this case, we have this equation: 22× M + L+ p −1 =2 i=0
and we have also these equations:
L+ 1
2

∑ pi L+ 1 p L+1

22× M + L+ p −1−2× j=2 i=j

for any natural number j with: 1≤ j≤ −1 and 2 p=2 . 2
(55)
2

We can also remark in this case that: p0=2 and like the previous cases, we should have
L+1
2× M + L+ p −1−2× j
− j+1 L+ 1
2 ≥2 2 for any natural number j with: 1≤ j≤ −1 . (56)
2
L+1 L 1
We have: 2×M + L+ p−1−2× j−( − j+1)=2×M + + p−2− − j (57)
2 2 2

L+ 1
And for any natural number j with: 1≤ j≤ −1 , we have:
2

L 1
2×M + + p−2− − j≥2×M + p−2≥0 since M>0 and p>0. (58)
2 2

L+1
− j+1
2× M + L+ p −1−2× j 2
Consequently, we have always: 2 ≥2 , and since we have p>0 then this means that
L+ 1
2
L+1
∑ pi − j +1 L+ 1
2
we respect indeed that: 2 i= j
≥2 for any natural number j with: 1≤ j≤ . (59)
2
Finally, we conclude that all the natural numbers which respect the third form of the numbers which
respect the Collatz conjecture and which have this form: 3×x L =22×M + p−2 p ∀ M ∈ℕ∖ { 0 } with
L+ 1
2
L+1 L+ 1
2
L+1 2
∑ pi ∑ pi
− ∑ (3
2 j−1
p>0 respect also the fifth form which is: 3 ×x L =2 i=0
×2 i= j
) .
j=1

2×M + p p
2 −2
However, this result doesn’t mean that x L = should be transformed to the number
3
2N
2 −1
x 0= of the Collatz conjecture process after exactly L operations as explained in the previous
3
2N
2 −1
article [10] since only one operation of division by 2 p transforms x L to x 0= in the process of
3
the Collatz conjecture.

5. Proving simple arithmetic statements which are equivalent to the proof

of the Collatz conjecture:

We could prove that all the strictly positive natural numbers which respect the Collatz conjecture can
all be expressed with only the following two simplified forms which are:
N N
N
∑ pi ∑ pi
-The first final form: 3 N +1 N
×x 2 N +3 =2 i=0
−∑ (3 j−1
×2 i=j
) (60)
j=1
with N is a natural number with N>0.
M M
M
∑ pi ∑ pi
M
-And the second final form: 3 ×x 2 M −1=2 i=0
−∑ (3 j−1
×2 i= j
) (61)
j=1
with M is a natural number with M>2.

Where the numbers x 2 N and the numbers x 2 M −1 are all the natural numbers which respect the Collatz
conjecture and the numbers pi can be any natural numbers which respect that pi≥1 ∀ i∈ℕ∖ { 0}
and respect that: p0=2× A where A can be any strictly positive natural number.

And we know that in order to prove the Collatz conjecture we should only prove that each strictly
positive natural number can be expressed with one of these two simplified final forms. However, we
can remark in the first final form that x 2 N should be an odd natural number, whereas we can remark in
the second final form that x 2 M −1 should be an even natural number. And thus, in order to prove the
Collatz conjecture we should only prove that each strictly positive odd natural number can be
expressed with the first final form and that each strictly positive even natural number can be expressed
with the second final form.

We can remark that if x is a strictly positive even natural number with x≠2 M then x=2 p ×x c
where x c is a strictly positive odd natural number and p is a strictly positive natural number. And if
x c can be expressed with the first final form, then we have:
 N N
N
∑ pi ∑ pi
−∑ (3
p N +1 N p j−1
2 ×(3 ×x c +3 )=2 ×(2 i=0
×2 i= j
)) (62)
j=1
N N
N
∑ pi ∑ pi
And this means that: 3 N +1×x=2 p×(2 i=0
−∑ (3 j−1×2 i= j
))−3 N ×2 p (63)
j=1

N +1 N +1 N +1 N +1
N N +1
∑ pi ∑ pi ∑ pi ∑ pi
−∑ (3 − ∑ (3
N +1 j−1 N p j−1
And this is equivalent to: 3 ×x=2 i=0
×2 i= j
)−3 ×2 =2 i=0
×2 i= j
) (64)
j=1 j=1
Where: p N+1 =p . (65)

And since we proved that all the numbers of the form x n=2 M ∀ M ∈ℕ∖ {0 } can be expressed with
the second final form, then we conclude finally that, in order to prove the Collatz conjecture, we should
only prove that each strictly positive odd natural number can be expressed with the first final form
N N
N
∑ pi ∑ pi
which is: 3 N +1 N
×x 2 N +3 =2 i=0
−∑ (3 j−1
×2 i=j
) with N is a natural number with N>0.
j=1
Where x 2 N is the studied strictly positive odd natural number and the numbers pi can be any natural
numbers which respect that pi≥1 ∀ i∈ℕ∖ { 0} and respect that: p0=2× A where A can be any
strictly positive natural number.

6. Annex: An infinite set of odd numbers respecting the first final form of
the numbers of the Collatz conjecture:

Many may think that it is complicated to express any odd natural number with the first final form
demonstrated in this article without the help of artificial intelligence or other mathematics software.
However, we should know that there are many sequences and series of natural numbers which are
equivalent to the set of the odd natural numbers and which can simplify this task. Furthermore, we can
find many arithmetic developments of natural numbers which are easy recurrence relations. Hence,
let’s give this example of recurrence relations which develops a natural number into a series:

Lets’ consider a strictly positive natural number N. We will try to study the number 4 N in order to
deduce a useful result.
For N=1, we have: 4 1=3×4 0 +1 (66)
2 1 0
For N=2, we have: 4 =3×4 + 3×4 +1 (67)
3 2 1 0
For N=3, we have: 4 =3×4 +3×4 +3×4 +1 (68)
N −1
We can guess the recurrence relation: 4 =1+3× ∑ 4 i . N
(69)
i=0

Now let’s consider that this recurrence relation is correct until the number N and let’s prove it correct
for N+1.

N −1 N N N
We have: 4 N+1
=4×4 =4+3× ∑ 4 =4+3×∑ 4 =4−3+3×∑ 4 =1+3×∑ 4 i
N i+1 i i
(70)
i=0 i=1 i=0 i=0
 N
4 N +1−1
And thus, we conclude that: = ∑ 4i (71)
3 i=0

N −1
And this means that our recurrence relation 4 N =1+3× ∑ 4 i is correct for any strictly positive natural
i=0
number N.
This recurrence relation is an example that develops a number into a sum of other numbers and it can
N−1
be expressed also from the formula of the identity: A N −1=( A−1)× ∑ Ai . However, let’s use it in
i=0
the following proof.

2B
2 −1
Let’s consider that y B = where B is a strictly positive natural number. We have y B is a natural
3
2B
2 −1 N N 2 B
number satisfying the following formula: 3 N +1× y B +3 N =3 N+1 × +3 =3 ×2 (72)
3
where N is a natural number with N≥1 .
n+1
n +1 2
−∑ 3
2 M M +n+1 j−1 M +n+1−2× j
And we proved above that: 3 ×2 =2 ×2 (73)
j =1
where n is an odd natural number with n>2 and M is a strictly positive natural number.
N
And thus, we have: 3 N +1× y B +3 N =22 B +2 N −∑ 3 j−1 ×22 B+ 2 N−2× j (74)
j=1
where B and N are strictly positive natural numbers.

B−1
2B B
2 −1 4 −1 4 B−1
And we have: y B = = whereas we proved above that: = ∑ 4i (75)
3 3 3 i=0

B −1
And thus, the infinite set of odd numbers which are y B =∑ 4i where B can be any strictly positive
i=0
natural number can all be expressed with the first final form which is:
N N
N
∑ pi ∑ pi
3 N +1 N
×x 2 N +3 =2i=0
−∑ (3 j−1
×2 i=j
) (76)
j=1
B−1
where x 2 N = y B =∑ 4i and N is a strictly positive natural number by remarking that:
i=0
N

∑ pi =2 B+2 N where p0=2. (77)

i=0

This demonstrated infinite set of odd numbers may serve as a basis in order to help the readers to prove
that all the other odd natural numbers x 2 N can be expressed with the first final form which is:
N N
N
∑ pi ∑ pi
3 N +1×x 2 N +3 N =2 i=0
−∑ (3 j−1×2 i=j
) .
j=1
Corollary:
We will propose in this corollary a method to find an infinite amount of numbers which respect the
Collatz conjecture by using the result above.
B −1
Let’s consider that y C =C + ∑ 4 i where C is a strictly positive natural number and B can be any strictly
i=0
positive natural number.
N
We have consequently: 3 N +1× y C +3 N =3 N +1×C+ 22 B+ 2 N −∑ 3 j−1×2 2 B+2 N−2× j (77)
j=1
Let’s consider that the new number y C respects the Collatz conjecture by respecting the first final
N
form with: 3 N +1× y C +3 N =22 B +2 N +2 D−∑ 3 j−1×22 B +2 N −2× j (78)
j=1
where D is a strictly positive natural number.
N
We have in this case: ∑ pi =2 B+2 N +2 D where p0=2+ 2 D . (79)
i=0
2 B +2 N +2 D
N +1 2 B+2 N
And we have: 2 =3 ×C+2 (80)
2 B +2 N D N +1
And thus, we have: 2 ×( 4 −1)=3 ×C (81)
2 B+ 2 N
Let’s consider that: C=E×2 where E is a natural number. (82)
Hence we get this equation: 4 D=3 N +1×E+1 . (83)
Now let’s try to find example of values for the natural numbers N and E and D which respect this
equation. We can guess this example of values: N=1 and E=7 and D=3. (84)
2 B+ 2 N 2 B+2 B
In this case, we have: C=E×2 =7×2 =28×4 (85)
Now let’s verify if the new number y C really respects the first final form of the Collatz conjecture
B −1 B −1
where we have: y C =C + ∑ 4 =28×4 + ∑ 4i . i B
(86)
i=0 i=0
B−1
We have: 3 N +1
× y C +3 =3 ×(C + ∑ 4i )+3=3 2×C+3×(4 B−1)+3=255×4 B
N 2
(87)
i=0
N
And we have: 2 2 B +2 N +2 D
−∑ 3 j−1×22 B +2 N −2× j=28 ×4 B−4 B=255×4B (88)
j=1

B−1
And thus, we conclude that the set of all the numbers y C =28×4B + ∑ 4i where B can be any strictly
i=0
positive natural number respect the Collatz conjecture by respecting the first final form with:
N
3 N +1× y C +3 N =22 B +2 N +2 D−∑ 3 j−1×22 B +2 N −2× j where N=1 and D=3.
j=1

The readers may find other examples of values for N and E and D in order to conclude other examples
of sets of new numbers which respect the Collatz conjecture. However, we should remind that not all
N
the odd numbers should respect this formula: 3 N +1× y C +3 N =22 B +2 N +2 D−∑ 3 j−1×22 B +2 N −2× j because
j=1
N
in the first final form of the Collatz conjecture, we may have: ∑ pi ≠2 B+2 N−2× j . (89)
i= j
6. Summary and conclusion:

We started this work by proving thanks to a recurrence relation that all the natural numbers which
respect the first form of the numbers which respect the Collatz conjecture and which have this form:
n+1
2
n+1 n +1
2
n +1 2
∑ pi ∑ pi
−∑ (3
M 2 j−1
x n=2 ∀ M ∈ℕ∖ {0 } respect also the fifth form which is: 3 ×x n=2 i=0
×2 i= j
) .
j=1

We deduced then that all the natural numbers which respect the second form of the numbers which
2×M
2 −1
respect the Collatz conjecture and which have this form: x m= ∀ M ∈ℕ∖ { 0} respect also the
3
m
2
m m
2
m m 2
+1 ∑ pi ∑ pi
−∑ (3
2 2 j−1
fourth form which is: 3 ×x m +3 =2 i=0
×2 i= j
) . We deduced also that all the natural
j=1
numbers which respect the third form of the numbers which respect the Collatz conjecture and which
have this form: 3×x L =22×M + p−2 p ∀ M ∈ℕ∖ { 0 } with p>0 respect also the fifth form which is:
L+ 1
2
L+1 L+ 1
2
L+1 2
∑ pi ∑ pi
3 2
×x L =2 i=0
− ∑ (3 j−1×2 i= j
) .
j=1

We concluded that the proof of the Collatz conjecture is equivalent to proving that each strictly positive
odd natural number can be expressed with the first final form which is:
N N
N
∑ pi ∑ pi
−∑ (3
N +1 N j−1
3 ×x 2 N +3 =2 i=0
×2 i=j
) with N is a natural number with N>0.
j=1
and that each strictly positive even natural number can be expressed with the second final form which
M M
M
∑ pi ∑ pi
is: 3 M ×x 2 M −1=2 i=0
−∑ (3 j−1 ×2 i= j
) with M is a natural number with M>2.
j=1
Where the numbers x 2 N and the numbers x 2 M −1 are all the natural numbers which respect the Collatz
conjecture and the numbers pi can be any natural numbers which respect that pi≥1 ∀ i∈ℕ∖ { 0}
and respect that: p0=2× A where A can be any strictly positive natural number.

However, we finally concluded that, in order to prove the Collatz conjecture, we should only prove that
each strictly positive odd natural number can be expressed with the first final form which is:
N N
N
∑ pi ∑ pi
3 N +1×x 2 N +3 N =2 i=0
−∑ (3 j−1×2 i=j
) with N is a natural number with N>0.
j=1
Where x 2 N is the studied strictly positive odd natural number and the numbers pi can be any natural
numbers which respect that pi≥1 ∀ i∈ℕ∖ { 0} and respect that: p0=2× A where A can be any
strictly positive natural number.

We added also an annex to this article where we proved infinite set of odd numbers which respect the
B −1
Collatz conjecture. The first general set of numbers is: y B =∑ 4i where B can be any strictly positive
i=0
natural number.
And as a corollary, we proposed a method in order to deduce other related infinite set of numbers
respecting the Collatz conjecture by using specific values of the natural number N. The proposed set of
B−1
odd numbers which respect the Collatz conjecture is: y C =28×4 + ∑ 4i where B can be any strictly
B

i=0
positive natural number and N=1.

Declarations:
Ethical Approval:
this declaration is “not applicable”.

Competing interests:
this declaration is “not applicable”.

Authors' contributions:
this declaration is “not applicable”.

Funding:
this declaration is “not applicable”.

Availability of data and materials:

this declaration is “not applicable”.

References:
[1] Akram Louiz. A discussion of rationality and continuity related to Theta Functions by using the
summation of Poisson. Asia Mathematika, In press, ⟨10.5281/zenodo.10609879⟩. ⟨hal-04442443⟩
[2] Louiz, A. (2023). Mathematics Letter: A runner cheating thanks to Riemann. Maghrebian Journal
of Pure and Applied Science, 9(1).
[3] Louiz, A. (2020). A thesis about Newtonian mechanics rotations and about differential operators.
Maghrebian Journal of Pure and Applied Science, 6(1), 26-50.
[4] Louiz, A. The study of cases of fixed points of a complex function depending on the inputs of this
function.

[5] Akram Louiz. A new equation of four infinite series and sums by using a generalized recurrence
relation, 05 January 2023, PREPRINT (Version 4) available at Research Square
[https://doi.org/10.21203/rs.3.rs-2378268/v4]

[6] Andrei, Ş., & Masalagiu, C. (1998). About the Collatz conjecture. Acta Informatica, 35, 167-179.

[7] Ren, W. (2019). A new approach on proving Collatz conjecture. Journal of Mathematics, 2019.
 [8] Louiz, A. (2024). The new sequence and the parity in Collatz conjecture. PREPRINT available at
Researchgate [http://dx.doi.org/10.13140/RG.2.2.30495.53926].

[9] Louiz, A. (2024). The only five expressions of numbers which respect the Collatz
conjecture. PREPRINT available at Researchgate [http://dx.doi.org/10.13140/RG.2.2.21441.74085].

[10] Louiz, A. (2024). New recurrences of sequences and the only five forms of numbers which respect
the Collatz conjecture. PREPRINT available at Researchgate
[http://dx.doi.org/10.13140/RG.2.2.11182.89925].

View publication stats