Polynomial solution conjecture for cubic sums and fourth or sixth powers

Let k{4,6}k\in\{4,6\}, and let x,y,a,bx,y,a,b be polynomials in one variable with integer coefficients and positive leading terms. The polynomials are coprime when they satisfy the coprimality condition intended in the source. A partial sum means one of the sums obtained from the expression below by successively combining its displayed terms.

Polynomial solution conjecture. For each choice of the sign, there is a solution of

x3±y3=ak+bkx^3\pm y^3=a^k+b^k

in coprime polynomials (x,y,a,b)(x,y,a,b) such that no partial sum in

x3±y3(ak+bk)x^3\pm y^3-(a^k+b^k)

is a zero polynomial.

The conjecture is motivated by computational searches for coprime positive integer solutions, especially for k=4k=4 and, less conclusively, for k=6k=6. The supplied context says that the authors were unable to find a coprime polynomial solution, so the assertion remains open.

Sources & referencesView supporting material

Primary source

Maciej Ulas, “On primitive integer solutions of the Diophantine equation x^3y^3=a^kb^k”, arXiv:2402.06567 (2025).

Progress summary

Never refreshed

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.