Collatz Problem as a Cellular Automaton

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.

Start with an integer ; if it is even, divide by two, but if it is odd, triple it and add 1; repeat this process. The Collatz problem asks whether 1 is reached. In all known cases, the sequence always reaches 1, but no proof is known that this is always true. Here is a cellular automaton version of this, writing in base 6.

Contributed by: Enrique Zeleny (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.