{
  "id": "1406.6809",
  "version": "v1",
  "published": "2014-06-26T08:46:52.000Z",
  "updated": "2014-06-26T08:46:52.000Z",
  "title": "An elementary proof of the halting property for Chakravala algorithm",
  "authors": [
    "Anne Bauval"
  ],
  "categories": [
    "math.NT"
  ],
  "abstract": "In 1930, A.A.K. Ayyangar allegedly produced the missing proof that the ancient Indian Chakravala algorithm, designed to solve Pell's equation, always halts. Refining his own elementary arguments, we give a correct and shorter proof.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-06-26T08:46:52.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "elementary proof",
      "halting property",
      "ancient indian chakravala algorithm",
      "pells equation",
      "shorter proof"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1406.6809B"
    }
  }
}