Congruency of binomial coefficient
Posted: Fri Dec 11, 2015 8:32 pm
Let $p$ be a prime number such that $n<p<2n$. Prove that:
$$\binom{2n}{n} \equiv 0 (\bmod p)$$
Ι don't have a solution.
$$\binom{2n}{n} \equiv 0 (\bmod p)$$
Ι don't have a solution.