- 12 Nov 2004 19:53
#508331
1. Pick any positive integer n.
2. If n is even, divide it by two;
if it is odd, multiply it by three and add one.
3. If n = 1, stop;
else go back to step 2.
The conjecture says that this process always stops, no matter what the start value.
2. If n is even, divide it by two;
if it is odd, multiply it by three and add one.
3. If n = 1, stop;
else go back to step 2.
The conjecture says that this process always stops, no matter what the start value.