The $abc$ conjecture is true almost always

Let ${\rm rad}(n)$ denote the product of distinct prime factors of an integer $n\geq 1$. The celebrated $abc$ conjecture asks whether every solution to the equation $a+b=c$ in triples of coprime integers $(a,b,c)$ must satisfy ${\rm rad}(abc) > K_\varepsilon\, c^{1-\varepsilon}$, for some constant $K_\varepsilon>0$. In this expository note, we present a classical estimate of de Bruijn that implies almost all such triples satisfy the $abc$ conjecture, in a precise quantitative sense. Namely, there are at most $O(N^{2/3})$ many triples of coprime integers in a cube $(a,b,c)\in\{1,\ldots,N\}^3$ satisfying $a+b=c$ and ${\rm rad}(abc) < c^{1-\varepsilon}$. The proof is elementary and essentially self-contained. Beyond revisiting a classical argument for its own sake, this exposition is aimed to contextualize a new result of Browning, Lichtman, and Ter\"av\"ainen, who prove a refined estimate $O(N^{33/50})$, giving the first power-savings since 1962.