You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/unesp/360730
Title: 
Collatz problem as a cellular automaton
Author(s): 
Zeleny, Enrique
Language: 
eng
Description: 
  • Number Theory
  • Start with an integer n; if it is even, divide by two, but if it is odd, triple it and add 1; repeat this process. The Collatz problem asks whether 1 is reached. In all known cases, the sequence always reaches 1, but no proof is known that this is always true. Here is a cellular automaton version of this, writing n in base 6
  • Componente Curricular::Educação Superior::Ciências Exatas e da Terra::Matemática
Issue Date: 
  • 11-Sep-2008
  • 11-Sep-2008
  • 2008
  • 11-Sep-2008
  • 10-Sep-2008
Keywords: 
  • Foundations of Mathematics
  • Number Theory
  • Sequences
  • Educação Superior::Ciências Exatas e da Terra::Matemática::Análise Complexa
Notes: 
Show the collatz problem as a cellular automaton
Credits: 
This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
Source: 
http://objetoseducacionais2.mec.gov.br/handle/mec/5219
URI: 
http://acervodigital.unesp.br/handle/unesp/360730
Rights: 
Demonstration freeware using Mathematica Player
Type: 
outro
Appears in Collections:MEC - Objetos Educacionais (BIOE) - OE

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.