pie cutting

The maximum number of pieces into which a cylinder can be divided by n oblique cuts is given by f(n) | = | (n + 1 3) + n + 1 | = | 1/6(n + 1)(n^2 - n + 6) | = | 1/6(n^3 + 5n + 6), where (a b) is a binomial coefficient.

cake number | circle division by lines | cube division by planes | ham sandwich theorem | pancake theorem | space division by planes | torus cutting