Cylinder cutting concerns the maximum number of pieces into which a cylinder can be divided by 
oblique cuts. The maximum
is given by
where 
is a binomial coefficient.
This problem is sometimes also called cake cutting or pie cutting, and has the same solution as space
division by planes. For 
, 2, ... cuts, the maximum number of pieces is 2, 4, 8, 15, 26, 42, ... (OEIS A000125).
Unsurprisingly, the numbers of this sequence
are called cake numbers.
See also
Cake Number,
Circle Division by Lines,
Cube Division by Planes,
Cylindrical Hoof,
Cylindrical
Wedge,
Ham Sandwich Theorem,
Pancake
Theorem,
Space Division by Planes,
Torus Cutting
Explore with Wolfram|Alpha
References
Bogomolny, A. "Can You Cut a Cake into 8 Pieces with Three Movements." https://www.cut-the-knot.org/do_you_know/cake.shtml.Sloane,
N. J. A. Sequence A000125/M1100
in "The On-Line Encyclopedia of Integer Sequences."Referenced
on Wolfram|Alpha
Cylinder Cutting
Cite this as:
Weisstein, Eric W. "Cylinder Cutting."
From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CylinderCutting.html
Subject classifications
