No label defined (Q4378071)

In a previous paper [Acta Arith. 68, 171-192 (1994; Zbl 0816.11019)] \textit{J. Gebel, A. Pethő} and \textit{H. G. Zimmer} developed an algorithm for computing all integral points on an elliptic curve over the rationals \(\mathbb{Q}\). In the present paper, they use their method to conduct an exhaustive study of Mordell's equation \(y^2=x^3+k\), \(k\neq 0\). They solve Mordell's equation for all integers \(k\) such that \(0<| k|\leq 10000\) and partially extend their computations to \(0<| k|\leq 100000\). Efficient algorithms are given for each step of the solution process. The authors also investigate Hall's conjecture and show that for the values of \(k\) in the given range, the constant turns out to be 5. Further, they give tables of large integer points and make some interesting observations about large generators of the Mordell-Weil group and large Tate-Shafarevich groups. They also give three graphs which indicate the distribution of integer points with respect to \(k\). A truly interesting study of a very old chestnut.