Author： Skopenkov M.
Publisher： Mathematical Association of America
ISSN： 1930-0972
Source： American Mathematical Monthly, Vol.118, Iss.5, 2011-05, pp. : 424-433
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Given 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.
Related content
On the packing dimension of box-like self-affine sets in the plane
Nonlinearity, Vol. 25, Iss. 7, 2012-07 ,pp. :
Access to resources
Recommend
RANDOM STRUCTURES AND ALGORITHMS, Vol. 45, Iss. 4, 2014-12 ,pp. :
Packing and partitioning orbitopes
Mathematical Programming, Vol. 114, Iss. 1, 2008-07 ,pp. :
PACKING EQUAL CIRCLES IN A SQUARE
Studia Scientiarum Mathematicarum Hungarica, Vol. 36, Iss. 3-4, 2000-12 ,pp. :