Type: Article
Publication Date: 2015-01-01
Citations: 25
DOI: https://doi.org/10.1112/s1461157015000182
We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k| \leq 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.