相关论文: Aryabhata's Root Extraction Methods

This paper presents certains aspects of the mathematics of Aryabhata that are of interest to the cryptography community.

We discuss the babylonian method of extracting the root square of a number, from the point of view of modern mathematics. We also speculate that the babylonian mathematics was rich enough for a generalization of this method, despite the…

Few among us would know that the first mention of the sine and the enumeration of the first sine table are to be credited to Aryabhata. The method to generate this relies on the sine difference formula which is derived using ingenious…

Between the ninth and fifteenth centuries, several Arab mathematicians studied numerical algorithms on integers. The extraction of the square root of an integer is based on an algorithm known at least since al-Khwarizmi (died around 850)…

In point of fact the Indian tradition in mathematics is long and glorious. It dates back to earliest times, and indeed many of the Indian discoveries from 5000 years ago correspond rather naturally to modern mathematical results.

We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…

While reading ancient texts one has to be cognizant of the assumptions made about the past. One has to ask: Are these assumptions valid? Are we projecting the present views into the past? A case in point is the dating of Vedanga Jyotisa.…

This paper examines the theory of a Babylonian origin of Aryabhata's planetary constants. It shows that Aryabhata's basic constant is closer to the Indian counterpart than to the Babylonian one. Sketching connections between Aryabhata's…

Recent analyses of Brahmagupta's discourse on the cyclic quadrilateral, and of Baudh\=ayana's approximate quadrature of the circle, have shown that it is useful to submit mathematical texts to a form of literary analysis. Several passages…

We reconsider Archimedes' evaluations of several square roots in 'Measurement of a Circle'. We show that several methods proposed over the last century or so for his evaluations fail one or more criteria of plausibility. We also provide…

Despite the extensive amount of scholarly work done on Indian mathematics in the last 200 years, the conditions under which it originated and evolved is still not clear. Often, one reads the ancient texts with the present concepts and…

The Chinese Roots of Linear Algebra by Roger Hart chronicles the linear problems of ancient China in the Nine Chapters of the Mathematical Art, and supplies new insights about their solution.

This paper presents an introduction to the Aryabhata algorithm for finding multiplicative inverses and solving linear congruences, both of which have applications in cryptography. We do so by the use of the least absolute remainders. The…

This paper examines how the mathematicians and astronomers of the Kerala school tackled the problem of computing the values of the arcsin function. Four different approaches are discussed all of which are found in Nilakantha Somayaji's…

Sophisticated computation methods were developed 4000 years ago in Mesopotamia in the context of scribal schools. The basics of the computation can be detected in clay tablets written by young students educated in these scribal schools. At…

In 1977, Adleman, Manders and Miller had briefly described how to extend their square root extraction method to the general $r$th root extraction over finite fields, but not shown enough details. Actually, there is a dramatic difference…

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…

Continuous amortization is a technique for computing the complexity of algorithms, and it was first presented by the author in Burr, Krahmer, & Yap (2009). Continuous amortization can result in simpler and more straight-forward complexity…

We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…