Is the Half Collatz Conjecture (HCC) trivial, as currently stated?<p>The definition:
> H(n = 2k) = n and H(2k + 1) = 3k + 2<p>means that time to iterate H until its argument is even is exactly the length of the run of right-most 1 bits.<p>Collatz itself has the same property:<p>for some number that ends in ...11111, we can "accelerate" the process by directly calculating the odd branch 5 times directly.<p>I'm very interested in applying more advanced acceleration techniques to Collatz itself.