A sum of gcd's over friable numbers (Q2808559)

From the text: We study the function NEWLINE\[ g(n,y) := \sum_{\substack{i\le n \\ P(i) \le y}} \gcd(i,n), \] NEWLINENEWLINEwhere \(P(n)\) denotes the largest prime factor of \(n\), and we derive some estimates for its summatory function. The following theorems are proved (set \(u := \log x/ \log y\)).NEWLINENEWLINETheorem 3. For y fixed, we have, as \(x\to\infty\) NEWLINENEWLINE\[ G(x, y) = \left( \frac{1}{(2\pi(y))!} \prod_{p\le y} \frac{p-1}{p(\log p)^2}\right) x(\log x)^{2\pi(y)} + O(x(\log x)^{2\pi(y)-1}),\] NEWLINENEWLINEwhere\(\pi(y)\) denotes the prime counting function.NEWLINENEWLINETheorem 4. We have NEWLINENEWLINE\[ G(x, y) = \frac{3x^2\rho_2(u) \log y}{\pi^2} \left(1 + O\left(\frac{\log(u + 1)}{\log y}\right)\right), \] NEWLINENEWLINEuniformly for \(\exp((\log \log x)^{\frac53 + \varepsilon} \le y \le x\), where \(\rho_2(u)\) is the continuous solution to the delayed differential equation NEWLINE\[ \begin{cases} \rho_2(u) = u, &\text{if}\quad 0 \le u\le 1; \\ CARRIAGE_RETURNNEWLINEu\rho'_2(u) - \rho_2(u) + 2\rho_2(u-1) = 0, &\text{if}\quad u > 1.\end{cases} \]