{
  "id": "1512.08382",
  "version": "v1",
  "published": "2015-12-28T12:01:09.000Z",
  "updated": "2015-12-28T12:01:09.000Z",
  "title": "The Least Prime Number in a Beatty Sequence",
  "authors": [
    "Jörn Steuding",
    "Marc Technau"
  ],
  "comment": "17 pages",
  "categories": [
    "math.NT"
  ],
  "abstract": "We prove an upper bound for the least prime in an irrational Beatty sequence. This result may be compared with Linnik's theorem on the least prime in an arithmetic progression.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-12-28T12:01:09.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "prime number",
      "irrational beatty sequence",
      "arithmetic progression",
      "linniks theorem"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 17,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}