{
  "id": "0705.3749",
  "version": "v1",
  "published": "2007-05-25T11:28:54.000Z",
  "updated": "2007-05-25T11:28:54.000Z",
  "title": "Difference sets and shifted primes",
  "authors": [
    "Jason Lucier"
  ],
  "comment": "22 pages",
  "categories": [
    "math.NT"
  ],
  "abstract": "We show that if A is a subset of {1, ..., n} such that it has no pairs of elements whose difference is equal to p-1 with p a prime number, then the size of A is O(n(loglog n)^(-clogloglogloglog n)) for some positive constant c.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2007-05-25T11:28:54.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "11P55",
      "11B83"
    ],
    "keywords": [
      "difference sets",
      "shifted primes",
      "prime number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 22,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007arXiv0705.3749L"
    }
  }
}