A simple program to demonstrate the conjecture. Enter a number and the program will run until the final number is a 1. If the list never hits 1 (and your number is a positive whole number), it means you have disproven the conjecture. But good luck getting that to happen.
If n%2 = 0, the next operation will be n/2 If n%2 = 1, the next operation will be 3n + 1
