On the Diophantine equation F(xn)=bym

From MaRDI portal
Publication:2567418





Let \(F\) be a polynomial in \(\mathbb Z[X]\), \(m,n\) be natural integers such that \(m\geq 2\), \(n\geq 1\) and \(b\) be a non-zero integer. The author studies the Diophantine equation \[ F\biggl(\begin{pmatrix} x \\ n\end{pmatrix} \biggr)=b \begin{pmatrix} y\\ m\end{pmatrix} \quad \text{with} \quad x,y\in \mathbb Z,\quad x\geq n,\;y\geq m.\leqno(1) \] The problem to decide whether the equation (1) has infinitely many solutions \((x,y)\) or not, has already been studied in the literature by many authors. For instance, when \(F\) is a linear polynomial \(aX\), Beukers, Shorey and Tijdeman have proved an ineffective finiteness result for this equation. The author has generalized their result when \(F=aX-c\) with \(c\in \mathbb Z\). Moreover, in case \(c=0\), for various particular values of \(m,n,a,b\), all the integer solutions of (1) have been determined. In case the degree of the \(F\) is a prime number \(p\), the author determines in this paper the pairs \((m,n)\) and the polynomials \(F\) for which the equation (1) may have infinitely many solutions.











This page was built for publication: On the Diophantine equation \(F(\binom{x}{n})=b\binom{y}{m}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567418)