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)\equal{}\left(\begin{array}{c}n\plus{}k\\ \hline p\end{array}\right) modular arithmeticquadraticsspecial factorizationsnumber theory proposednumber theory