On the nonexistence of cycles for the Collatz function
Manfred Bork

TL;DR
This paper proves that the Collatz function has no cycles other than the well-known (4, 2, 1) cycle, supporting the conjecture that all sequences eventually reach this cycle.
Contribution
It establishes a proof that no other cycles exist for the Collatz function, advancing understanding of the conjecture's validity.
Findings
No additional cycles for the Collatz function exist
Supports the conjecture that all sequences reach (4, 2, 1)
Provides a theoretical proof for cycle nonexistence
Abstract
The Collatz function is defined as C(n) = n / 2 if n is even and C(n) = 3n + 1 if n is odd. The Collatz conjecture states that every sequence generated by the Collatz function ends with the cycle (4, 2, 1) after a finite number of iterations. In this paper it is shown that there exists no other cycle for the Collatz function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBenford’s Law and Fraud Detection · Computability, Logic, AI Algorithms · Digital Media Forensic Detection
