Recursion and Combinatorial Mathematics in Chandashaastra

Details Recursion and Combinatorial Mathematics in Chandashaastra Recursion and Combinatorial Mathematics in Chandashaastra

2007-03-22

arxiv.org/abs/math/0703658v2

Mathematics

History and Overview

25 pages

Scientific paper

Contribution of Indian Mathematics since Vedic Period has been recognised by the Historians. Pingala (200 BC) in his book on 'Chandashaastra', a text related to the description and analysis of meters in poetic work, describes algorithms which deal with the Combinatorial Mathematics. These algorithms essentially deal with the conversion of Binary numbers to Decimal numbers and vice versa, finding the value of 'n choose r', evaluating 2^n, etc. All these algorithms are recursive in nature. There are also evidences of making use of stack variables to stack the intermediate results for later use. Interestingly later work by Kedar Bhatt (around 800 AD) has only iterative algorithms for the same problems. We describe both the recursive as well as iterative algorithms in this paper.

Affiliated with

Also associated with

No associations

Rating

Recursion and Combinatorial Mathematics in Chandashaastra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Recursion and Combinatorial Mathematics in Chandashaastra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recursion and Combinatorial Mathematics in Chandashaastra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-168484