An elementary proof of the halting property for Chakravala algorithm
arXiv:1406.6809
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.