Theoretical and computational bounds for m-cycles of the 3n+1-problem

J.L. Simons, B.M.M. Weger, de

Research output: Contribution to journalArticleAcademicpeer-review

16 Citations (Scopus)


An m-cycle of the 3n+1-problem is defined as a periodic orbit with m local minima. In this article we derive lower and upper bounds for the cycle length and the elements of (hypothetical) m-cycles. In particular, we prove that there do not exist nontrivial m-cycles for 1 = m = 68. Our proofs are based on transcendental number theory, computational diophantine approximation techniques, and a not straightforward generalization of the approach of Steiner and Simons on 1-cycles and 2-cycles respectively.
Original languageEnglish
Pages (from-to)51-70
JournalActa Arithmetica
Issue number1
Publication statusPublished - 2005


Dive into the research topics of 'Theoretical and computational bounds for m-cycles of the 3n+1-problem'. Together they form a unique fingerprint.

Cite this