On the diophantine equation {n \choose k} = x^l
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.
- On the Diophantine equation \({n \choose k_1,\dots,k_s}=x^l\)
- scientific article; zbMATH DE number 3955003
- On the diophantine equation n(n+1)...(n+k-1) = bx^l
- On the Diophantine equation $1^k+2^k+\dotsb+x^k=y^n$
- On the Diophantine equation N_n=x^a x^b+1
- Publication:4890963
- scientific article; zbMATH DE number 727035
- ON THE DIOPHANTINE EQUATION
- On the Diophantine Equation x(x+1) ⋯(x+n-1) = y k∗
- On the diophantine equation \(\sum ^{k}_{i=0}1/x_ i=a/n\)
- Binomial coefficients and Lucas sequences
- On the Diophantine equations n2=cx^l and n3=cx^l.
- Erdős and the integers
- Polynomial values of products of terms from an arithmetic progression
- On the Diophantine equation \(\binom{n}{k} = \binom{m}{l} + d\)
- The Prouhet-Tarry-Escott problem, indecomposability of polynomials and Diophantine equations
- Polynomial values of figurate numbers
- Equal values of figurate numbers
- A new kind of Diophantine equations
- On the Diophantine equation \({n \choose k_1,\dots,k_s}=x^l\)
- Diophantine equations of matching games. II.
- On a conjecture of Erdös on binomial coefficients
- Combinatorial expressions of L_k(n) and Beal's conjecture
- Consecutive binomial coefficients satisfying a quadratic relation
- scientific article; zbMATH DE number 4043931 (Why is no real title available?)
- scientific article; zbMATH DE number 38432 (Why is no real title available?)
- scientific article; zbMATH DE number 558502 (Why is no real title available?)
- On the diophantine equation n(n+1)...(n+k-1) = bx^l
- On some polynomial values of repdigit numbers
- The Diophantine equation \(\sum_{j=1}^k jF_j^p=L_n^q\)
- scientific article; zbMATH DE number 7157983 (Why is no real title available?)
- One Erdös style inequality
- scientific article; zbMATH DE number 278889 (Why is no real title available?)
- Polynomial values of surface point counting polynomials
- On power values of pyramidal numbers, II
- The Diophantine equation f(x)=g(y)$f(x)=g(y)$ for polynomials with simple rational roots
- Sums or products of double factorials in Lucas sequences
- On a diophantine problem of P. Erdős
- Fixers and derangements of finite permutation groups
- Polynomial values of sums of hyperbolic binomial coefficients
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)