Two remarks on the Collatz cycle conjecture
Abstract
We give a short proof of Belaga's result on bounds to perigees of (3x+d)-cycles of a given oddlength. We also reformulate the Collatz cycle conjecture which is rather a algorithmic problem into a purely arithmetic problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.