On the parity of generalized partition functions. II (Q5948360): Difference between revisions

Let \(\mathcal{A}\) be a set of positive integers and \(p({\mathcal{A}},n)\) be the number of partitions of \(n\) with parts in \(\mathcal{A}\). The author proves that it is possible to construct \(\mathcal{A}\) so that \(p({\mathcal{A}},n)\) is even for all \(n\) sufficiently large and so that the number of elements of \(\mathcal{A}\) that are \(\leq x\) is at least \(cx \log\log x/(\log x)^{1/3}\) for some \(c >0\). -- For Part I, see the author and \textit{A. Sárközy}, Number theory for the millennium III. Proceedings of the millennial conference on number theory, Urbana-Champaign, IL, USA, 2000. Natick, MA: A K Peters, 55--72 (2002; Zbl 1176.11048).