Primitive sets and an Euler phi function for subsets of {1,2,...,n}

Publication date 6 August 2006

Arithmetic functions; related numbers; inversion formulas (11A25) Other combinatorial number theory (11B75) Density, gaps, topology (11B05) Additive bases, including sumsets (11B13)

Abstract: A nonempty subset A of {1,2,...,n} is called primitive if gcd(A)=1. Let f(n) and f_k(n) denote, respectively, the number of primitive subsets and the number of primitive subsets of cardinality k of {1,2,...,n}. Recursion formulas and asymptotic estimates are obtained for both functions.

This page was built for publication: Primitive sets and an Euler phi function for subsets of {1,2,...,n}

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