# Seems quite hard

• February 15th 2008, 11:26 AM
james_bond
Seems quite hard
Prove that $\forall p$ prime and $r\in\mathbb{Z}$ $\exists n\in\mathbb{N}$ for which $\binom{2n}{n}\equiv r\pmod{p}$.