On the diophantine equation {n \choose k} = x^l

From MaRDI portal
Publication:4345834





Several authors investigated the equation \[ {n\choose k}=x^\ell\quad\text{in integers}\quad n,k,x,\ell\quad\text{with}\quad k\geq 2,\quad n\geq 2k,\quad x>1,\quad \ell>1.\tag{*} \] For \(k=\ell=2\) there are infinitely many solutions. It is well-known that for \(k=3\), \(\ell=2\), (*) has the only solution \(n=50\), \(x=140\). \textit{P. Erdös} [J. Lond. Math. Soc. 26, 176-178 (1951; Zbl 0043.04309)] proved that for \(k\geq 4\), (*) has no solution. It follows from a recent result of \textit{H. Darmon} and \textit{L. Merel} [Winding quotients and some variants of Fermat's last theorem (to appear)] that for \(k=2\), (*) has no solution. In the paper under review, the same assertion (Theorem 1) is proved for \(k=3\). The proof depends, among other things, on the theory of linear forms in logarithms. The main result (Theorem 2) of the paper asserts that apart from the case \(k=\ell=2\), equation (*) has only the solution \(n=50\), \(k=3\), \(x=140\), \(\ell=2\). This confirms an old conjecture of Erdös. Theorem 2 is a consequence of Theorem 1 and the above mentioned results of Erdös and of Darmon and Merel. Hence it may be regarded as a joint result of Erdös, Darmon, Merel and the author.




Cited in
(30)








This page was built for publication: On the diophantine equation ${n \choose k} = x^l$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345834)