Sha256: 59cde5d038216066066a8e525dcb4dc8dee2c8baa1cfc86698dcb42ab8519fb7
Contents?: true
Size: 1.31 KB
Versions: 60
Compression:
Stored size: 1.31 KB
Contents
## 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. ## Examples Starting with n = 12, the steps would be as follows: 0. 12 1. 6 2. 3 3. 10 4. 5 5. 16 6. 8 7. 4 8. 2 9. 1 Resulting in 9 steps. So for input n = 12, the return value would be 9. The Scala exercises assume an SBT project scheme. The exercise solution source should be placed within the exercise directory/src/main/scala. The exercise unit tests can be found within the exercise directory/src/test/scala. To run the tests simply run the command `sbt test` in the exercise directory. For more detailed info about the Scala track see the [help page](http://exercism.io/languages/scala). ## Source An unsolved problem in mathematics named after mathematician Lothar Collatz see more at [collatz conjecture wikipedia](https://en.wikipedia.org/wiki/3x_%2B_1_problem) ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
60 entries across 60 versions & 1 rubygems