Divisibility and distribution of partitions into distinct parts (Q5937637): Difference between revisions

Let \(Q(n)\) denote the number of partitions of \(n\) into distinct parts. The generating function of \(Q(n)\) is given by \[ \sum_{n=0}^\infty Q(n)q^n =\prod_{n=1}^\infty (1+q^n). \] The main result of this paper states that for any prime \(p\geq 5\), \[ F_p(z):=\sum_{n=0}^\infty Q\left(\frac{pn-1}{24}\right) \equiv f_p(z)\pmod p, \] where \[ f_p(z)\in S_{4(p-1)}\left(\Gamma_0(1152),\left(\frac{2}{d}\right)\right), \] the space of cusp forms of weight \(4(p-1)\), level 1152 and character \(\left(\frac{2}{d}\right)\). Combining this with Serre's Theorem, the author deduces that for any prime \(p\geq 5\), there are infinitely many distinct arithmetic progressions \(an+b\) such that \[ Q(an+b) \equiv 0\pmod p, n\in \mathbb{Z}^+. \] The simplest example of such a congruence is \[ Q(26645n+76)\equiv 0\pmod{5}. \]