You and a buddy start with a rectangular cake, represented by rectangle in Figure 1. Then you get to pick any point between and , and the cake is sliced with two straight cuts, from to and to . Then it’s your friend’s turn to pick a point between and , so that the cake will be sliced from to and to . The four straight slices intersect at points , , and as shown in Figure 1. You receive piece of the cake, and the other player receives pieces , , and .
Determine all points you can choose on side that will prevent your buddy from ending up with more cake (in all) than you do.
This problem originally appeared in the Prisoner’s Dilemma in the 2024 Spring issue of the PMP Newsletter. Solutions are no longer being accepted for this Dilemma.
Show solution?
Solution.
Christopher West (PMP) and the Georgia Southern Eagle Problem Solvers got this one. The answer is that can be any point at all on , because no matter what points and are chosen, the purple and pink areas are equal. To see this, note that by the usual area formula for triangles, each of the triangles and has area half that of rectangle , so the sum of their areas is equal to that of . On the other hand, simply looking at the regions in Figure 1, the area of is the sum of triangles and , plus the regions of the rectangle that they miss (precisely the purple areas), minus the area of their overlap (since that’s counted twice in the sum), which is exactly the pink area. Since the sum of and is already exactly the area of the rectangle, the purple areas and the pink area must be equal.