Solving the Collatz Conjecture, Using Gaussian Arithmetic

Emilio A. Diarte-Carot^1,2

¹The Official College of Telecommunications Engineers, Madrid, Spain.
²Independent Researcher, Majadahonda, Spain.

DOI: 10.4236/jamp.2025.135109                

Abstract

We prove that the Collatz, $3n+1$ , conjecture is true. To prove this statement, we will first see that, if a number $n$ starts a sequence that satisfies the Collatz conjecture then all sequences containing that number $n$ satisfy the conjecture. We will call these sequences Collatz trajectories. Then, we will study trajectories over equivalence classes defined by the congruences modulo 6, which were already discussed by Carl F. Gauss in 1798, and we will show that all Collatz trajectories contain some number belonging to the class ${\left[4\right]}_6$ . Finally, we will prove that all numbers belonging to class ${\left[4\right]}_6$ initiate trajectories that satisfy the conjecture. All this proves the first statement: The Collatz conjecture is true.

Keywords

Collatz Conjecture, Gaussian Arithmetic

1. Introduction

In 1937 the German mathematician Lothar Collatz considered, for the set of positive integers $N$ , the function $C:N\to N$ defined by

$C\left(k\right):=\{\begin{array}{ll}3k+1\hfill & \text{if}k\text{odd},\hfill \\ \frac{k}{2}\hfill & \text{if}k\text{even}.\hfill \end{array}$

Collatz conjectured that, for any starting point $k\in N$ , the sequence obtained by successive applications of the function $C$ would eventually arrive at 1 (so that the cycle 4, 2,1 is repeated indefinitely).

Numerical computation was used to prove that all numbers equal to or less than 2.95147⋅10²⁰ satisfy the Collatz conjecture; see [1]. The limits of the orbits have been studied in detail; see [2] [3].

A reduced conjecture, equivalent to the Collatz conjecture, has been proposed; see [4].

Finally, empirical-heuristic approaches to prove the conjecture have also been carried out using appropriate algorithms; see [5] and [6].

For a historical view of the study of the Collatz conjecture; see [7] and [8].

This approach to the Collatz conjecture is based on mathematics from the early nineteenth century. More specifically, we use the “number congruences in general” that were discussed by Carl F. Gauss already in 1798 and published in 1801, in chapter 1 of his Disquisitiones Arithmeticae [9].

The paper is organized as follows. In Section 2 we use residue classes modulo 6 to study the iterations of $C$ . Using these tools, in Section 3 we prove the Collatz conjecture.

Notation

1) $\mathbb{Z}$ : the set of integers.

2) $\mathbb{N}=\left\{k|k\in \mathbb{Z},k>0\right\}$ : the set of natural numbers.

3) ${\mathbb{N}}_0=\left\{k|k\in \mathbb{Z},k\ge 0\right\}$ : the set $\mathbb{N}$ including cero.

4) ${\left[k_r\right]}_6=\left\{n|n\equiv k_{r}mod.6,n\in \mathbb{N}\right\},0\le k_r<6$ , and also.

5) ${\left[k_r\right]}_6=\left\{n|n=6k+k_r,k\in {\mathbb{N}}_0\right\},0\le k_r<6$ .

2. Trajectories, Transitions, Loops and Modular Arithmetic

The problem in proving Collatz’ conjecture is that the number of trajectories is equal to the cardinality of $\mathbb{N}$ , which is infinite, $\left|\mathbb{N}\right|=\infty$ .

To analyze and solve the problem without losing generality and completeness, we will use the congruences of natural numbers, modulo 6.

In this section, let’s see the basic elements, trajectory, transition, and loop, as well as the concept and properties of the congruences that we will use in the proof.

For $k\in N$ , the Trajectory of $k$ is the sequence obtained by successively applying the function $C$ to $k$ . We will denote it by $T\left(k\right)$ . Hence,

