We prove that in a certain cake cutting model, every fair cake division protocol for $n$ players must use $\Omega(n\log n)$ cuts in the worst case.
