Howdy,
Not sure this will be entirely clear, but when considering the relationship between a start value n in the Collatz algorithm and the length of the sequence generated by n, is there a function f() such that f(n) = y >= length(Collatz(n))?
|
0
|
Howdy, Not sure this will be entirely clear, but when considering the relationship between a start value n in the Collatz algorithm and the length of the sequence generated by n, is there a function f() such that f(n) = y >= length(Collatz(n))? |
||||||
|
closed as not a real question by Ryan Budney, Qiaochu Yuan, Todd Trimble, gowers, Steve Huntsman Jun 12 2011 at 23:35 |
|
2
|
The existence of such a function is equivalent to the unproven statement that all n eventually settle into the $4, 2, 1$ cycle. Or do I misunderstand your question? |
|||
|