Dividing a circle into areas "F" can also be derived, which will solve the problem. Its vertices include the "n" points on the circle, referred to as the exterior vertices, as well as the interior vertices, the intersections of distinct chords in the interior of the circle. The "generic intersection" assumption made above guarantees that each interior vertex is the intersection of no more than two chords. Thus the main task in determining "V" is finding the number of interior vertices. As a consequence of the lemma, any two intersecting chords will uniquely determine an interior vertex. These chords are in turn uniquely determined by
Dividing a circle into areas faces is the exterior of the circle, the number of regions "r" inside the circle is "F" − 1, or which resolves to which yields the same quartic polynomial obtained by using the inductive method Dividing a circle into areas In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with "n" sides, in such a way as to "maximise" the number of areas created by the edges and diagonals, has a solution by an inductive method. If we already have "n" points on the circle and add one more point, we draw "n"