Joe Bartholomew
 

About the GCDs Project
The GCD plots are digital drawings plotting the greatest common divisor [1] of integer pairs or triplets as colored cells within a grid. See examples here: GCDs, Digital Drawings and GCD 3, Digital Drawings. The project was extended to a polar grid shape with the GCD Arcs and Animated GCD Arcs projects.

This project, one in a series of Grid projects, is based on an image from Wolfram's MathWorld of relatively prime numbers [2]. The concept of a GCD plot is also described in Wolfram's controversial and disparaged book, A New Kind of Science [3]. I make no claims for this project other than it is an interesting way to generate colored grids. I have no interest in cellular automata. I happen to program the images, but the algorithmic aspect is subordinate to the result.

GCD Digital Drawings

The column and row numbers figure in a pair of formulas, which then are tested for a greatest common divisor, GCD, of one (coprimes) or other small integers. The background is assigned a color. If the GCD is one, two, three, and so on, the cell is assigned black, blue, red, or yellow. For each plot there are two formulas, with the formula variables being row number and column number. For each cell, the two formulas are calculated, then the GCD of the numerical results are tested. The cell color is set accordingly. If the GCD is something other than one of the tested integers the cell remains the background color.

The GCD 3 digital drawings extend the process to the GCD of three numbers. The GCD of three numbers can be computed as gcd(a, b, c) = gcd(gcd(a, b), c). The third number can be used to mask or recompute areas selectively.

I don't design these patterns. I test formulas, and select colors to assign to the results. Other than that, the patterns come from the nature of the math. For example, the process for ten of the first plots is as follows.
a = row number
b = column number
If b>a then a and b are swapped. Each cell is assigned a color based on the greatest common divisor of the results of pairs of formulas such as:
1. a, b
2. a3+b3, a3–b3 (Taxicab and cabtaxi candidates)
3. b2+b+1, a2+a+1
4. b+a, b–a
5. b2+b+2, a2+a+2
6. b2–b+2, a2-a+1
7. b2+1, a2+2
8. b2+2b*a+a2, b2–2b*a–a2
9. b3+b2+b, a2+a
10. 3b3+2b2+b, 2a2+a

References

  1. Wikipedia contributors. Greatest common divisor. Wikipedia, The Free Encyclopedia. March 18, 2008, 02:03 UTC. Available at: http://en.wikipedia.org/w/index.php?title=Greatest_common_divisor&oldid=198997084. Accessed March 18, 2008.
  2. Weisstein, Eric W. "Relatively Prime ." From MathWorld—A Wolfram Web Resource. http://mathworld.wolfram.com/RelativelyPrime.html
  3. Wolfram, Stephen. "A New Kind of Science," (Wolfram Media, 2002), page 613; available online at NKS|Online, www.wolframscience.com/nksonline/page-613.
   
 
  Copyright 2007 Joe Bartholomew