IR-TST 2004 Problem 1

Suppose that $p$ is a prime number. Prove that for each $k$, there exists an $n$ such that: $$\left(\begin{array}{c}n\\ \hline p\end{array}\right)=\left(\begin{array}{c}n+k\\ \hline p\end{array}\right)$$