10902
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
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
THINGS TO TRY
Slider Zoom
SNAPSHOTS
PERMANENT CITATION
"
The 3n+1 Problem
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/The3n1Problem/
Contributed by:
Stephen Wolfram
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
3n+1 Graph
Jacqueline Zizi
Orchard-Planting Problem
Ed Pegg Jr
Density Map for the 3n+1 Problem
Michael Schreiber
Collatz Paths
Jesse Nochella
Distributions of Leading Digits
Stephen Wolfram
Mertens Conjecture
Stephen Wolfram
Tightly Packed Squares
Ed Pegg Jr
3n+1 Flying Saucers
Jacqueline Zizi
Social Golfer Problem
Ed Pegg Jr
State Transition Diagrams for Modular Multiplication
Stephen Wolfram
Related Topics
Algorithms
Discrete Mathematics
Experimental Mathematics
Mathematics Problems
Number Theory
Simple Computational Systems
Trees
Unsolved Problems
Puzzles and Recreations: Advanced
School Puzzles and Recreations
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+