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?

I know that it will/should terminate at 1, but do I program it to go until the number equals the value from the previous iteration, or do I go until it equals 1?

Edited on January 19, 2006, 1:51 pm

Posted by Justin on 2006-01-19 13:49:01