Reverse Collatz Paths

Requires a Wolfram Notebook System

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

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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

[more]

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.

[less]

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


Snapshots


Details



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.
Send