$T\left(k\right):={\left\{C^n\left(k\right)\right\}}_{n=0}^{\infty },\text{where}{C}^n\left(k\right):=\{\begin{array}{ll}k\hfill & \text{if}n=0,\hfill \\ \stackrel{n\text{times}}{\overbrace{C\circ C\cdots \circ C}}\left(k\right)\hfill & \text{for}n\ge 1.\hfill \end{array}$

Then, $k\in N$ satisfies the Collatz conjecture whenever $1\in T\left(k\right)$ .

As an example of a trajectory, here is the trajectory that begins with number 72.

$T\left(72\right)=\left\{72,36,18,9,28,14,7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,\cdots \right\}$

The process is simple:

72 is even, so we divide by 2 to get 36; 36 is even, so we divide by 2 to get 18; 18 is even, so we divide by 2 to get 9; 9 is odd, so we multiply by 3 and add 1 to get 28; 28 is even, so we divide by 2 to get 14; 14 is even, then we divide by 2 to get 7; 7 is odd, then we multiply by 3 and add 1 to get 22, and so on.

As we can see, the trajectory is a sequence of numbers, apparently without any recognizable pattern, except that each number is followed by another, which is always the same, since the Collatz function is linear and that, by the definition of the function, every odd number is always followed by an even number.

However, if we use congruences of natural numbers, the view of the structure of the trajectory changes completely. Patterns appear, which will allow us to tackle and complete the proof of the conjecture.

So, we will now discuss congruences of natural numbers modulo 6, the concept and the properties that are relevant for the proof.

Remark 1. Congruences of natural numbers modulo 6:

1) General definition of congruences, modulo $k$ : $m$ is congruent to $r$ , modulo $k$ , ($m\equiv r$ ), if $m-r=kn$ , with $k,n\in \mathbb{N}$ .

2) The choice of $k=6$ meets the following three criteria:

a) Keep odd and even numbers in separate sets, as the definition of the conjecture does ($k=5$ does not).

b) Contain, as representatives of the residue classes, the numbers 4, 2, and 1, which form the final loop of the conjecture.

c) Facilitate the analysis necessary to find a set such that all trajectories contain at least one number belonging to that set. As we will see later, this will be one of the key points in proving the conjecture.

3) In the following points, we will use module 6. Thus, if we rewrite, $m-r=6n$ as $m=6n+r$ , with $n\in \mathbb{N}$ , we can restate the congruence of natural numbers modulo $6$ as follows: $m$ is congruent to $r$ , modulo 6, ($m\equiv r$ ), if $r$ is the remainder when $m$ is divided by 6.

4) An equality relation between remainders satisfies the reflexive, symmetric, and transitive properties, so, by definition, it is an equivalence relation.

5) The remainders of dividing any natural number by 6 are $\left\{0,1,2,3,4\text{and}5\right\}$ . These numbers will be the representatives of the equivalence classes, also called residue classes. See notation 4.

6) The residue classes are well defined by the arithmetic progressions of difference 6: ${\left[r\right]}_6=6k+r$ , with $k\in {\mathbb{N}}_0$ . See notation 5.

7) Since, this is an equivalence relation, the 6 residue classes form a partition of $\mathbb{N}$ which is exhaustive, i.e. every $n\in \mathbb{N}$ belongs to one of the classes. In other words, every natural number has a remainder when divided by 6, so, every natural number belongs to one of the residue classes.

8) The general terms of these progressions, whatever the value of $n$ and $r$ , are natural numbers and, therefore, the Collatz function can be applied. In this sense, we can say that this function is applicable to residue classes: $C\left(6k+r\right)=C\left({\left[r\right]}_6\right)$ . This allows us to define the transition between residue classes and describe a trajectory as a series of linked transitions.

A Transition, denoted by,

${\left[k_1\right]}_6\to {\left[k_2\right]}_6,0\le k_1,k_2<6,\cdots$

corresponds to the Collatz Function, which maps the residue class ${\left[k_1\right]}_6$ into the residue class ${\left[k_2\right]}_6$ , that is, if $n\in {\left[k_1\right]}_6$ then $C\left(n\right)\in {\left[k_2\right]}_6$ .

The evolution of the trajectory, $T\left(72\right)$ from the example above, as a sequence of transitions between residue classes, completely changes the view of the structure, since:

Dividing 72 by 6 we get remainder 0, so dividing 36 by 6 we get remainder 0, so dividing 18 by 6 we get remainder 0, so dividing 9 by 6 we get remainder 3, so dividing 28 by 6 we get remainder 4, so dividing 14 by 6 we get remainder 2, so dividing 7 by 6 we get remainder 1, so dividing 22 by 6 we get remainder 4, so dividing 11 by 6 we get remainder 5, so dividing 34 by 6 we get remainder 4, so dividing 17 by 6 we get remainder 5, so dividing 52 by 6 we get remainder 4, and so on.

Then,

