Start with a number n > 1. Find the number of steps it takes to reach one using the following process: If n is even, divide it by 2. If n is odd, multiply it by 3 and add 1.
si-mikey / collatz-conjecture Goto Github PK
View Code? Open in Web Editor NEWThis project forked from jeramyleon/collatz-conjecture