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
Curvature of a measure points "x", "y" and "z" in R, let "R"("x", "y", "z") be the radius of the Euclidean circle that joins all three of them, or +∞ if they are collinear. The Menger curvature "c"("x", "y", "z") is defined to be with the natural convention that "c"("x", "y", "z") = 0 if "x", "y" and "z" are collinear. It is also conventional to extend this definition by setting "c"("x", "y", "z") = 0 if any of the points "x", "y" and "z" coincide. The Menger-Melnikov curvature "c"("μ") of "μ" is defined to be More generally, for "α" ≥ 0, define "c"("μ")