On the solution of the Collatz problem
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2011
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914243528359936 |
|---|---|
| author | Tan, Shan-Guang |
| author_facet | Tan, Shan-Guang |
| contents | 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),\ldots,n_{m}(m,t),n_{m+1}(m,t)\} \] produced by a function $n_{i+1}(m,t)=(3n_{i}(m,t)+1)/2$ for $i=0,1,2,\ldots,m$ and ended by an even number $n_{m+1}(m,t)$ where $n_{i}(m,t)=2^{m+1-i}\times3^{i}t-1$ for $i=0,1,2,\ldots,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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1110_3465 |
| institution | arXiv |
| publishDate | 2011 |
| record_format | arxiv |
| spellingShingle | On the solution of the Collatz problem Tan, Shan-Guang General Mathematics 11A99 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),\ldots,n_{m}(m,t),n_{m+1}(m,t)\} \] produced by a function $n_{i+1}(m,t)=(3n_{i}(m,t)+1)/2$ for $i=0,1,2,\ldots,m$ and ended by an even number $n_{m+1}(m,t)$ where $n_{i}(m,t)=2^{m+1-i}\times3^{i}t-1$ for $i=0,1,2,\ldots,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. |
| title | On the solution of the Collatz problem |
| topic | General Mathematics 11A99 |
| url | https://arxiv.org/abs/1110.3465 |