Collatz Conjecture in ECMAScript
Calculate the number of steps to reach 1 using the Collatz conjecture
exercism fetch ecmascript 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.
Go through the setup instructions for ECMAScript to install the necessary dependencies:
Install assignment dependencies:
$ npm install
Making the test suite pass
Execute the tests with:
$ npm test
In the test suites all tests but the first have been skipped.
Once you get a test passing, you can enable the next one by
An unsolved problem in mathematics named after mathematician Lothar Collatz 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.