arXiv · 1406.6809
An elementary proof of the halting property for Chakravala algorithm
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.
Explore related subjects
Keep this discovery
Anne Bauval. 2014-06-26. An elementary proof of the halting property for Chakravala algorithm. https://arxiv.org/abs/1406.6809
Cite the original work for its findings. Save a collection to share your selection of sources.