| Autor: |
Alf Kimms |
| Jazyk: |
angličtina |
| Rok vydání: |
2021 |
| Předmět: |
|
| Zdroj: |
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 1, Pp 157-174 (2021) |
| Druh dokumentu: |
article |
| ISSN: |
2338-2287 |
| DOI: |
10.5614/ejgta.2021.9.1.14 |
| Popis: |
Paul Erdös said about the 3x+1 problem, "Mathematics is not yet ready for such problems". And he is seemingly right. Although we cannot solve this problem either, we provide some results about its structure. The so-called Collatz graph is iteratively transformed into a sequence of graphs by making use of some hidden structure information. It turns out that the transformation of graphs corresponds to a sequence of sets of numbers. It is shown that if the union of these number sets were equal to the set of integers greater than one, the famous Collatz conjecture would be true. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
