On the Structure and the Behavior of Collatz 3n + 1 Sequences
Abstract
It is shown that every Collatz sequence C(s) consists only of same structured finite subsequences Ch(s) for s9\ (mod\ 12) or Ct(s) for s3,7\ (mod\ 12). For starting numbers of specific residue classes (mod\ 12·2h) or (mod\ 12·2t+1) the finite subsequences have the same length h,t. It is conjectured that for each h,t≥2 the number of all admissible residue classes is given exactly by the Fibonacci sequence. This has been proved for 2≤ h,t≤50. Collatz's conjecture is equivalent to the conjecture that for each s∈N,s>1, there exists k∈N such that Tk(s)<s. The least k∈N such that Tk(s)<s is called the stopping time of s, which we will denote by σ(s). It is shown that Collatz's conjecture is true, if every starting number s3,7\ (mod\ 12) have finite stopping time. We denote τ(s) as the number of Ct(s) until σ(s) is reached for a starting number s3,7\ (mod\ 12). Starting numbers of specific residue classes (mod\ 3·2σ(s)) have the same stopping times σ(s) and τ(s). By using τ(s) it is shown that almost all s3,7\ (mod\ 12) have finite stopping time and statistically two out of three s3,7\ (mod\ 12) have τ(s)=1. Further it is shown what consequences it entails, if a C(s) grows to infinity.
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.