Beck's conjecture on parts in odd and distinct partitions
Let be a nonnegative integer. Count the total number of parts across all partitions of whose parts are odd, and separately the total number of parts across all partitions of into distinct parts. A partition has exactly one even part when one even integer occurs as a part, possibly with repetition, and no other even integer occurs. Beck's conjecture. The excess of the first total over the second equals the number of partitions of with exactly one even part, possibly repeated.
References
5 papers in this index state this conjecture (2017–2023). The statement above is taken from the most recent of them; the others are arXiv:2109.00609, arXiv:2005.03619, arXiv:1801.06815, arXiv:1705.10700.
Status
- Solved: George E. Andrews. Euler’s Partition Identity and Two Problems of George Beck (The Mathematics Student, 86 (Nos. 1–2), 2017) https://georgeandrews1.github.io/pdf/326.pdf
Source: Cristina Ballantine and Amanda Folsom, “On the number of parts in all partitions enumerated by the Rogers-Ramanujan identities”, arXiv:2303.03330 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.