An elementary proof of the halting property for Chakravala algorithm
Number Theory
2014-06-27 v1
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.
Cite
@article{arxiv.1406.6809,
title = {An elementary proof of the halting property for Chakravala algorithm},
author = {Anne Bauval},
journal= {arXiv preprint arXiv:1406.6809},
year = {2014}
}