We denote by $p(n)$ the number of partitions of $n$. There are infinitely many integers $m$ such that $p(m)$ is even, and infinitely many integers $n$ such that $p(n)$ is odd.
It might be proved by the Euler's Pentagonal Number Theorem. Could you give me some hints?