arXiv:0709.2930 [math.NT]AbstractReferencesReviewsResources
Asymptotic estimates for phi functions for subsets of {m+1, m+2,...,n}
Melvyn B. Nathanson, Brooke Orosz
Published 2007-09-18Version 1
Let f(m,n) denote the number of relatively prime subsets of {m+1,m+2,...,n}, and let Phi(m,n) denote the number of subsets A of {m+1,m+2,...,n} such that gcd(A) is relatively prime to n. Let f_k(m,n) and Phi_k(m,n) be the analogous counting functions restricted to sets of cardinality k. Simple explicit formulas and asymptotic estimates are obtained for these four functions.
Comments: 5 pages
Related articles: Most relevant | Search more
arXiv:1002.3254 [math.NT] (Published 2010-02-17)
Combinatorial Identities Via Phi Functions and Relatively Prime Subsets
arXiv:0910.4674 [math.NT] (Published 2009-10-24)
On Relatively Prime Subsets and Supersets
arXiv:0912.1518 [math.NT] (Published 2009-12-08)
Combinatorial Identities Involving Mertens Function Through Relatively Prime Subsets