Balancing pairs of adjacent slices of cake

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.