On a diophantine problem of P. Erdős
By using elementary algebraic number theory, L. J. Mordell solved the equation \(k^ 3 - k = \ell^ 2 - \ell\) in integers \(k\), \(l\) [Pac. J. Math. 13, 1347-1351 (1966; Zbl 0124.274)]. Recently \textit{J. H. E. Cohn} determined all the integer solutions of the equation \(k^ 3 + k = \ell^ 2 - \ell\) [Math. Scand. 68, 171-179 (1993; Zbl 0755.11009)]. It has been asked by Erdős to determine all the integer solutions of the equation \(k^ 3 - k^ 2 = \ell^ 2 - \ell\). In this note, following the arguments of Mordell, the author shows that the only integer solutions of the above equation are given by \((k,\ell) = (0,0),(1,0),(0,1)\) and \((1,1)\).
- scientific article; zbMATH DE number 3979149 (Why is no real title available?)
- scientific article; zbMATH DE number 3216360 (Why is no real title available?)
- On S-integral solutions of the equation y^ m=f(x)
- On Effective Computation of Fundamental Units. II
- On the equation y^m=f(x)
- On the integer solutions of \(y(y+1) = x(x+1) (x+2)\)
- The Diophantine equation X(X + 1) = Y(Y^2 + 1).
- The Diophantine Equation y 2 = ax 3 +bx 2 +cx +d
This page was built for publication: On a diophantine problem of P. Erdős
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689677)