Ganita Kaumudi

Ganita Kaumudi (Sanskrit: गणितकौमदी) is a treatise on mathematics written by Indian mathematician Narayana Pandita in 1356. It was an arithmetical treatise alongside the other algebraic treatise called "Bijganita Vatamsa" by Narayana Pandit.

Quadratic. 17 rules and 10 examples.^[1] Includes a variant of the Chakravala method.^[2] Ganita Kaumudi contains many results from continued fractions. In the text Narayana Pandita used the knowledge of simple recurring continued fraction in the solutions of indeterminate equations of the type $nx^{2}+k^{2}=y^{2}$ .

11. Bhāgādāna

Contains factorization method,^[1] 11 rules and 7 examples.^[1]

12. Rūpādyaṃśāvatāra

Contains rules for writing a fraction as a sum of unit fractions. 22 rules and 14 examples.^[1]

Unit fractions were known in Indian mathematics in the Vedic period:^[3] the Śulba Sūtras give an approximation of √2 equivalent to $1+{\tfrac {1}{3}}+{\tfrac {1}{3\cdot 4}}-{\tfrac {1}{3\cdot 4\cdot 34}}$ . Systematic rules for expressing a fraction as the sum of unit fractions had previously been given in the Gaṇita-sāra-saṅgraha of Mahāvīra (c. 850).^[3] Nārāyaṇa's Gaṇita-kaumudi gave a few more rules: the section bhāgajāti in the twelfth chapter named aṃśāvatāra-vyavahāra contains eight rules.^[3] The first few are:^[3]

Rule 1. To express 1 as a sum of n unit fractions:^[3]

1={\frac {1}{1\cdot 2}}+{\frac {1}{2\cdot 3}}+{\frac {1}{3\cdot 4}}+\dots +{\frac {1}{(n-1)\cdot n}}+{\frac {1}{n}}

Rule 2. To express 1 as a sum of n unit fractions:^[3]

1={\frac {1}{2}}+{\frac {1}{3}}+{\frac {1}{3^{2}}}+\dots +{\frac {1}{3^{n-2}}}+{\frac {1}{2\cdot 3^{n-2}}}

Rule 3. To express a fraction $p/q$ as a sum of unit fractions:^[3]

Pick an arbitrary number i such that

(q+i)/p

is an integer r, write

{\frac {p}{q}}={\frac {1}{r}}+{\frac {i}{qr}}

and find successive denominators in the same way by operating on the new fraction. If i is always chosen to be the smallest such integer, this is equivalent to the greedy algorithm for Egyptian fractions, but the Gaṇita-Kaumudī's rule does not give a unique procedure, and instead states evam iṣṭavaśād bahudhā ("Thus there are many ways, according to one's choices.")^[3]

Rule 4. Given $n$ arbitrary numbers $k_{1},k_{2},\dots ,k_{n}$ ,^[3]

1={\frac {(k_{2}-k_{1})k_{1}}{k_{2}\cdot k_{1}}}+{\frac {(k_{3}-k_{2})k_{1}}{k_{3}\cdot k_{2}}}+\dots +{\frac {(k_{n}-k_{n-1})k_{1}}{k_{n}\cdot k_{n-1}}}+{\frac {1\cdot k_{1}}{k_{n}}}

Rule 5. To express 1 as the sum of fractions with given numerators $a_{1},a_{2},\dots ,a_{n}$ :^[3]

Calculate

i_{1},i_{2},\dots ,i_{n}

as

i_{1}=a_{1}+1

,

i_{2}=a_{2}+i_{1}

,

i_{3}=a_{3}+i_{2}

, and so on, and write

1={\frac {a_{1}}{1\cdot i_{1}}}+{\frac {a_{2}}{i_{1}\cdot i_{2}}}+{\frac {a_{3}}{i_{2}\cdot i_{3}}}+\dots +{\frac {a_{n}}{i_{n-1}\cdot i_{n}}}+{\frac {1}{i_{n}}}

13. Aṅka-pāśa

Combinatorics. 97 rules and 45 examples.^[1] Generating permutations (including of a multiset), combinations, integer partitions, binomial coefficients, generalized Fibonacci numbers.^[2]

Narayana Pandita noted the equivalence of the figurate numbers and the formulae for the number of combinations of different things taken so many at a time.^[4]

The book contains a rule to determine the number of permutations of n objects and a classical algorithm for finding the next permutation in lexicographic ordering though computational methods have advanced well beyond that ancient algorithm. Donald Knuth describes many algorithms dedicated to efficient permutation generation and discuss their history in his book The Art of Computer Programming.^[5]

14. Bhadragaṇita

Magic squares. 60 rules and 17 examples.^[1]

Editions

"Translation of Ganita Kaumudi with Rationale in modern mathematics and historical notes" by S L Singh, Principal, Science College, Gurukul Kangri Vishwavidyalaya, Haridwar
Ganita Kaumudi, Volume 1–2, Nārāyana Pandita (Issue 57 of Princess of Wales Sarasvati Bhavana Granthamala: Abhinava nibandhamālā Padmakara Dwivedi Jyautishacharya 1936)

References

Notes

^ ^a ^b ^c ^d ^e ^f ^g ^h ⁱ ^j ^k ^l ^m ⁿ ^o ^p M. D. Srinivas, Mathematics In India, Lecture 27.
^ ^a ^b ^c ^d ^e ^f M. S. Sriram, Mathematics in India, Lecture 25.
^ ^a ^b ^c ^d ^e ^f ^g ^h ⁱ ^j Kusuba 2004, p. 497
^ Edwards, A. W. F. Pascal's Arithmetical Triangle: The Story of a Mathematical Idea. JHU Press. p. 16.
^ Knuth, Donald (2006). The Art of Computer Programming. Addison-Wesley. p. 74.

Bibliography

Kusuba, Takanori (2004), "Indian Rules for the Decomposition of Fractions", in Charles Burnett; Jan P. Hogendijk; Kim Plofker; et al. (eds.), Studies in the History of the Exact Sciences in Honour of David Pingree, Brill, ISBN 9004132023, ISSN 0169-8729
M. D. Srinivas, M. S. Sriram, K. Ramasubramanian, Mathematics in India - From Vedic Period to Modern Times. Lectures 25–27.

External links

[mii27-1] ^ ^a ^b ^c ^d ^e ^f ^g ^h ⁱ ^j ^k ^l ^m ⁿ ^o ^p M. D. Srinivas, Mathematics In India, Lecture 27.

[mii25-2] ^ ^a ^b ^c ^d ^e ^f M. S. Sriram, Mathematics in India, Lecture 25.

[k497-3] ^ ^a ^b ^c ^d ^e ^f ^g ^h ⁱ ^j Kusuba 2004, p. 497

[4] Edwards, A. W. F. Pascal's Arithmetical Triangle: The Story of a Mathematical Idea. JHU Press. p. 16.

[5] Knuth, Donald (2006). The Art of Computer Programming. Addison-Wesley. p. 74.

[1]

[2]

[3]

[4]

[5]

Fahrer / Team für die Suche eingeben:

Fahrer / Team für die Suche eingeben:

Eisspeedway

Ganita Kaumudi

Contents

1. Prakīrṇaka-vyavahāra

2. Miśraka-vyavahāra

3. Śreḍhī-vyavahāra

4. Kṣetra-vyavahāra

5. Khāta-vyavahāra

6. Citi-vyavahāra

7. Rāśi-vyavahāra

8. Chāyā-vyavahāra

9. Kuṭṭaka

10. Vargaprakṛti