On the equation \((x+1)\dots(x+k)=(y+1)\dots(y+mk)\) (Q1190263)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the equation \((x+1)\dots(x+k)=(y+1)\dots(y+mk)\) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the equation \((x+1)\dots(x+k)=(y+1)\dots(y+mk)\) |
scientific article |
Statements
On the equation \((x+1)\dots(x+k)=(y+1)\dots(y+mk)\) (English)
0 references
27 September 1992
0 references
In the second article [for the first one, ibid. 2, No. 4, 489-510 (1991) see the review above] the authors show that the equation \[ (x+1)\dots(x+k)=(y+1)\dots (y+mk) \] with integers \(x,y\geq 0\), \(k,m\geq 2\) implies that \(\max(x,y,k)\) is bounded by an effectively computable number depending only on \(m\). In an appendix by R. Balasubramanian, some relations, not necessary for the proof, of the implied polynomials are given.
0 references
products of consecutive integers
0 references
equal products
0 references
multiplicative diophantine equations
0 references
