This question already has an answer here:
- Collatz optimization 3 answers
By definition of
Collatz Conjecture or $3n+1$, regardless of the sequence (ie.$ m1,m2,m3....mn$), at the end, it eventually produces 1 at the end. For example, if you let $m=10$ (ie. $10, 5, 16, 8, 4, 2, 1, 4, 2, 1...$), you must repeat 6 times and eventually reach to 1.
How can Module
be used that takes positive integer $m$ and outputs the "number of times" that the procedure must be repeated until obtaining 1?
Side Note: Although the link does incorporate the Module function, It's not about longest [Collatz] chain.