Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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?

share|cite|improve this question
I can imagine various ways to interpret "the number of partitions of $n$". Which one is in use here? – Henning Makholm Oct 27 '11 at 1:08
Just a quickly hint, need to go now. Try search about Ramanujan too and try this link – GarouDan Oct 27 '11 at 1:11
@Henning: Both the notation and the reference to Euler’s pentagonal number theorem strongly suggest that it’s the usual notion of partition of an integer. – Brian M. Scott Oct 27 '11 at 4:54

Hint: Look at the pentagonal number theorem and the recurrence relation it yields for $p(n)$, and consider what would happen if $p(n)$ had the same parity for all $n\gt n_0$.

share|cite|improve this answer

The theorem is due to O. Kolberg, Note on the parity of the partition function, Math. Scand. 7 1959 377–378, MR0117213 (22 #7995). The review by Mirsky says that the proof uses the Pentagonal Number Theorem, and is extremely short and simple.

share|cite|improve this answer
I'm surprised it's considered to be due to anyone. It follows almost immediately from the pentagonal number theorem. – joriki Oct 27 '11 at 4:59
@joriki, the reviewer was surprised, too, that the theorem had been overlooked by earlier writers. – Gerry Myerson Oct 27 '11 at 5:28

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.