My two accounts were merged earlier in June. So, maybe that is the reason.
Thanks Peter. If anyone is interested in commenting why my this question was closed and downvoted , they are most welcome. I want to improve my question. Most of math I learn is by self study only so this website is very important for me.
I'd like to show you this (Probably already known?) behaviour about the growth of the number of steps needed in the Collatz algorithm:
Let $S(n)$ be the function that calculates the number of steps needed for $n$ to reach $1$, and assume $S(n)$ is defined for every $n \in \mathbb{N}$ and no close...
