Compositions of n Satisfying Some Coprimality Conditions
Number Theory
2012-02-09 v1 Combinatorics
Abstract
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.
Keywords
Cite
@article{arxiv.1202.1670,
title = {Compositions of n Satisfying Some Coprimality Conditions},
author = {Daniela Bubboloni and Florian Luca and Pablo Spiga},
journal= {arXiv preprint arXiv:1202.1670},
year = {2012}
}
Comments
22 pages; 1 table