OMM 1996 Problem 5

The numbers $1$ to $n^2$ are written in an n×n squared paper in the usual ordering. Any sequence of right and downwards steps from a square to an adjacent one (by side) starting at square $1$ and ending at square $n^2$ is called a path. Denote by $L(C)$ the sum of the numbers through which path $C$ goes. (a) For a fixed $n$ , let $M$ and $m$ be the largest and smallest $L(C)$ possible. Prove that $M-m$ is a perfect cube. (b) Prove that for no $n$ can one find a path $C$ with $L(C ) = 1996$ .