Mordell's equation : a classical approach

Abstract

We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k|\le 10^7$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower bounds for linear forms in logarithms in conjunction with lattice-basis reduction.

Cited by in corpus (3)

• Formalized Class Group Computations and Integral Points on Mordell Elliptic Curves
• Perfect codes over non-prime power alphabets: an approach based on Diophantine equations
• Integral points on cubic twists of Mordell curves