jbiason
/
exercism
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Responses for exercises in Exercism.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
90 Commits
1 Branch
0 Tags
2.2 MiB
 
 
 
 
 
 
Tree: b2db09b3e8
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'b2db09b3e8'
${ noResults }
exercism/erlang/collatz-conjecture
Julio Biason 4408bcd32a
Exercism: 3x+1 		3 years ago
..
.exercism Exercism: 3x+1 3 years ago
src Exercism: 3x+1 3 years ago
test Exercism: 3x+1 3 years ago
HELP.md Exercism: 3x+1 3 years ago
README.md Exercism: 3x+1 3 years ago
rebar.config Exercism: 3x+1 3 years ago

README.md

Collatz Conjecture

Welcome to Collatz Conjecture on Exercism's Erlang Track. If you need help running the tests or submitting your code, check out HELP.md.

Instructions

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:

  1. 12
  2. 6
  3. 3
  4. 10
  5. 5
  6. 16
  7. 8
  8. 4
  9. 2
  10. 1

Resulting in 9 steps. So for input n = 12, the return value would be 9.

Source

Created by

Contributed to by

Based on

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