Author:
Bennett Michael A.,Siksek Samir
Abstract
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 $$\begin{eqnarray}x(x+1)\cdots (x+k-1)=y^{\ell }.\end{eqnarray}$$ In particular, if we assume that $\ell$ is prime, then all such triples $(x,y,\ell )$ satisfy either $y=0$ or $\ell <\exp (3^{k})$.
Subject
Algebra and Number Theory
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献