Asymptotic count of primitive sums of three squarefull numbers
Establish the conjectured asymptotic formula N(B)\sim cB^{1/2} as B\to\infty for the number N(B) of primitive positive solutions (a,b,c) to a+b=c in which a, b, and c are respectively 2-full, 2-full, and 2-full, for a suitable constant c>0.
References
This is the case when p=q=r=2, for example, in which case it is conjectured that N(B)\sim c B{1/2}, as B\to \infty, for a suitable constant c>0.
— Sums of three powerful numbers
(2608.24512 - Browning et al., 25 Aug 2026) in Introduction, immediately after the definition of N(B) and the discussion of the log-Fano case p=q=r=2