Knowledge about algorithms, number theory and simple computational systemsThe Collatz conjecture states that for every positive integer n, repeating the simple algorithm n={(n/2) if n is even or (3n+1) is n is odd} 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 treeComponente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática