Otro
The 3n+1 problem
Autor
Wolfram, Stephen
Resumen
Knowledge about algorithms, discrete mathematics and number theory Start with a number. Then at each step, if n is even, compute n/2, and if n is odd, compute 3n+1. So far as anyone can tell, the resulting sequence always eventually reaches 1. But despite work since the 1930s, no proof is known Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática