The Proof of the Collatz Conjecture
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912429003243520 |
|---|---|
| author | Wey, Chin-Long |
| author_facet | Wey, Chin-Long |
| contents | The 3n+1, or Collatz problem, is one of the hardest math problems, yet still unsolved. The Collatz conjecture is to prove or disprove that the Collatz sequences COL(n) always eventually reach the number of 1, for all n belongs to N+ (all positive integers). The Syracuse conjecture is a (2N+1)-version of Collatz conjecture, where (2N+1) is all odd integers. The Syracuse and Collatz problem can be conceptually described by a tree trunk and branches. The trunk is made of the junctions that produce the main branches, where J0=1 is the root junction. Each branch consists of active and dead junctions, where only the active junctions are capable of producing new sub-branches. Conceptually assuming the trunk and branches can grow indefinitely and can also absorb nutrients from the root. As the tree grows indefinitely, all N+ (2N+1) are included for the Collatz (Syracuse) sequence. This paper develops both inverse Collatz (Syracuse) functions to construct the tree trunk and branches starting from the root junction J0=1 and assign the also positive (odd) integers to all junctions. To verify the Collatz (Syracuse) sequences always eventually reach the number of 1, this paper also develops the PathFinding algorithm. Given n belongs to N+ (2N+1), the algorithm finds a path from n to the root junction J0=1 by the virtual tree structure to prove both Syracuse and Collatz conjectures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_09991 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | The Proof of the Collatz Conjecture Wey, Chin-Long General Mathematics The 3n+1, or Collatz problem, is one of the hardest math problems, yet still unsolved. The Collatz conjecture is to prove or disprove that the Collatz sequences COL(n) always eventually reach the number of 1, for all n belongs to N+ (all positive integers). The Syracuse conjecture is a (2N+1)-version of Collatz conjecture, where (2N+1) is all odd integers. The Syracuse and Collatz problem can be conceptually described by a tree trunk and branches. The trunk is made of the junctions that produce the main branches, where J0=1 is the root junction. Each branch consists of active and dead junctions, where only the active junctions are capable of producing new sub-branches. Conceptually assuming the trunk and branches can grow indefinitely and can also absorb nutrients from the root. As the tree grows indefinitely, all N+ (2N+1) are included for the Collatz (Syracuse) sequence. This paper develops both inverse Collatz (Syracuse) functions to construct the tree trunk and branches starting from the root junction J0=1 and assign the also positive (odd) integers to all junctions. To verify the Collatz (Syracuse) sequences always eventually reach the number of 1, this paper also develops the PathFinding algorithm. Given n belongs to N+ (2N+1), the algorithm finds a path from n to the root junction J0=1 by the virtual tree structure to prove both Syracuse and Collatz conjectures. |
| title | The Proof of the Collatz Conjecture |
| topic | General Mathematics |
| url | https://arxiv.org/abs/2309.09991 |