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 , , with and . These are the most extremal examples currently known in the 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 in place of . We show that the constant may be replaced by where is a constant such that all full-rank unimodular lattices of sufficiently large dimension contain a nonzero vector with norm at most .
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}
}