Lower bounds for non-trivial Collatz Cycle have been established. This is done by studying the proportion of odd elements in a cycled Collatz sequence. The derivation goes as follow (I got this from Eliahou's paper):
Let $T: \mathbb{N} \rightarrow \mathbb{N}$ be the Collatz Map, $T(x) = \frac{3x+...
@Ѕᴀᴀᴅ You can raise a custom moderator flag and suggest that the questions are merged. It sounds reasonable to me. But what do you think is “fishy” with the answers to the older thread?
