Prove that $\displaystyle \forall p$ prime and $\displaystyle r\in\mathbb{Z}$ $\displaystyle \exists n\in\mathbb{N}$ for which $\displaystyle \binom{2n}{n}\equiv r\pmod{p}$.
Follow Math Help Forum on Facebook and Google+
View Tag Cloud