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
Area of a circle Measurement of a Circle" (c. 260 BCE), compare the area enclosed by a circle to a right triangle whose base has the length of the circle's circumference and whose height equals the circle's radius. If the area of the circle is not equal to that of the triangle, then it must be either greater or less. We eliminate each of these by contradiction, leaving equality as the only possibility. We use regular polygons in the same way. Suppose that the area "C" enclosed by the circle is greater than the area "T" = ⁄"cr" of the triangle. Let "E" denote