Marshall Hall's conjecture

In mathematics, Hall's conjecture is an open question, as of 2015^[update], on the differences between perfect squares and perfect cubes. It asserts that a perfect square y² and a perfect cube x³ that are not equal must lie a substantial distance apart. This question arose from consideration of the Mordell equation in the theory of integer points on elliptic curves.

The original version of Hall's conjecture, formulated by Marshall Hall, Jr. in 1970, says that there is a positive constant C such that for any integers x and y for which y² ≠ x³,

Hall suggested that perhaps C could be taken as 1/5, which was consistent with all the data known at the time the conjecture was proposed. Danilov showed in 1982 that the exponent 1/2 on the right side (that is, the use of |x|^1/2) can't be replaced by any higher power: for no δ > 0 is there a constant C such that |y² - x³| > C|x|^{1/2 + δ} whenever y² ≠ x³.

In 1965, Davenport proved an analogue of the above conjecture in the case of polynomials: if f(t) and g(t) are nonzero polynomials over C such that g(t)³ ≠ f(t)² in C[t], then

The weak form of Hall's conjecture, stated by Stark and Trotter around 1980, replaces the square root on the right side of the inequality by any exponent less than 1/2: for any ε > 0, there is some constant c(ε) depending on ε such that for any integers x and y for which y² ≠ x³,

The original, strong, form of the conjecture with exponent 1/2 has never been disproved, although it is no longer believed to be true and the term Hall's conjecture now generally means the version with the ε in it. For example, in 1998, Noam Elkies found the example

447884928428402042307918² - 5853886516781223³ = -1641843,

...
Wikipedia