Collatz Conjecture in Go
Calculate the number of steps to reach 1 using the Collatz conjecture
exercism fetch go collatz-conjecture
The Collatz Conjecture or 3x+1 problem can be summarized as follows:
Take any positive integer n. If n is even, divide n by 2 to get n / 2. If n is odd, multiply n by 3 and add 1 to get 3n + 1. Repeat the process indefinitely. The conjecture states that no matter which number you start with, you will always reach 1 eventually.
Given a number n, return the number of steps required to reach 1.
Starting with n = 12, the steps would be as follows:
Resulting in 9 steps. So for input n = 12, the return value would be 9.
Running the tests
To run the tests run the command
go test from within the exercise directory.
If the test suite contains benchmarks, you can run these with the
go test -bench .
Keep in mind that each reviewer will run benchmarks on a different machine, with different specs, so the results from these benchmark tests may vary.
For more detailed information about the Go track, including how to get help if you're having trouble, please visit the exercism.io Go language page.
Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.