Cylinder Cutting
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 orPie Cutting. For 
, 2, ... cuts, the maximum number of pieces is 2, 4, 8, 15, 26, 42, ...(Sloane's A000125).See also Circle Cutting, Ham Sandwich Theorem, Pancake Theorem, Torus Cutting
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. SequenceA000125/M1100in ``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.
- k-Chain
- k-Circuit
- k-Coloring
- Kei
- Keith Number
- Keller's Conjecture
- Kelvin Functions
- Kelvin's Conjecture
- Kelvin Transformation
- Kempe Linkage
- Kepler Conjecture
- Kepler-Poinsot Solid
- Kepler Problem
- Kepler's Equation
- Kepler's Folium
- Kepler Solid
- Ker
- Keratoid Cusp
- Kernel (Integral)
- Kernel (Linear Algebra)
- Kernel Polynomial
- Kervaire's Characterization Theorem
- Ket
- k-Form
- K-Function