circle cutting | Moser's circle problem

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by chords with no three internally concurrent. The answer is g(n) | = | (n 4) + (n 2) + 1 | = | 1/24(n^4 - 6n^3 + 23n^2 - 18n + 24),

cake cutting | circle division by lines | cylinder cutting | ham sandwich theorem | pancake theorem | pizza theorem | plane division by circles | plane division by ellipses | plane division by lines | square division by lines | torus cutting