The irreducibility conjecture for Q_n^{(k)} and V_n
Let and be the polynomials defined in the paper, with integers and . Irreducibility conjecture. For all integers and , the polynomials and are irreducible over .
The paper proves some partial irreducibility results, including irreducibility of when is prime, while computations indicate that the stated assertion holds in the full range.
References
- 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).
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.