On the diophantine equation x(x-1)...(x-(m-1 ) )= λy(y-1 )...(y-(n-1 ) )+ l (Q4429665)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.

scientific article; zbMATH DE number 1986214
Language Label Description Also known as
default for all languages
No label defined
    English
    On the diophantine equation x(x-1)...(x-(m-1 ) )= λy(y-1 )...(y-(n-1 ) )+ l
    scientific article; zbMATH DE number 1986214

      Statements

      On the diophantine equation x(x-1)...(x-(m-1 ) )= λy(y-1 )...(y-(n-1 ) )+ l (English)
      0 references
      0 references
      28 September 2003
      0 references
      exponential Diophantine equations
      0 references
      decomposable polynomial equations
      0 references
      number of solutions
      0 references
      The author studies the title equation, which is the inhomogeneous counterpart to the equation with \(l= 0\). The latter has been extensively investigated by Saradha, Shorey and Tijdeman [for recent results see \textit{T. N. Shorey}, Number theory, Trends Math., Birkhäuser, Basel, 463--495 (2000; Zbl 0958.11026)]. The author extends the main results of [\textit{F. Beukers}, \textit{T. N. Shorey} and \textit{R. Tijdeman} [Number theory in progress, de Gruyter, Berlin, 11--26 (1999; Zbl 0933.11011)] to the inhomogeneous title equation, and more generally, in rationals \(x\) and \(y\) with \(d_1,d_2,\lambda,l\in \mathbb{Q}\) (\(\lambda\neq 0\), \(d_1> 0\), \(d_2> 0\) unless \(d_1= d_2= -1\)). His results give precise finiteness conditions on the number of solutions. A special case is the combinatorial Diophantine equation \[ a\begin{pmatrix} x\\ m\end{pmatrix}= b\begin{pmatrix} y\\ n\end{pmatrix}+ k \] in integers \(x\geq m\) and \(y\geq n\), where \(a,b\neq 0\) are integers and \(k\), \(m\), \(n\) are integers with \(1< m\leq n\). The paper ends with a large set of references.
      0 references

      Identifiers