2012/02/08 by Daniela Bubboloni, Florian Luca, Bubboloni, Daniela +3
Mathematics · #05A17 #11P81 #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT) #math.CO #math.NT #msc:05A17 #msc:11P81
paper · pdf · doi:10.48550/arxiv.1202.1670
22 pages; 1 table
arxiv created 2012/02/08 · arxiv updated 2012/02/09
A k-composition of n is a sequence of length k of positive integers summing up to n. In this paper, we investigate the number of k-compositions of n satisfying two natural coprimality conditions. Namely, we first give an exact asymptotic formula for the number of k-compositions having the first summand coprime to the others. Then, we estimate the number of k-compositions whose summands are all pairwise coprime.