Probability that the \(k\)-gcd of products of positive integers is \(B\)-friable (Q301413)

Let \(m\) and \(n\) be fixed positive integer numbers and let \(\{r_{ij},1\leq i\leq m, 1\leq j \leq n\}\) be integers uniformly and independently chosen in the interval \([1,N]\). For the prime numbers \(p_1<p_2<\ldots \) large than \(B\) let us denote by \(T_k(N,l)\) the number of ordered pairs \((r_{ij})\) such that NEWLINE\[NEWLINE \text{gcd}_k\Big(\prod_{j=1}^nr_{1j},\prod_{j=1}^nr_{2j}, \ldots, \prod_{j=1}^nr_{mj} \Big) NEWLINE\]NEWLINE is coprime to \(p_1,p_2,\ldots, p_l\), where \(\text{gcd}_k(x_1,x_2, \ldots, x_m)\) denotes the largest \(k\)-th power that divides \(x_1, x_2,\ldots x_m\).NEWLINENEWLINEIn this paper, the authors study the limiting behaviour of quantities \(T_k(N,l)/N^{mn}\). For instance, they derive that NEWLINE\[NEWLINE \lim_{N\rightarrow\infty}\frac{T_1(N,l)}{N^{mn}}=\prod_{i=1}^l\bigg(1-\Big(1-\Big(1-\frac{1}{p_i}\Big)^n\Big)^m\bigg). NEWLINE\]