MODBasic CombinatorialIdentity Intermediate

Problem - 4232

Let $p$ be a prime and $k$ be a positive integer less than $p$. Show that $\binom{p}{k} \equiv 0 \pmod{p}$.


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error