WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Collatz Paths

The Collatz conjecture states that for every positive integer
n
, repeating the simple algorithm
n↦
n
2
niseven
3n+1
nisodd
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.
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.