The Collatz conjecture states that for every positive integer
, repeating the simple algorithm
always eventually reaches the number 1. The conjecture remains unproven since 1937 when it was first proposed by Lothar Collatz.
This Demonstration shows the eventual merging of paths to 1, for all positive integers up to a given maximum. Because the algorithm has two cases, the graph is always a binary tree.
the Wolfram Demonstrations Project
Embed Interactive Demonstration
More details »
Download Demonstration as CDF »
Download Author Code »
More by Author
Reverse Collatz Paths
The 3n+1 Problem
Linear Congruential Sequences
Preferred Values of Collatz Paths
Collatz Conjecture on a Circle
Collatz Problem as a Cellular Automaton
Iterating the Collatz Map on Real and Complex Numbers
Collatz Sequence Paths
Simple Computational Systems
Browse all topics
The #1 tool for creating Demonstrations
and anything technical.
Explore anything with the first
computational knowledge engine.
The web's most extensive
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Join the initiative for modernizing
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
© 2013 Wolfram Demonstrations Project & Contributors |
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have