Reverse Collatz Paths
Reverse Collatz Paths
The Collatz conjecture states that repeating the following algorithm starting with any positive integer eventually reaches the number 1.
n
n⟶
n 2 | niseven |
3n+1 | nisodd |
Running the Collatz algorithm in reverse starting at 1 creates a graph. The Collatz conjecture is equivalent to saying that this graph contains every positive integer.
External Links
External Links
Permanent Citation
Permanent Citation
Jesse Nochella
"Reverse Collatz Paths"
http://demonstrations.wolfram.com/ReverseCollatzPaths/
Wolfram Demonstrations Project
Published: September 28, 2007