Primitive sets and an Euler phi function for subsets of 1,2,...,n
Abstract
A nonempty subset A of 1,2,...,n is called primitive if gcd(A)=1. Let f(n) and fk(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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.