Coprimality conjecture for binary-partition reciprocal polynomials

From papers

Let B(n)\mathcal B(n) be the set of binary partitions of nn, and let numB(n,x)\mathrm{num}_{\mathcal B}(n,x) and denB(n,x)\mathrm{den}_{\mathcal B}(n,x) denote the associated numerator and denominator polynomials. Binary-partition coprimality conjecture. For every n1n\geq 1,

gcd(numB(n,x),denB(n,x))=1.\gcd\bigl(\mathrm{num}_{\mathcal B}(n,x),\mathrm{den}_{\mathcal B}(n,x)\bigr)=1.

This is identified as the main conjecture for binary partitions and remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Cristina Ballantine, George Beck, Brooke Feigon and Kathrin Maurischat, “Reciprocals of Subsum Polynomials”, arXiv:2605.10512 (2026).

Solutions 0

No solutions have been posted yet.