On the number of pairs of positive integers \(x_1,x_2 \leq H\) such that \(x_1x_2\) is a \(k\)-th power (Q627410)

For \(k\geq 2\) let \(S_k(H)\) be the number of pairs of positive integers \(x_1,x_2\leq H\) such that \(x_1x_2\) is a \(k\)-th power. The author proves that \[ S_k(H)=c_kH^{\frac 2k}(\log H)^{k-1}+O(H^{\frac 2k}(\log H)^{k-2}), \] where \[ c_k=\frac{{\mathcal P}_k}{((k-1)!)^2}\left(1+\frac{1}{k^{k-2}}\sum_{\frac k2<m\leq k-1}\frac{(-1)^{k-m}(2m-k)^{k-1}\binom{k-1}{m}}{k-m}\right), \] \[ {\mathcal P}_k=\prod_p\left(1-\frac 1p\right)^{k-1}\left(1+\frac {k-1}{p}\right). \]