Journal article
Partitions whose parts are pairwise relatively prime
Discrete mathematics, v 81(1), pp 87-89
01 Apr 1990
Abstract
Let
a
n
be the number of (unordered) partitions of
n into parts that are “pairwise” relatively prime. In other words, count λ = {λ
1, λ
2,…} if and only if gcd(λ
i
,
j
) = 1 for all
i ≠
j. We show that log
a
n
∼
2π
√6
nlog(
n
Metrics
2 Record Views
Details
- Title
- Partitions whose parts are pairwise relatively prime
- Creators
- Eric Schmutz - University of Pennsylvania
- Publication Details
- Discrete mathematics, v 81(1), pp 87-89
- Publisher
- Elsevier
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Mathematics
- Web of Science ID
- WOS:A1990DC07500009
- Scopus ID
- 2-s2.0-44949290426
- Other Identifier
- 991021864176504721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Mathematics