These curves were closely studied by Louis Mordell, from the point of view of determining their integer points. He showed that every Mordell curve contains only finitely many integer points (x, y). In other words, the differences of perfect squares and perfect cubes tend to ∞. 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.
If (x, y) is an integer point on a Mordell curve, then so is (x, -y).
There are certain values of n for which the corresponding Mordell curve has no integer solutions; these values are:
- 6, 7, 11, 13, 14, 20, 21, 23, 29, 32, 34, 39, 42, ... (sequence A054504 in the OEIS).
- -3, -5, -6, -9, -10, -12, -14, -16, -17, -21, -22, ... (sequence A081121 in the OEIS).
In 2015, M. A. Bennett and A. Ghadermarzi computed integer points for 0 < |n| ≤ 107.
Fermat proved that the only integer solutions of are .
- Weisstein, Eric W. "Mordell Curve". MathWorld.
- Louis Mordell (1969). Diophantine Equations.
- Gebel, J.; Pethö, A.; Zimmer, H. G. (1998). "On Mordell's equation". Compositio Mathematica. 110 (3): 335–367. doi:10.1023/A:1000281602647.
- Sequences OEIS: A081119 and OEIS: A081120.
- M. A. Bennett, A. Ghadermarzi (2015). "Mordell's equation : a classical approach" (PDF). LMS Journal of Computation and Mathematics. 18: 633–646. arXiv:1311.7077. doi:10.1112/S1461157015000182.