Exercism v3 launches on Sept 1st 2021. Learn more! ๐๐๐

Published at Dec 01 2020
·
0 comments

Instructions

Test suite

Solution

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:

- 12
- 6
- 3
- 10
- 5
- 16
- 8
- 4
- 2
- 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.

An unsolved problem in mathematics named after mathematician Lothar Collatz https://en.wikipedia.org/wiki/3x_%2B_1_problem

It's possible to submit an incomplete solution so you can see how others have completed the exercise.

```
import org.scalatest.{Matchers, FunSuite}
/** @version 1.2.0 */
class CollatzConjectureTest extends FunSuite with Matchers {
test("zero steps for one") {
CollatzConjecture.steps(1) should be (Some(0))
}
test("divide if even") {
pending
CollatzConjecture.steps(16) should be (Some(4))
}
test("even and odd steps") {
pending
CollatzConjecture.steps(12) should be (Some(9))
}
test("Large number of even and odd steps") {
pending
CollatzConjecture.steps(1000000) should be (Some(152))
}
test("zero is an error") {
pending
CollatzConjecture.steps(0) should be (None)
}
test("negative value is an error") {
pending
CollatzConjecture.steps(-15) should be (None)
}
}
```

```
object CollatzConjecture {
private var count: Int = 0
def steps(testNumber: Int): Option[Int] = {
if (testNumber < 1) return None
_steps(testNumber)
Some(getCountAndReset())
}
def _steps(testNumber: Int): Int = {
if (isOdd(testNumber)) forOdd(testNumber) else forEven(testNumber)
}
def forOdd(oddNumber: Int): Int = {
if (oddNumber == 1) return 0
count += 1
return _steps((3*oddNumber) + 1)
}
def forEven(evenNumber: Int): Int = {
count += 1
return _steps(evenNumber/2)
}
def isOdd(num: Int): Boolean = {
(num % 2) != 0
}
def getCountAndReset(): Int = {
val numSteps = count
count = 0
numSteps
}
}
```

A huge amount can be learned from reading other peopleโs code. This is why we wanted to give exercism users the option of making their solutions public.

Here are some questions to help you reflect on this solution and learn the most from it.

- What compromises have been made?
- Are there new concepts here that you could read more about to improve your understanding?

Level up your programming skills with 3,450 exercises across 52 languages, and insightful discussion with our volunteer team of welcoming mentors.
Exercism is
**100% free forever**.

## Community comments