Wolfram Research

Mathematica MathWorld Wolfram Science More »

Collatz Problem as a Cellular Automaton


	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
	Show Initialization Code

Collatz Problem (Wolfram MathWorld)

Elementary Arithmetic (NKS|Online)

"Collatz Problem as a Cellular Automaton" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/CollatzProblemAsACellularAutomaton/

Contributed by: Enrique Zeleny

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Related Topics

Browse all topics

Some Related Demonstrations

Share & Bookmark This Demonstration

Contribute

Powered by Wolfram Mathematica

Give us your feedback

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

© 2009 Wolfram Demonstrations Project & Contributors

Wolfram Research

Site Index

RSS

Atom

Note: To run this Demonstration you need the free
Mathematica Player or Mathematica 7+