Software
Reverse collatz paths
Autor
Nochella, Jesse
Resumen
Knowledge about algorithms, integers, number theory and recursion The Collatz conjecture states that repeating the following algorithm starting with any positive integer n eventually reaches the number 1.
n={(n/2) if n is even or (3n+1) if n is odd}
Running the Collatz algorithm in reverse starting at 1 creates a graph. The Collatz conjecture is equivalent to saying that this graph contains every positive integer Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática