A Solution of Conway's Fried Potato Problem
András Bezdek, Károly Bezdek · Bulletin of the London Mathematical Society · 1995
In order to fry it as expeditiously as possible, Conway wishes to slice a given convex potato into n pieces by n–1 successive plane cuts (just one piece being divided by each cut), so as to minimize the greatest inradius of the pieces. We show that one has to employ equally-spaced parallel cuts, choosing the direction of the cuts parallel to the planes of support which determine the minimum width of a well-defined, rounded potato. We also show some examples and discuss two variations of the original problem.