| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | Nochella, Jesse | |
| dc.date | 2011-05-26T19:52:10Z | |
| dc.date | 2011-05-26T19:52:10Z | |
| dc.date | 2011-05-26 | |
| dc.date.accessioned | 2017-04-05T16:54:45Z | |
| dc.date.available | 2017-04-05T16:54:45Z | |
| dc.identifier | http://acervodigital.unesp.br/handle/123456789/3586 | |
| dc.identifier | http://objetoseducacionais2.mec.gov.br/handle/mec/5942 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/830997 | |
| dc.description | Knowledge about algorithms, number theory and simple computational systems | |
| dc.description | The 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 tree | |
| dc.description | Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática | |
| dc.relation | 152CollatzPaths.nbp | |
| dc.rights | Demonstration freeware using Mathematica Player | |
| dc.subject | Algorithm | |
| dc.subject | Number theory | |
| dc.subject | Simple computational system | |
| dc.subject | Algoritmo | |
| dc.subject | Teoria do número | |
| dc.subject | Educação Superior::Ciências Exatas e da Terra::Matemática::Análise Complexa | |
| dc.title | Collatz paths | |
| dc.type | Software | |
