/-
Copyright 2025 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/importFormalConjecturesUtil
Hall's conjecture
There exists a positive number $C$ such that for any integer $x, y$ with $y^2 \ne x^3$,
$|y^2 - x^3| > C \sqrt{|x|}$.
L. Danilov, The Diophantine equation $x^3 - y^2 = k$ and Hall's conjecture, Mathematical notes of the Academy of Sciences of the USSR 32 (1982): 617-618
Elkies' example $(x, y) = (5853886516781223, 447884928428402042307918)$ shows that such $C$ must be
less than $0.0215$. Note that simple linarith does not work here.
Danilov proved that one cannot replace the exponent $1/2$ with larger number.
In other words, for any $\delta > 0$, there is no positive constant $C$ such that
$|y^2 - x^3| > C |x| ^ {1/2 + \delta}$ for all integers $x, y$ with $y^2 \ne x^3$.