Parity of Schur's partition function (Q2324110): Difference between revisions

The partition function \(p(n)\) is the number of representations of \(n\) as nonincreasing sequence of positive integers whose sum is \(n\). \textit{T. R. Parkin} and \textit{D. Shanks} [Math. Comput. 21, 466--480 (1967; Zbl 0149.28501)] conjectured that the partition function is even and odd equally often, i.e., \[ \#\{1\leq n \leq x : p(n) \text{ is even (resp. odd)} \} \sim \frac{x}{2}, \quad x\to\infty. \] Let \(A(n)\) be the number of partitions of \(n\) into distinct parts \(\equiv 1, 2 \pmod 3\). In this paper, the author proves that \[ \frac{x}{(\log x) ^ {47/48}} \ll \{ 0\leq n \leq x: A(2n+1) \text{ is odd}\} \ll \frac{x}{(\log x)^ {1/2}}. \]