KAUST DepartmentVisual Computing Center (VCC)
Preprint Posting Date2010-03-10
Online Publication Date2011-06-13
Print Publication Date2011
Permanent link to this recordhttp://hdl.handle.net/10754/561765
MetadataShow full item record
AbstractGiven a triangular cake and a box in the shape of its mirror image, how can the cake be cut into a minimal number of pieces so that it can be put into the box? The cake has icing, so we are not allowed to put it into the box upside down. V. G. Boltyansky asked this question in 1977 and showed that three pieces always suffice. In this paper we provide examples of cakes that cannot be cut into two pieces to be put into the box. This shows that three is the answer to Boltyansky's question. We also give examples of cakes which can be cut into two pieces. © THE MATHEMATICAL ASSOCIATION OF AMERICA.
CitationM. Skopenkov. (2011). Packing a Cake into a Box. The American Mathematical Monthly, 118(5), 424. doi:10.4169/amer.math.monthly.118.05.424
SponsorsThe author is grateful to R. Clawson, B. R. Frenkin, A. A. Glazyrin, I. V. Izmestiev, and M. V. Prasolov for useful discussions. The author is also grateful to his wife Anastasia for some figures and cakes. The author was supported in part by the Moebius Contest Foundation for Young Scientists and the Euler Foundation.
PublisherInforma UK Limited