MathNet 2015-part-05 — 191 problems (EN–VI) Question 92

Let $p$ be an odd prime number. Prove that there exists a unique integer $k$ such that $0 \leq k \leq p^{2}$ and $p^{2}$ divides $k(k+1)(k+2) \cdots(k+p-3)-1$.