ABC conjecture for coprime integer triples

For every ϵ>0\epsilon>0, let CϵC_\epsilon denote a constant depending only on ϵ\epsilon. Consider nonzero integers a,b,ca,b,c satisfying gcd(a,b,c)=1\gcd(a,b,c)=1 and a+b=ca+b=c, and define

rad(abc)=pabcp.\operatorname{rad}(abc)=\prod_{p\mid abc}p.

ABC conjecture. For every ϵ>0\epsilon>0, there is a constant CϵC_\epsilon such that

max{a,b,c}Cϵrad(abc)1+ϵ.\max\{|a|,|b|,|c|\}\leq C_\epsilon\operatorname{rad}(abc)^{1+\epsilon}.

The conjecture is recalled as a conditional tool for studying uniform bounds on Diophantine tuples and related quantities.

Equivalent formulations 1

Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.

  1. The abc conjecture for coprime integer triples

    Let (a,b,c)(a,b,c) be a triple of coprime positive integers satisfying a+b=ca+b=c. The abc conjecture. For every positive real number ϵ\epsilon, there exists a positive real number C(ϵ)C(\epsilon) such that

    c<C(ϵ)rad(abc)1+ϵ.c<C(\epsilon)\operatorname{rad}(abc)^{1+\epsilon}.

    This conjecture is a central reformulation of Szpiro's conjecture and has numerous consequences in Diophantine number theory; the supplied text gives no resolution.

    source: Robin Zhang, “The abcd conjecture, uniform boundedness, and dynamical systems”, arXiv:2206.09725 (2024).

Sources & referencesView supporting material

Primary source

Ernie Croot and Chi Hoi Yip, “Diophantine tuples and product sets in shifted powers”, arXiv:2504.04354 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.