A thoughtful exercise on the Collatz Conjecture.

Choose a positive integer. If the number is odd, multiply it by 3 and add 1. If it is even, halve it. Take your result and repeat the process. The Collatz Conjecture hypothesises that, for any positive integer, this process will eventually reach 1.

This week at the HLFF Blog, Sophie Maclean breaks down this concept, leads us through it and explains why the conjecture has yet to be proven.

Check out the full article here: HLFF Blog

Image caption: A diagram of all the numbers that reach 1 under the function \(f\) in at most than 20 iterations.