>>12700014I'm not convinced the k = 4 case works. The reason Collatz works for k = 2 is that if the number isn't divisible by 2, then the odd-function always returns a new number divisible by 2. So in this algorithm,
>Start with positive integer n>If n mod(3) = 0, divide by 3>If n mod(3) = 1, subtract 1 from n>If n mod(3) = 2, do 4n + 1if n mod(3) = 1, subtracting 1 ensures the next step is to divide by 3. Likewise, if n mod(3) = 2, then 4n + 1 ensures the next number is divisible by 3. If we want to generalize Collatz' Conjecture, then we must, at each iteration, return a number divisible by k.