$T\left(\text{72}\right)=\left\{0,0,0,\text{3},\text{4},\text{2},\text{1},\text{4},\text{5},\text{4},\text{5},\text{4},\text{2},\text{1},\text{4},\text{2},\text{4},\text{5},\text{4},\text{2},\text{4},\text{2},\text{1,}\cdots \right\}$

Now, we can see the following patterns:

a) The transitions of the even classes are: $0\to 0$ or $0\to 3$ ; $2\to 1$ or $2\to 4$ and $4\to 2$ or $4\to 5$ .

b) The transitions of the odd classes are: $1\to 4$ ; $3\to 4$ and $5\to 4$ .

In Section 3, we will generalize these results to all possible trajectories, and we will see that, in any trajectory, there are only a maximum of 9 types of transitions, which we have just seen in $T\left(72\right)$ . For this reason, it is important that we work with congruences, Module 6, since:

1) We can draw a directed graph of these transitions, and

2) We reduce the study of infinite trajectories to a continuous movement in that graph.

3) Furthermore, it is shown that all trajectories, regardless of where they start, eventually reach residue class 4.

A Loop, is a concatenation of transitions, which ends when the initial residue class reappears in the concatenation.

The directed graph in Section 3 shows four loops:

$0\to 0;4\to 2\to 4;4\to 2\to 1\to 4\text{and}4\to 5\to 4.$

Applying of proof by contradiction to loops $4\to 2\to 4$ and $4\to 2\to 1\to 4$ , and the principle of mathematical induction to loop $4\to 5\to 4$ ; we will complete the proof.

3. Proof of the Collatz Conjecture

Proposition 1. Let be $n\in T\left(k\right)$ , and let $T\left(n\right)$ be the trajectory starting from $n$ , if $T\left(n\right)$ satisfies the conjecture, then so does $T\left(k\right)$ .

Proof. By the definition of trajectory, if $n\in T\left(k\right)$ , $\exists i\in \mathbb{N}$ such that $C^i\left(k\right)=n$ and, from $n$ , it follows that $C^{i+1}\left(k\right)=C\left(n\right)$ and $C^{i+2}\left(k\right)=C^2\left(n\right)$ and $C^{i+3}\left(k\right)=C^3\left(n\right)$ and so on.

Then, from $n$ , $T\left(k\right)$ and $T\left(n\right)$ are equal. Thus, if $T\left(n\right)$ satisfies the conjecture, then $1\in T\left(n\right)$ and also $1\in T\left(k\right)$ . Therefore $T\left(k\right)$ also satisfies the conjecture. □

Remark 2. According to this proposition 1 the steps to prove the conjecture are as follows:

1) Find a set $S\subset N$ , well defined, such that all $T\left(k\right)$ contain some number $n\in S$ .

2) Prove that every $T\left(n\right)$ , with $n\in S$ , satisfies the Collatz conjecture.

If we get these points, proposition 1 will complete the proof of the conjecture.

Proposition 2. All trajectories $T\left(k\right)$ contain numbers $n$ belonging to the residue class ${\left[4\right]}_6$ , independent of the starting number, since the following holds.

1) ${\left[0\right]}_6\to {\left[0\right]}_6\cup {\left[3\right]}_6$ .

2) ${\left[1\right]}_6\to {\left[4\right]}_6$ .

3) ${\left[2\right]}_6\to {\left[1\right]}_6\cup {\left[4\right]}_6$ .

4) ${\left[3\right]}_6\to {\left[4\right]}_6$ .

5) ${\left[4\right]}_6\to {\left[2\right]}_6\cup {\left[5\right]}_6$ .

6) ${\left[5\right]}_6\to {\left[4\right]}_6$ .

Proof. According to notation 4, the residue classes, modulo 6, are as follows: ${\left[0\right]}_6,{\left[1\right]}_6,{\left[2\right]}_6,{\left[3\right]}_6,{\left[4\right]}_6,{\left[5\right]}_6$ .

Now we calculate the transition of each residue class by applying the Colaltz function to the corresponding general terms, see notation 5.

1) We have $C\left(6k\right)=6k/2=3k$ . Then, there are two alternatives:

a) $k$ is even, then $k=2k_1$ and so, $C\left(6k\right)=3\times 2k_1=6k_1\in {\left[0\right]}_6$ .

b) $k$ is odd, then $k=2k_1+1$ and so, $C\left(6k\right)=3\times \left(2k_1+1\right)=6k_1+3\in {\left[3\right]}_6$ .

