English

A New Lower Bound in the $abc$ Conjecture

Number Theory 2024-06-05 v2 Discrete Mathematics

Abstract

We prove that there exist infinitely many coprime numbers aa, bb, cc with a+b=ca+b=c and c>rad(abc)exp(6.563logc/loglogc)c>\operatorname{rad}(abc)\exp(6.563\sqrt{\log c}/\log\log c). These are the most extremal examples currently known in the abcabc 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.0686.068 in place of 6.5636.563. We show that the constant 6.5636.563 may be replaced by 42δ/e4\sqrt{2\delta/e} where δ\delta is a constant such that all full-rank unimodular lattices of sufficiently large dimension nn contain a nonzero vector with 1\ell_1 norm at most n/δn/\delta.

Keywords

Cite

@article{arxiv.2301.11056,
  title  = {A New Lower Bound in the $abc$ Conjecture},
  author = {Curtis Bright},
  journal= {arXiv preprint arXiv:2301.11056},
  year   = {2024}
}
R2 v1 2026-06-28T08:21:12.447Z