The arithmetic of partitions into distinct parts (Q4435539)

Let \(Q(n)\) be the total number of partitions of the positive integer \(n\) into distinct parts. It is assumed that the parts are arranged in a decreasing order. Euler's pentagonal number theorem implies that almost all values of \(Q(n)\) are even and \(Q(n)\) is odd if and only if \(n\) is a pentagonal number. Furthermore, recent investigations show that, for any positive integer \(k\), almost all values of \(Q(n)\) are divisible by \(2^k\), problems related to \(Q(n)\) divisible by odd primes require, however, different approaches and techniques. In the present paper the authors use the theory of modular forms to prove some density results for \(Q(n)\). Among others they establish, for instance, that \[ \liminf_{X\to\infty}\,{\{\# n\leq X: Q(n)\equiv 0\pmod M\}\over X}\geq \prod_{\substack{ p\mid M\\ p\geq 5,\,\text{prime}}} {p+1\over p}, \] where \(M\) is coprime to 3.