| View | Files | Size | Format | Download | |
|---|---|---|---|---|---|
|
View/
|
152CollatzPaths.nbp | 69.02Kb | application/octet-stream | ||
|
Plug-in not registered
|
|||||
| Social Networks: |
|
| Title: | Collatz paths |
| Type of Resource: | Animação/simulação |
| Objective: | Show collatz paths |
| Abstract: | 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 |
| Observation: | This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737 |
| Curriculum Component: | Educação Superior::Ciências Exatas e da Terra::Matemática |
| Theme: | Educação Superior::Ciências Exatas e da Terra::Matemática::Análise Complexa |
| Author: | Nochella, Jesse |
| Language: | English (en) |
| Country: | United States (us) |
| Description: | Knowledge about algorithms, number theory and simple computational systems |
| Web Address: | http://demonstrations.wolfram.com/CollatzPaths/ |
| Date: | 2008 |
| Rightsholder: | The Wolfram Demonstrations Project & Contributors |
| License: | Demonstration freeware using Mathematica Player |
| Submitter: | Universidade Federal de São Carlos (UFSCAR) |
| URI: | http://objetoseducacionais2.mec.gov.br/handle/mec/5942 |
| This Educational Object appears in the following Types of resources: | Educação Superior: Ciências Exatas e da Terra: Matemática: Animações/Simulações |