Abstract
In this paper we prove that the number of partitions into squares with an even number of parts is asymptotically equal to that of partitions into squares with an odd number of parts. We further show that, for [Formula: see text] large enough, the two quantities are different and which of the two is bigger depends on the parity of [Formula: see text] This solves a recent conjecture formulated by Bringmann and Mahlburg (2012).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have