A tale on the optimal splitting of a cake among seven people with three cuts. (English) Zbl 07921342
Summary: We show how a cake can optimally be split symmetrically among seven people using only three cuts.
MSC:
| 51M25 | Length, area and volume in real or complex geometry |
| 51M04 | Elementary problems in Euclidean geometries |
| 91B32 | Resource and cost allocation (including fair division, apportionment, etc.) |
References:
| [1] | Buck, R, Buck, E.Equipartitioning of convex sets. Math Mag. 1949;22(4):195-198. DOI: . |
| [2] | Courant, R, Robbins, H.What is mathematics? Oxford: Oxford University Press; 1941. · Zbl 0060.12302 |
| [3] | Sholander, M.Proof of a conjecture of R.C. Buck and E.F. Buck. Math Mag. 1950;24(1):7-19. DOI: . · Zbl 0041.51203 |
| [4] | Steiger, W, Szegedy, M, Zhao, J.Six-way equipartitioning by three lines in the plane. In: Proceedings of the 22nd Canadian Conference on Computational Geometry, , 2010. p. 277-280. Available from: http://cccg.ca/proceedings/2010/paper73.pdf |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