2) We have $C\left(6k+1\right)=3\times \left(6k+1\right)+1=18k+4\in {\left[4\right]}_6$ .

3) We have $C\left(6k+2\right)=\left(6k+2\right)/2=3k+1$ . Then, there are two alternatives:

a) $k$ is even, then $k=2k_1$ and so, $C\left(6k+2\right)=3\times 2k_1+1=6k_1+1\in {\left[1\right]}_6$ .

b) $k$ is odd, then $k=2k_1+1$ and so $C\left(6k+2\right)=3\times \left(2k_1+1\right)+1=6k_1+4\in {\left[4\right]}_6$ .

4) We have $C\left(6k+3\right)=3\times \left(6k+3\right)+1=19k+4\in {\left[4\right]}_6$ .

5) We have $C\left(6k+4\right)=\left(6k+4\right)/2=3k+2$ Then, there are two alternatives:

a) $k$ is even, then $k=2k_1$ and so, $C\left(6k+4\right)=3\times 2k_1+2=6k_1+2\in {\left[2\right]}_6$ .

b) $k$ is odd, then $k=2k_1+1$ and so, $C\left(6k+4\right)=3\times \left(2k_1+1\right)+2=6k_1+5\in {\left[5\right]}_6$ .

6) We have $C\left(6k+5\right)=3\times \left(6k+5\right)+1=20k+4\in {\left[4\right]}_6$ .

These results can be plotted on an oriented graph.

Note that, the loop ${\left[0\right]}_6\to {\left[0\right]}_6$ is finite, since every $k\in {\left[0\right]}_6$ can be factored as $k=2^m\times 3^r\times \left(\text{odd number}\right)$ and is not repeated after $m$ repetitions.

So, all trajectories $T\left(k\right)$ contain numbers $n$ belonging to the residue class ${\left[4\right]}_6$ , independent of the starting number. □

In the following propositions 3 and 4 we will answer remark 2 (ii).

The oriented graph of proposition 2 also shows that, all $T\left(n\right)$ , where $n\in {\left[4\right]}_6$ , always start with one of the following sequences of terms,

either $n,\frac{n}{2},\frac{n}{4},\cdots$ or $n,\frac{n}{2},\frac{n}{4},3\frac{n}{4}+1,\cdots$ or $n,3n+1,\frac{3n+1}{2},\cdots$

corresponding to the loops,

either ${\left[4\right]}_6\to {\left[2\right]}_6\to {\left[4\right]}_6$ or ${\left[4\right]}_6\to {\left[2\right]}_6\to {\left[1\right]}_6\to {\left[4\right]}_6$ or ${\left[4\right]}_6\to {\left[5\right]}_6\to {\left[4\right]}_6$ .

Proposition 3. A trajectory $T\left(n\right)$ , where $n\in {\left[4\right]}_6$ , starting with loops either ${\left[4\right]}_6\to {\left[2\right]}_6\to {\left[4\right]}_6$ or ${\left[4\right]}_6\to {\left[2\right]}_6\to {\left[1\right]}_6\to {\left[4\right]}_6$ satisfies the Collatz conjecture.

Proof. Suppose, by way of contradiction, that $n$ is the smallest term, belonging to ${\left[4\right]}_6$ , that starts a trajectory, $T\left(n\right)$ , that does not satisfy the Collatz conjecture and, moreover, begins with the loop ${\left[4\right]}_6\to {\left[2\right]}_6\to {\left[4\right]}_6$ . That is, the sequence of terms

$n,\frac{n}{2},\frac{n}{4},\cdots$

and $n>4$ .

Note that under this assumption no term in $T\left(n\right)$ satisfies the Collatz conjecture. But,

$\frac{n}{4}\in {\left[4\right]}_6\text{and}\frac{n}{4}<n.$

However, this contradicts the assumption that $n$ is the smallest term that starts a trajectory $T\left(n\right)$ , which does not satisfy the Collatz conjecture. Therefore, $T\left(n\right)$ satisfies the Collatz Conjecture.

Consider a similar situation, $T\left(n\right)$ does not satisfy the Collatz conjecture but, now, starts with the loop ${\left[4\right]}_6\to {\left[2\right]}_6\to {\left[1\right]}_6\to {\left[4\right]}_6$ . That is, it starts with the sequence of terms

