The 3n+1 problem

dc.contributor	Universidade Estadual Paulista (UNESP)
dc.creator	Wolfram, Stephen
dc.date	2011-05-26T19:52:11Z
dc.date	2011-05-26T19:52:11Z
dc.date	2011-05-26
dc.date.accessioned	2017-04-05T16:54:49Z
dc.date.available	2017-04-05T16:54:49Z
dc.identifier	http://acervodigital.unesp.br/handle/123456789/3595
dc.identifier	http://objetoseducacionais2.mec.gov.br/handle/mec/5951
dc.identifier.uri	http://repositorioslatinoamericanos.uchile.cl/handle/2250/831006
dc.description	Knowledge about algorithms, discrete mathematics and number theory
dc.description	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
dc.description	Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática
dc.relation	162The3n1Problem.nbp
dc.rights	Demonstration freeware using Mathematica Player
dc.subject	Algorithm
dc.subject	Discrete mathematics
dc.subject	Number theory
dc.subject	Teoria do número
dc.subject	Sequência numérica
dc.subject	Educação Superior::Ciências Exatas e da Terra::Matemática::Análise Numérica
dc.title	The 3n+1 problem
dc.type	Software