The 3n+1 Problem
Start with a number. Then at each step, if
is even, compute
, and if
is odd, compute
. So far as anyone can tell, the resulting sequence always eventually reaches 1. But despite work since the 1930s, no proof is known.
Contributed by:
Stephen Wolfram
X
X
Show Source Code
|
Download Source Code Notebook
"
The 3n+1 Problem
" from
The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/The3n1Problem/
Contributed by:
Stephen Wolfram
Algorithms
Discrete Mathematics
Experimental Mathematics
Mathematics Problems
Number Theory
Simple Computational Systems
Trees
Unsolved Problems
3n+1 Graph
Orchard-Planting Problem
Density Map for the 3n+1 Problem
Collatz Paths
Tightly Packed Squares
Distributions of Leading Digits
Mertens Conjecture
3n+1 Flying Saucers
Reverse Collatz Paths
State Transition Diagrams for Modular Multiplication
Make a new version of this Demonstration
Upload a new Demonstration
Contact The Wolfram Demonstrations Project Team
Site Index
Wolfram Research
© 2008
The Wolfram Demonstrations Project & Contributors
Terms of Use
Privacy Policy
RSS
Atom