3n+1 Flying Saucers
3n+1 Flying Saucers
The Collatz sequence is built starting from the number . If is even, compute ; if n is odd, compute . Repeat using the result.
n
n
n
2
3n+1
Here these sequences are shown using red spheres for even numbers and blue ones for odd numbers.
Does this process always end? That is still an open problem. It is true for small numbers.