Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 85 tok/s Pro
Kimi K2 183 tok/s Pro
GPT OSS 120B 419 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

On the Structure and the Behavior of Collatz 3n + 1 Sequences (1412.0519v2)

Published 27 Nov 2014 in math.GM

Abstract: It is shown that every Collatz sequence $C(s)$ consists only of same structured finite subsequences $Ch(s)$ for $s\equiv9\ (mod\ 12)$ or $Ct(s)$ for $s\equiv3,7\ (mod\ 12)$. For starting numbers of specific residue classes ($mod\ 12\cdot2h$) or ($mod\ 12\cdot2{t+1}$) the finite subsequences have the same length $h,t$. It is conjectured that for each $h,t\geq2$ the number of all admissible residue classes is given exactly by the Fibonacci sequence. This has been proved for $2\leq h,t\leq50$. Collatz's conjecture is equivalent to the conjecture that for each $s\in\mathbb{N},s>1$, there exists $k\in\mathbb{N}$ such that $Tk(s)<s$. The least $k\in\mathbb{N}$ such that $Tk(s)<s$ is called the stopping time of $s$, which we will denote by $\sigma(s)$. It is shown that Collatz's conjecture is true, if every starting number $s\equiv3,7\ (mod\ 12)$ have finite stopping time. We denote $\tau(s)$ as the number of $Ct(s)$ until $\sigma(s)$ is reached for a starting number $s\equiv3,7\ (mod\ 12)$. Starting numbers of specific residue classes ($mod\ 3\cdot2{\sigma(s)}$) have the same stopping times $\sigma(s)$ and $\tau(s)$. By using $\tau(s)$ it is shown that almost all $s\equiv3,7\ (mod\ 12)$ have finite stopping time and statistically two out of three $s\equiv3,7\ (mod\ 12)$ have $\tau(s)=1$. Further it is shown what consequences it entails, if a $C(s)$ grows to infinity.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)