MathNet 2010 — Part 06 Question 89

Denote by $\nu(n)$ the exponent of $2$ in the prime factorization of $n!$. Show that for arbitrary positive integers $a$ and $m$ there exists an integer $n \gt 1$ for which $\nu(n) \equiv a \mod m$.