On the Structure and the Behavior of Collatz 3n + 1 Sequences
Mike Winkler

TL;DR
This paper analyzes the structure of Collatz sequences, showing they consist of finite subsequences with specific properties, and proves that Collatz's conjecture holds if all sequences starting with certain residues have finite stopping times.
Contribution
It introduces a structured decomposition of Collatz sequences and proves the conjecture for sequences with specific residue classes, linking sequence behavior to Fibonacci numbers.
Findings
Sequences are composed of finite structured subsequences.
Collatz conjecture is true if sequences with certain residues have finite stopping times.
Almost all sequences with specific residues have finite stopping times, with statistical evidence supporting this.
Abstract
It is shown that every Collatz sequence consists only of same structured finite subsequences for or for . For starting numbers of specific residue classes () or () the finite subsequences have the same length . It is conjectured that for each the number of all admissible residue classes is given exactly by the Fibonacci sequence. This has been proved for . Collatz's conjecture is equivalent to the conjecture that for each , there exists such that . The least such that is called the stopping time of , which we will denote by . It is shown that Collatz's conjecture is true, if every starting number have finite stopping time. We denote…
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
