On the solution of the Collatz problem

In this paper, we first prove that given a nonnegative integer $m$ and an odd number $t$ not divisible by $3$, there exists a unique Collatz’s Sequence $$S_c(m,t)=\{n_0(m,t),n_1(m,t),n_2(m,t),\dots ,n_m(m,t),n_{m+1}(m,t)\}$$ produced by a function $n_{i+1}(m,t)=(3n_i(m,t)+1)\mathrm{/}2$ for $i=0,1,2,\dots ,m$ and ended by an even number $n_{m+1}(m,t)$ where $n_i(m,t)=2^{m+1-i}\times 3^{i}t-1$ for $i=0,1,2,\dots ,m+1$, by which all odd numbers can be expressed. Then we discuss the Collatz problem in two ways and prove that each Collatz’s Sequence always returns to 1, i.e., the Collatz problem is solved.