Lower bounds for numbers of \(ABC\)-hits (Q927737)

The author considers triplets \((a,b,c)\) of positive integers such that \(a+b=c\) and \(\gcd(a,b,c)=1\). The \(ABC\)-conjecture states that for every \(\varepsilon>0\) there exist at most finitely such triples for which \(c>(\text{rad}(abc))^{1+\varepsilon}\); a triple for which \(\text{rad}(abc)>c\) is called an \(ABC\)-hit. Denote by \(N(X)\) the number of \(ABC\)-hits \((a,b,c)\) with \(c\leq X\). The author proves that for every \(\varepsilon>0\) one has \[ N(X) \gg \exp ((\log X)^{1/2-\varepsilon}). \] Note that \textit{G. Geuze} and \textit{B. de Smit} [Nieuw Arch. Wiskd. (5) 8, No. 1, 26--30 (2007)] proved that \(N(X) \ll X ^{2/3+\varepsilon}\) for every \(\varepsilon>0\).