{
  "id": "math/0002098",
  "version": "v1",
  "published": "2000-02-12T19:12:39.000Z",
  "updated": "2000-02-12T19:12:39.000Z",
  "title": "Partitions with parts in a finite set",
  "authors": [
    "Melvyn B. Nathanson"
  ],
  "comment": "5 pages. To appear in the Proceedings of the American Mathematical Society",
  "categories": [
    "math.NT",
    "math.CO"
  ],
  "abstract": "Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2000-02-12T19:12:39.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "11P81",
      "11P82",
      "11B34",
      "05A17"
    ],
    "keywords": [
      "partitions",
      "nonempty finite set",
      "elementary arithmetic argument",
      "asymptotic formula",
      "relatively prime positive integers"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 5,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2000math......2098N"
    }
  }
}