On the number of \(k\)-compositions \(n\) satisfying certain coprimality conditions (Q2043682): Difference between revisions

For \(n,k\in\mathbb{N}=\{1,2,\ldots,\}\) and \(n\ge k\), the \(k\)-composition of \(n\) is a representation \(x_1 + \dots + x_k = n\), where \((x_1, \dots, x_k) \in\mathbb{N}^k\). Let \(A_{k,s}(n)\) be the number of \(k\)-compositions of \(n\) such that the first \(s\) summands in the representation of \(n\) are coprime to the last \(k-s\) summands and let \(B_{k,t}(n)\) be the number of \(k\)-compositions whose summands are \(t\)-wise relatively prime, \(1 \le s \le k-1\) and \(2 \le t \le k\). In this paper, the author generalizes some asymptotic estimates for these two quantities, previously known whenever \(s = 1\), \(t = 2\) and \(t = k\), to arbitrary and fixed values of \(s\), \(t\) and \(k\). Using an approach, based on properties of multiplicative arithmetic functions of \(k\) variables and on an asymptotic formula for the restricted partition function, he refines the previous error estimates.