We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Published online by Cambridge University Press: 02 August 2005
It is proved that, if $P$ is a polynomial with integer coefficients, having degree 2, and $1>\varepsilon>0$, then $n(n-1)\cdots(n-k+1)=P(m)$ has only finitely many natural solutions $(m,n,k)$, $n\ge k>n\varepsilon$, provided that the $abc$ conjecture is assumed to hold under Szpiro's formulation.
