arXiv Analytics

Sign in

arXiv:1406.6809 [math.NT]AbstractReferencesReviewsResources

An elementary proof of the halting property for Chakravala algorithm

Anne Bauval

Published 2014-06-26Version 1

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.

Categories: math.NT
Related articles: Most relevant | Search more
arXiv:1108.2361 [math.NT] (Published 2011-08-11)
An elementary proof of a congruence by Skula and Granville
arXiv:1106.1627 [math.NT] (Published 2011-06-08, updated 2011-06-09)
Retraction of 'Elementary proof of the Giuga-Agoh conjecture'
arXiv:1705.03011 [math.NT] (Published 2017-05-08)
An Elementary Proof for Ljunggren Equation

Links

Toolbox