A New Lower Bound in the abc Conjecture
Abstract
We prove that there exist infinitely many coprime numbers a, b, c with a+b=c and c>rad(abc)(6.563 c/ 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) who 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 42δ/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/δ.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.