Primitive sets and an Euler phi function for subsets of {1,2,...,n}
| dc.creator | Nathanson, Melvyn B. | |
| dc.date | 2006-08-06 | |
| dc.date | 2007-09-16 | |
| dc.date.accessioned | 2026-07-07T08:29:44Z | |
| dc.date.available | 2026-07-07T08:29:44Z | |
| dc.description | 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. | |
| dc.description | This paper, revised and retitled "Affine invariants, relatively prime sets, and a phi function for subsets of {1,2,...,n}," has been published in Integers 7 (2007), A!, pages 1-7 | |
| dc.identifier | https://arxiv.org/abs/math/0608150 | |
| dc.identifier | http://arxiv.org/abs/math/0608150 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/138045 | |
| dc.subject | Number Theory | |
| dc.subject | Combinatorics | |
| dc.subject | 11A25, 11B05, 11B13, 11B75 | |
| dc.title | Primitive sets and an Euler phi function for subsets of {1,2,...,n} | |
| dc.type | text |