The conjectural formula for the degree of difficulty

Let pp be a polynomial of the special form given by the source's equation, and let DD(n)\mathrm{DD}(n) denote the associated number of degree of difficulty. Let A(n1,1)A(n-1,1) be the quantity defined in the source.

Conjectural formula. The number of degree of difficulty is

DD(n)=A(n1,1).\mathrm{DD}(n)=A(n-1,1).

This is proposed on the basis of an algorithmic implementation; the provided text gives no proof or resolution of the conjecture.

Sources & referencesView supporting material

Primary source

Daniel Panazzolo, “Solutions of the equation a_n + (a_n-1 + (a_2 + (a_1 + x^r_1)^r_2)^r_n = b\, x”, arXiv:2405.03179 (2024).

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.