$n,\frac{n}{2},\frac{n}{4},3\frac{n}{4}+1,\cdots$

and $n>4$ .

Then,

$3\frac{n}{4}+1\in {\left[4\right]}_6\text{and}3\frac{n}{4}+1<n.$

This also contradicts the assumption of $n$ is the smallest term that starts a trajectory $T\left(n\right)$ , which does not satisfy the Collatz conjecture. Therefore, $T\left(n\right)$ satisfies the Collatz Conjecture. □

Corollary 1. A trajectory containing terms from the residue class ${\left[2\right]}_6$ satisfies the Collatz conjecture.

Proof. Numbers in the residue class ${\left[2\right]}_6$ are necessarily and exclusively part of the loops either ${\left[4\right]}_6\to {\left[2\right]}_6\to {\left[1\right]}_6\to {\left[4\right]}_6$ or ${\left[4\right]}_6\to {\left[2\right]}_6\to {\left[4\right]}_6$ , and any trajectory which contains any of these loops and, thus numbers of class ${\left[2\right]}_6$ , satisfies the Collatz conjecture by Proposition 3. □

We now consider $T\left(n\right)$ , where $n\in {\left[4\right]}_6$ , stating with the loop ${\left[4\right]}_6\to {\left[5\right]}_6\to {\left[4\right]}_6$ .

Proposition 4. A trajectory $T\left(n\right)$ , where $n\in {\left[4\right]}_6$ , starting with the loop ${\left[4\right]}_6\to {\left[5\right]}_6\to {\left[4\right]}_6$ cannot repeat it an infinite number of times in a row and, therefore, it satisfies the Conjecture.

Proof. Consider a trajectory of the form $T\left(n_1\right)=\left\{n_1,m_1,n_2,m_2,\cdots \right\}$ , for $n_i\in {\left[4\right]}_6$ and $m_i\in {\left[5\right]}_6$ , for all $i\ge 1$ .

Then, we take the first three elements of the trajectory $T\left(n_1\right)$

$\left(n_1,m_1,n_2\right)=\left(6k_0+4,\frac{6k_0+4}{2},3\frac{6k_0+4}{2}+1\right)=\left(6k_0+4,6k_1+5,6\left(3k_1+2\right)+4\right),$

for $k_0=2k_1+1$ .

The second three elements of the trajectory $T\left(n_1\right)$

$\left(n_2,m_2,n_3\right)=\left(6\left(3k_1+2\right)+4,6\left(3k_2+2\right)+5,6\left(3^2{k}_2+8\right)+4\right),$

for $k_1=2k_2+1$ ; $k_0=2\left(2k_2+1\right)+1=2^2{k}_2+2+1$ .

The third three elements of the trajectory $T\left(n_1\right)$

$\left(n_3,m_3,n_4\right)=\left(6\left(3^2{k}_2+8\right)+4,6\left(3^2{k}_3+8\right)+5,6\left(3^3{k}_3+26\right)+4\right),$

for $k_2=2k_3+1$ ; $k_0=2^2\left(2k_3+1\right)+3=2^3{k}_3+2^2+2+1$ .

In the general case, we have

$\left(n_i,m_i,n_{i+1}\right)=\left(6\left(3^{i-1}{k}_{i-1}+3^{i-1}-1\right)+4,6\left(3^{i-1}{k}_i+3^{i-1}-1\right)+5,6\left(3^i{k}_i+3^i-1\right)+4\right),$

for $k_{i-1}=2k_i+1$ and $k_0=2^i{k}_i+{\displaystyle \sum }_{s=0}^{i-1}{2}^s=2^i\left(k_i+1\right)-1$ .

Since, .

The induction is completed by applying the Collatz function to $\left(n_i,m_i,n_{i+1}\right)$ to compute $\left(n_{i+1},m_{i+1},n_{i+2}\right)$ , thus we get the following result, which corresponds to the general formula:

$\left(n_{i+1},m_{i+1},n_{i+2}\right)=\left(6\left(3^i{k}_i+3^i-1\right)+4,6\left(3^i{k}_{i+1}+3^i-1\right)+5,6\left(3^{i+1}{k}_{i+1}+3^{i+1}-1\right)+4\right),$

for $k_i=2k_{i+1}+1$ and $k_0=2^{i+1}\left(k_{i+1}+1\right)-1$ .

These above computations establish that, if $i\to \infty$ , then there is no possible choice for $k_0\in \mathbb{N}$ . So, $n_1=6k_0\notin \mathbb{N}$ .

