




![]()
In this example, you could, in your mind, hop from one circle to another circle, one adjacent circle at a time, and no matter what crooked path taken, the number hops between the first and last circle is always either odd or even. This means that if you were to rotate one circle in this cluster CW, as if it were a gear, all the gears that are an even number of hops away would also begin to rotate CW, while all those rotating CCW would be an odd number of hops away. If you made a system of gears just like this. They would not fight each other. They could all be rotated as a unison.
[....]
Below is a "marbles" version of a similar pattern:
Try the ball "hopping" experiment, and see if you can find the similarity.
Kmarinas86's self-correction:
It turns out that the above pictures are not proper examples of what I was trying to describe.
The pattern on the top-left of the graphic below is a good example of what I'm talking about.
It's the one that says "(i) 1/10 cusp:" right below it.
Generally, if the numerator of the cusp fraction is odd and the denominator of the cusp fraction is even, then all the possible paths from any one circle to any other one circle has "circle lengths" which are all either even or odd, meaning that if one imagines turning one circle, as if it were a gear, then all circles would cooperate: