History

Blizzard Finnegan d2ff52dc39 init commit		2023-08-21 13:50:14 -04:00
..
.exercism	init commit	2023-08-21 13:50:14 -04:00
src	init commit	2023-08-21 13:50:14 -04:00
tests	init commit	2023-08-21 13:50:14 -04:00
.gitignore	init commit	2023-08-21 13:50:14 -04:00
Cargo.toml	init commit	2023-08-21 13:50:14 -04:00
HELP.md	init commit	2023-08-21 13:50:14 -04:00
README.md	init commit	2023-08-21 13:50:14 -04:00

README.md

Collatz Conjecture

Welcome to Collatz Conjecture on Exercism's Rust 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.

But sometimes the number grow significantly before it reaches 1. This can lead to an integer overflow and makes the algorithm unsolvable within the range of a number in u64.

Given a number n, return the number of steps required to reach 1.

Examples

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.

Source

Created by

@jgilray

Contributed to by

@coriolinus
@cwhakes
@eddyp
@efx
@ErikSchierboom
@lutostag
@nfiles
@petertseng
@rofrol
@stringparser
@xakon
@ZapAnton

Based on

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