The irreducibility conjecture for Q_n^{(k)} and V_n

From papers

Let Qn(k)(x)Q_n^{(k)}(x) and Vn(x)V_n(x) be the polynomials defined in the paper, with integers n1n\geq 1 and 0kn10\leq k\leq n-1. Irreducibility conjecture. For all integers n1n\geq 1 and 0kn10\leq k\leq n-1, the polynomials Qn(k)(x)Q_n^{(k)}(x) and Vn(x)V_n(x) are irreducible over Q\mathbb Q.

The paper proves some partial irreducibility results, including irreducibility of Vn(x)V_n(x) when 2n+12n+1 is prime, while computations indicate that the stated assertion holds in the full range.

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

Karl Dilcher and Maciej Ulas, “Arithmetic properties of polynomial solutions of the Diophantine equation P(x)x^n+1+Q(x)(x+1)^n+1=1”, arXiv:1909.11222 (2019).

Solutions 0

No solutions have been posted yet.