Dividing a circle into areas lines (there are two points on one side and one on the other). So the recurrence can be expressed as which can be easily reduced to using the sums of the first formula_3 natural numbers and the first formula_3 squares, this combines to Finally which yields The lemma asserts that the number of regions is maximal if all "inner" intersections of chords are simple (exactly two chords pass through each point of intersection in the interior). This will be the case if the points on the circle are chosen "in general position". Under this assumption of "generic intersection", the number
Great-circle distance the great-circle distance is part of the more general problem of great-circle navigation, which also computes the azimuths at the end points and intermediate way-points. Through any two points on a sphere that are not directly opposite each other, there is a unique great circle. The two points separate the great circle into two arcs. The length of the shorter arc is the great-circle distance between the points. A great circle endowed with such a distance is called a Riemannian circle in Riemannian geometry. Between two points that are directly opposite each other, called "antipodal points", there are infinitely many