Anyway, $\left(k_0,k_1,k_2,\cdots ,k_i,\cdots ,1\right)$ is a strictly decreasing sequence of odd natural numbers with a minimum at 1, therefore, if $k_0\in \mathbb{N}$ , then it is a finite sequence and loop ${\left[4\right]}_6\to {\left[5\right]}_6\to {\left[4\right]}_6$ stops.

When the loop stops, instead of repeating the class ${\left[5\right]}_6$ , an element of the class ${\left[2\right]}_6$ appears and, by Corollary 1, $T\left(n\right)$ satisfies the Conjecture. □

Theorem 1. The Collatz conjecture is true.

Proof. Let $k\in \mathbb{N}$ and consider $T\left(k\right)$ .

Proposition 1 shows that if $n\in T\left(k\right)$ and $T\left(n\right)$ satisfies the conjecture so does $T\left(k\right)$ .

Proposition 2 shows that, all trajectories $T\left(k\right)$ contain numbers $n\in {\left[4\right]}_6$ .

Proposition 3 shows that, $T\left(n\right)$ , starting with either loop ${\left[4\right]}_6\to {\left[2\right]}_6\to {\left[4\right]}_6$ or ${\left[4\right]}_6\to {\left[2\right]}_6\to {\left[1\right]}_6\to {\left[4\right]}_6$ satisfies the Collatz conjecture. Then $T\left(k\right)$ also satisfies it as well.

Proposition 4 shows that a trajectory $T\left(n\right)$ , starting with loop ${\left[4\right]}_6\to {\left[5\right]}_6\to {\left[4\right]}_6$ , cannot repeat it an infinite number of times in a row and satisfies the Conjecture.

To summarize: By Propositions 3 and 4 all trajectories $T\left(n\right)$ , beginning with numbers $n\in {\left[4\right]}_6$ satisfy the Collatz conjecture and Propositions 2 and 1 extend this result to all trajectories $T\left(k\right)$ , then the Collatz conjecture is true. □

Acknowledgements

First, I thank God. He has given me a family that always supports my little occurrences like this paper. My wife, Marisa; my son Emilio, who has reviewed this article, and my daughter Pilar; their respective spouses, Michelle and Carlos; my grandson Gabriel, Carlos, Pablo and Pilar.

A very special thank you to Ramón Carbó-Dorca, Institute of Computational Chemistry and Catalysis, Universitat de Girona, Girona, Spain and Ronin Institute for Independent Research/Sacramento, California, USA, for their reviews and valuable comments on this paper.

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1]	Barina, D. (2020) Convergence Verification of the Collatz Problem. The Journal of Supercomputing, 77, 2681-2688. https://doi.org/10.1007/s11227-020-03368-x
[2]	Krasikov, I. and Lagarias, J.C. (2003) Bounds for the 3x + 1 Problem Using Difference Inequalities. Acta Arithmetica, 109, 237-258. https://doi.org/10.4064/aa109-3-4
[3]	Tao, T. (2022) Almost All Orbits of the Collatz Map Attain Almost Bounded Values. Forum of Mathematics, Pi, 10, e12. https://doi.org/10.1017/fmp.2022.8
[4]	Ren, W. (2019) A New Approach on Proving Collatz Conjecture. Journal of Mathematics, 2019, Article ID: 6129836. https://doi.org/10.1155/2019/6129836
[5]	Carbó Dorca, R. (2020) Boolean Hypercubes, Mersenne Numbers, and the Collatz Conjecture. Journal of Mathematical Sciences and Modelling, 3, 120-129. https://doi.org/10.33187/jmsm.776898
[6]	Carbó-Dorca, R. (2023) Collatz Conjecture Redefinition on Prime Numbers. Journal of Applied Mathematics and Physics, 11, 147-157. https://doi.org/10.4236/jamp.2023.111011
[7]	Lagarias, J.C. (1985) The 3x + 1 Problem and Its Generalizations. The American Mathematical Monthly, 92, 3-23. https://doi.org/10.1080/00029890.1985.11971528
[8]	Chamberland, M. (2010) A Survey: Number Theory and Dynamical Systems. In: Lagarias, J.C., Ed., The Ultimate Challenge the Problem, American Mathematical Society, 57-78.
[9]	Gauss, C.F. (1965) Disquisitiones Arithmeticae. Yale University Press.