An elementary proof of the halting property for Chakravala algorithm
From MaRDI portal
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.
This page was built for publication: An elementary proof of the halting property for Chakravala algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6252651)
