Number of iterations in Collatz's problem - Maple Application Center
Application Center Applications Number of iterations in Collatz's problem

Number of iterations in Collatz's problem

: Michael Monagan
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!
The 3n+1 sequence has probably consumed more CPU time than any other number theoretic conjecture. The reason being that its statement is so simple, that most amateurs will feel compelled to write programs to test it. This sequence, attributed to Lothar Collatz, has bee given various names, including Ulam's conjecture, Syracuse problem, Kakutani's problem and Hasse's algorithm. The conjecture is based on the iteration defined by: n[i+1] = if n[i] is even then n[i]/2 else 3*n[i]+1 .

Application Details

Publish Date: June 19, 2001
Created In: Maple V
Language: English

More Like This

Euclid's algorithm for computing greatest common divisors, with a modern improvement
Subgroup lattice plotting in 3-D
All terminal reliability polynomial for a graph G with probabilty of edge failure p
FORTRAN code generation with a linear algebra application
Motion of a bullet under air resistance
An interesting 6x6 matrix
Symbolic eigenvalues & eigenvectors
Finite splitting fields
Diatomic anharmonic oscillator
Primitive trinomials
Commutator package for Maple 6