Wolstenholme's theorem (source code)

= Wolstenholme's theorem
{c}

For every <prime> $p\ge5$, $\binom{2p-1}{p-1}\equiv1\pmod{p^3}$. Equivalently, $\sum_{k=1}^{p-1}1/k\equiv0\pmod{p^2}$, with denominators interpreted through <modular inverses>.