On the number of k-compositions n satisfying certain coprimality conditions

From MaRDI portal
Publication:2043682



Abstract: We generalize the asymptotic estimates by Bubboloni, Luca and Spiga (2012) on the number of k-compositions of n satisfying some coprimality conditions. We substantially refine the error term concerning the number of k-compositions of n with pairwise relatively prime summands. We use a different approach, based on properties of multiplicative arithmetic functions of k variables and on an asymptotic formula for the restricted partition function.


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.











This page was built for publication: On the number of \(k\)-compositions \(n\) satisfying certain coprimality conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043682)