300 Sozialwissenschaften
Refine
Has Fulltext
- yes (15) (remove)
Year of publication
- 2020 (15) (remove)
Document Type
- Doctoral Thesis (5)
- Postprint (4)
- Report (3)
- Article (1)
- Bachelor Thesis (1)
- Monograph/Edited Volume (1)
Is part of the Bibliography
- yes (15)
Keywords
- Cayley Graph (3)
- Free Group (3)
- Collatz (2)
- Reachability (2)
- Aid Effectiveness (1)
- Aufbau Ost (1)
- Berufliche Wiedereingliederung (1)
- Binary Tree (1)
- Brandenburg (1)
- Caribbean (1)
Institute
- Sozialwissenschaften (3)
- Wirtschaftswissenschaften (3)
- Fachgruppe Politik- & Verwaltungswissenschaft (2)
- Department Psychologie (1)
- Department Sport- und Gesundheitswissenschaften (1)
- Fachgruppe Soziologie (1)
- Institut für Anglistik und Amerikanistik (1)
- Institut für Umweltwissenschaften und Geographie (1)
- Philosophische Fakultät (1)
- Wirtschafts- und Sozialwissenschaftliche Fakultät (1)
It is well known that the inverted Collatz sequence can be represented as a graph or a tree. Similarly, it is acknowledged that in order to prove the Collatz conjecture, one must demonstrate that this tree covers all odd natural numbers. A structured reachability analysis is hitherto unavailable. This paper investigates the problem from a graph theory perspective. We define a tree that consists of nodes labeled with Collatz sequence numbers. This tree will be transformed into a sub-tree that only contains odd labeled nodes. Furthermore, we derive and prove several formulas that can be used to traverse the graph. The analysis covers the Collatz problem both in it’s original form 3x + 1 as well as in the generalized variant kx + 1. Finally, we transform the Collatz graph into a binary tree, following the approach of Kleinnijenhuis, which could form the basis for a comprehensive proof of the conjecture.