On linear combinations of products of consecutive integers (Q2221048): Difference between revisions

Let \(\mathcal{A}=(a_n)\) be a sequence of rational numbers with \(a_0=a_1\ge 1\) and set \[f_{n,\mathcal{A}}(x)=\sum_{k=0}^n a_k \prod_{j=0}^k (x+j).\] The author proves effective finiteness results on Diophantine equations of type \(f_{n,\mathcal{A}}(x)=y^m\) (with given \(n\)), \(f_{n,\mathcal{A}}(x)=Ay^m+B\) (with given integers \(A,B,n\)) and \(f_{n,\mathcal{A}}(x)=g(y)\) (with given \(n\) and given quadratic polynomial \(g\)).\par The results are connected with the theorems of \textit{L. Hajdu} et al. [Acta Arith. 172, No. 4, 333--349 (2016; Zbl 1400.11087)], \textit{A. Bazsó} et al. [Monatsh. Math. 187, No. 1, 21--34 (2018; Zbl 1442.11055)] and \textit{S. Tengely} and \textit{M. Ulas} [J. Number Theory 197, 341--360 (2019; Zbl 1450.11025)].