IBM Research

PUZZLE   IBM-329

Cake flip-cutting

IBM Research · Ponder This · 2025-09

IBM Ponder This #329 · September 2025

Let’s say we have a round strawberry cake with chocolate icing on top and an angle θ with the range 0<θ<2π. We then perform the following procedure: We successively cut wedges of angle θ from the cake, and each time we cut a wedge, we flip it and re-insert it upside down into the cake, at first with the icing at the bottom (we can picture it as if the wedge magically re-attaches it to the cake).

For example, if θ=π2, then the following image displays the various stages the cake goes through

In this example, after four steps, all the icing is now at the bottom of the cake, and after eight steps, all the icing has now returned to the top of the cake.

Your goal: For θ=e10 where e=2.718 is the usual constant, find the number of steps it will take for all the icing to return simultaneously to the top of the cake for the first time, or provide an explanation why this will never happen.

A bonus "*" will be given for finding the number of steps that will take for all the icing to simultaneously get to the bottom for the first time, or provide an explanation why this will never happen, for the same value of θ.

Solution

Best opened after a real attempt

To be added.