A Combinatorial Identity Using Finite Fields
Achyut BharadwajSeptember 2022
Introduction # Consider a prime $p$. For what integers $n$ does $p$ divide all of $$\binom{n}{1}, \binom n 2, \binom n 3, \dots, \binom{n}{n-1}?$$ Can we characterize all such $n$ given a value of $p$? It turns out that this happens if and only if $n$ is a perfect power of $p$. How do we prove this? In fact, there exists a simple proof using elementary methods. But as always, it is both fun as well as good to prove everything twice. ...