Is this Euclid’s Orchard?
The coloring is the number of steps it takes the compute gcd(x,y) with the Euclidean algorithm.
Well done! I didn’t know whether anyone would figure out the coloring scheme.
It is! I wasn’t aware of that name for it, but I like it.
Is it about how many common divisors two Integers have?
You’re on the right track, but that’s not quite it.
Pingback: A few words about PWW #20 | The Math Less Traveled
Comments are closed.
Enter your email address to follow this blog and receive notifications of new posts by email.
Join 500 other followers
Brent's blogging goal