A New Lower Bound in the abc Conjecture

01/26/2023
by   Curtis Bright, et al.
0

We prove that there exist infinitely many coprime numbers a, b, c with a+b=c and c>rad(abc)exp(6.563√(log c)/loglog c). These are the most extremal examples currently known in the abc conjecture, thereby providing a new lower bound on the tightest possible form of the conjecture. This builds on work of van Frankenhuysen (1999) whom proved the existence of examples satisfying the above bound with the constant 6.068 in place of 6.563. We show that the constant 6.563 may be replaced by 4√(2δ/e) where δ is a constant such that all full-rank unimodular lattices of sufficiently large dimension n contain a nonzero vector with ℓ_1 norm at most n/δ.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset