Welcome!


This page is dedicated to my work on the 3n+1 function, also known as the Collatz problem.



Texts (PDF)

On a stopping time algorithm of the 3n+1 function



The construction of the special tree structure (German)

The self-similarity of the special tree structure (German)

Examples (HTML)

Appendix A.   Complete list of sorted matrices Bn[u] for u = 4, …, 9

Appendix B.            A Delphi/PASCAL Code for the γk[u]-Algorithm

Appendix C.                                Table of γk[u] for u = 6, …, 30

Appendix D.                   Relationsships of γk[u] for u = 11, …, 53

Appendix E.         Simple list of Appendix C, γk[u] for u = 6, …, 77

Collatz Trees (PDF)

Special tree structure up to column S5

Special tree structure          up to 341

Contact This page was last modified in July 2011