Collatz Conjecture

Number I find interesting is:

• Every number power of 2 (2ⁿ), where n is:  1,  2,  4,  8,  16,  32,  128,  256,  512,  1024,  2048 will always have the fewest steps possible.
• Some low numbers generate surprisingly many steps. For instance: 27,  31,  41, and 54 and 55 generates 113 steps:
• 188, 189 and 190 all generates 107 steps and only the first numbers are different:

---

The Collatz Conjecture is a conjecture in mathematics that concerns a sequence defined as follows:
start with any positive integer n. Then each term is obtained from the previous term as follows:
if the previous term is even, the next term is one half of the previous term. If the previous term is odd,
the next term is 3 times the previous term plus 1.

The conjecture is that no matter what value of n, the sequence will always reach 1.

Back to homepage