On balancing two-slice portions of cake
Abstract
After n radial cuts of a circular cake, it is divided into n slices. Call an adjacent pair of slices a portion. We exhibit an infinite sequence of cuts such that the ratio between the maximum and minimum sizes of a portion never exceeds 1.755. This improves on the trivial upper bound of 2, disproving a conjecture of Korsky.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.