GCD Cube


	Each of the numbers shown is the greatest common divisor of its coordinates. The cube shown has one corner at (1,1,1) and an opposite corner at (, , ).


	Contributed by: Michael Schreiber Based on an example given by: Stephen Wolfram

Greatest Common Divisor (Wolfram MathWorld)

"GCD Cube" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/GCDCube/

Contributed by: Michael Schreiber

Based on an example given by: Stephen Wolfram

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

Integers
Short Programs
Middle School Mathematics

Browse all topics

Look and Say Sequence Steps
Representing an Integer with an Elementary Automaton
The Cantor Sequence with Bits
Integer Value Spatial Distance
Sum of Odd Numbers
Fibonacci Mountain Matra Meru
Bitwise Operations Mod n
Filling a Cube Seven Parts at a Time
Digit Patterns of Successive Numbers
Areas in a Multiplication Table

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 »