The maximum number of pieces into which a cylinder can be divided by oblique cuts is given by

where is a Binomial Coefficient. This problem is sometimes also called Cake Cutting or Pie Cutting. For , 2, ... cuts, the maximum number of pieces is 2, 4, 8, 15, 26, 42, ... (Sloane's A000125).

**References**

Bogomolny, A. ``Can You Cut a Cake into 8 Pieces with Three Movements.'' http://www.cut-the-knot.com/do_you_know/cake.html.

Sloane, N. J. A. Sequence
A000125/M1100
in ``An On-Line Version of the Encyclopedia of Integer Sequences.''
http://www.research.att.com/~njas/sequences/eisonline.html and Sloane, N. J. A. and Plouffe, S.
*The Encyclopedia of Integer Sequences.* San Diego: Academic Press, 1995.

© 1996-9

1999-05-25