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
	Show Initialization Code

"3n+1 Flying Saucers" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/3n1FlyingSaucers/

Contributed by: Jacqueline Zizi

Free Download: Mathematica Player--Runs all Demonstrations & more

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

Beraha's Conjecture, Wheels, and Cyclic Graphs
3n+1 Graph
Collatz Problem as a Cellular Automaton
Reverse Collatz Paths
Levy's Conjecture
The 3n+1 Problem
Exact Recurrent Computations with Integers
Look and Say Sequence Steps
Conjecture de Beraha pour les roues (French)
Conjecture de Beraha pour les cycles (French)

Email
Link to URL
Embed
Bookmark

Make a new version of this Demonstration
Upload a new Demonstration

Source page:

Name (optional)

Occupation (optional)

Organization (optional)

I use Mathematica:

often

occasionally

never

Country (optional)
Remember me

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »