Maths Olympiad Prep

Library / Mongolian Mathematical Olympiad /2 of 97

Mongolian Mathematical Olympiad

Combinatorics Difficulty 4.8 AIME Prove it Mongolia

Let pp be a prime number. Prove that
∑k=0p(−1)k(pk)(p+kk)≡−1(modp3) \sum_{k=0}^{p} (-1)^k \binom{p}{k} \binom{p+k}{k} \equiv -1 \pmod{p^3}

Solution

The sum ∑k=0p(−1)k(pk)(p+kk)\sum_{k=0}^{p} (-1)^k \binom{p}{k} \binom{p+k}{k} is the coefficient of xpx^p in the expansion of
∑k(pk)(x−1)p+k. \sum_k \binom{p}{k} (x-1)^{p+k}.
This can be rewritten as
{∑k=0p(pk)(x−1)j}(x−1)p=xp(x−1)p \left\{ \sum_{k=0}^{p} \binom{p}{k} (x-1)^j \right\} (x-1)^p = x^p (x-1)^p
Hence the sum is actually (−1)p=−1(-1)^p = -1. Hence
∑k=0p(−1)k(pk)(p+kk)≡−1(modp3) \sum_{k=0}^{p} (-1)^k \binom{p}{k} \binom{p+k}{k} \equiv -1 \pmod{p^3}
clearly holds.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.