Reverse Collatz Paths

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

The Collatz conjecture states that repeating the following algorithm starting with any positive integer eventually reaches the number 1.


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.


Contributed by: Jesse Nochella (March 2011)
Open content licensed under CC BY-NC-SA



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.