{
  "id": "1707.06893",
  "version": "v1",
  "published": "2017-07-21T13:36:01.000Z",
  "updated": "2017-07-21T13:36:01.000Z",
  "title": "Binomial collisions and near collisions",
  "authors": [
    "Aart Blokhuis",
    "Andries Brouwer",
    "Benne de Weger"
  ],
  "comment": "7 pages",
  "categories": [
    "math.NT"
  ],
  "abstract": "We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for binomial coefficients that seem to be new.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-07-21T13:36:01.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "11B65"
    ],
    "keywords": [
      "binomial collisions",
      "binomial coefficients differ",
      "efficient algorithms",
      "conjecturally complete list"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}