{
  "id": "1003.2101",
  "version": "v1",
  "published": "2010-03-10T12:58:08.000Z",
  "updated": "2010-03-10T12:58:08.000Z",
  "title": "Packing a cake into a box",
  "authors": [
    "Mikhail Skopenkov"
  ],
  "comment": "9 pages, 13 figures",
  "journal": "M. Skopenkov, Packing a cake into a box, Amer. Math. Monthly 118:5 (2011), 424-433",
  "categories": [
    "math.CO",
    "math.MG"
  ],
  "abstract": "Given a cake in form of a triangle and a box that fits the mirror image of the cake, how to cut the cake into a minimal number of pieces so that it can be put into the box? The cake has an icing, so that 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 put into the box. This shows that three is the answer to V.G. Boltyansky's question. Also we give examples of cakes which can be cut into two pieces.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-03-10T12:58:08.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "52B45"
    ],
    "keywords": [
      "minimal number",
      "box upside",
      "mirror image",
      "boltyanskys question"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1003.2101S"
    }
  }
}