9846
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
3n+1 Flying Saucers
The Collatz sequence is built starting from the number
. If
is even, compute
; if
n
is odd, compute
. Repeat using the result.
Here these sequences are shown using red spheres for even numbers and blue ones for
odd numbers.
Does this process always end? That is still an open problem. It is true for small numbers.
Contributed by:
Jacqueline Zizi
THINGS TO TRY
Rotate and Zoom in 3D
SNAPSHOTS
PERMANENT CITATION
"
3n+1 Flying Saucers
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/3n1FlyingSaucers/
Contributed by:
Jacqueline Zizi
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
Beraha's Conjecture, Wheels, and Cyclic Graphs
Jacqueline Zizi
3n+1 Graph
Jacqueline Zizi
Iterating the Collatz Map on Real and Complex Numbers
Owen Barrett
Other Formulations of the Collatz Problem
Enrique Zeleny
Collatz Problem as a Cellular Automaton
Enrique Zeleny
Reverse Collatz Paths
Jesse Nochella
Levy's Conjecture
Jay Warendorff
A Family of Generalized Fibonacci and Lucas Numbers
Abdulrahman Abdulaziz
The 3n+1 Problem
Stephen Wolfram
Exact Recurrent Computations with Integers
Jacqueline Zizi
Related Topics
3D Graphics
Color
Integers
Number Theory
Recreation
Sequences
Unsolved Problems
High School Finite Mathematics
High School Mathematics
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+