Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the exceptional set in the abcabc conjecture

Published 19 Jun 2025 in math.NT | (2507.02885v1)

Abstract: The abcabc conjecture states that there are only finitely many triples of coprime positive integers (a,b,c)(a,b,c) such that a+b=ca+b=c and $\operatorname{rad}(abc) &lt; c<sup>{1-\epsilon}$ for any $\epsilon &gt; 0$. Using the optimized methods in a recent work of Browning, Lichtman and Ter\"av\"ainen, we showed that the number of those triples with c⩽Xc \leqslant X is O(X<sup>56/85+ε)O\left(X<sup>{56/85+\varepsilon}\right) for any $\varepsilon &gt; 0$, where 5685≈0.658824\frac{56}{85} \approx 0.658824. This constitutes an improvement of the previous bound O(X<sup>33/50)O\left(X<sup>{33/50}\right).

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.