No CrossRef data available.
Published online by Cambridge University Press: 14 July 2016
Given
$k\geqslant 2$ , we show that there are at most finitely many rational numbers
$x$ and
$y\neq 0$ and integers
$\ell \geqslant 2$ (with
$(k,\ell )\neq (2,2)$ ) for which In particular, if we assume that
$$\begin{eqnarray}x(x+1)\cdots (x+k-1)=y^{\ell }.\end{eqnarray}$$
$\ell$ is prime, then all such triples
$(x,y,\ell )$ satisfy either
$y=0$ or
$\ell <\exp (3^{k})$ .