The ABC conjecture

Establish the ABC conjecture: For every ε > 0 there exists a constant Kε such that for any integers a, b, c with a + b = c, one has c ≤ Kε rad(abc)^{1+ε}, where rad(n) denotes the product of the distinct prime divisors of n.

Background

The authors include the ABC conjecture as a central statement in Diophantine analysis. As they note, it would imply Fermat’s Last Theorem for all sufficiently large exponents n, providing a unifying explanation for the rarity of large solutions to a + b = c when a, b, c share many prime factors.

Despite claims of proofs, the conjecture remains broadly treated as open within the number theory community, and the authors present it in its standard quantitative form.

References

Conjecture 12.1 (The ABC Conjecture). For every E > 0, there exists Ke such that for any integers a, b, c satisfying a + b = c, we have c ≤ Kerad(abc)1+€.

— Understanding Fermat's Last Theorem's Proofs (2508.10362 - Qiu et al., 14 Aug 2025) in Appendix 12.2 (The ABC Conjecture)

The well-known abc conjecture of Masser and Oesterlé asserts that, for any λ < 1, there are only finitely many abc triples of exponent λ.

— Bounds on the exceptional set in the $abc$ conjecture (2410.12234 - Browning et al., 16 Oct 2024) in Section 1. Introduction

Conjecture [ABC conjecture] For every positive real number $\varepsilon > 0$, there exist only finitely many triples of coprime integers $(a, b, c)$ such that $a+b = c$ and

c > rad(abc){1 + \varepsilon}.

Here, $rad(n) = \prod_{p|n} p$ is the product of all prime factors of $n$.

— Formalizing Mason-Stothers Theorem and its Corollaries in Lean 4 (2408.15180 - Baek et al., 27 Aug 2024) in Section 1, Introduction (Conjecture [ABC conjecture])