1. If the number is odd, multiply it by three and add one.
2. If it is even divide it by two.
2a. If the result is still even, continue to divide by two until the result is odd.
3. Continue steps 1 and 2 until you get the same number twice.

[For example starting with 9 -> 28 -> 14 -> 7 which is considered one iteration. The next iteration brings this to 11.]

What number(s) does this process terminate at?
What starting value less than 200 takes the most iterations to terminate?

It was a fairly easy to make computer program, but right now, I'm not on the computer that has the program. When I get on, I'll submit the source. Of course, it is C++, so you might have to make a few changes. Sorry, but I'm going to have to check my values, because, after about 700,000,000 3*x+1>2^31. In fact, after several modifications, I have found that numbers slightly larger than 113,000, will actually become negative. The 268,549,803 number is correct, but the program uses the double variable type, so it is very sssssllllllloooooooooooowwwwww.

As for the Circular fun problem, I can't understand why the solution hasn't been activated. I submitted it with the problem, and that was in July. So, I guess I'll go post it in the comments for the problem.