Mordell curve

He showed that every Mordell curve contains only finitely many integer points (x, y).

The question of how fast was dealt with in principle by Baker's method.

Hypothetically this issue is dealt with by Marshall Hall's conjecture.

In 1998, J. Gebel, A. Pethö, H. G. Zimmer found all integers points for 0 < |n| ≤ 104.

[5][6] In 2015, M. A. Bennett and A. Ghadermarzi computed integer points for 0 < |n| ≤ 107.