So I haven't posted in a while.
I have been so distracted by other things I simply just forgot
So where we left in the problem is proving that x_n = 3k+1 = 2^m somewhere in all sequences. I can do small starting numbers and show that it ends up at 1, but to prove it generally seems insurmountable.
I guess we know that if a number shows up in a previous sequence that contains a one we know that this new sequence also contains a one, because the sequence doesn't depend on the number before that.
I'm stumped. This explains why the problem remains unsolved for everybody.
Oh well. I enjoyed the course and hope that the exam will reflect how well I know the material.
So long.
