This essay describes an algorithm to determine whether an odd integer is a prime or a composite. The integer is the number of vertexes of a polygon. Graphs of these polygons show their networks that depend on whether the number of vertexes is prime or composite. The networks contain coalitions that describe round trips that differ for primes and composites. Circuit core models in cooperative games use these circuits as their coalitions.