This is a tiny program that simulates the collatz conjecture. Enter any integer greater than 1 and let the simulation run.
- Start with any integer n > 0.
- If even, divite n by two.
- If odd, multiply n by three and then add one.
- Repeat this process.
The interesting thing is that n will always end in the 4, 2, 1 cycle.