Narayana Pandita – Combinatorics, Permutations & Magic Squares
A Comprehensive Research Guide to the 14th-Century Mathematician and His Ganita Kaumudi
नारायण पंडित – संयोजनात्मक गणित, क्रमचय और जादुई वर्ग
14वीं शताब्दी के गणितज्ञ और उनके गणित कौमुदी पर विस्तृत शोध मार्गदर्शिका
Narayana Pandita was a major Indian mathematician of the fourteenth century. The project identifies him as a mathematician known for important work in combinatorics, permutations and numerical methods. His best-known work, Ganita Kaumudi, contains systematic treatments of arithmetic, number sequences, combinatorial enumeration and magic squares.
MacTutor records that he composed Ganita Kaumudi in 1356 and that he was strongly influenced by Bhaskara II. The same source notes that the thirteenth chapter deals with sequences and the fourteenth with magic squares and related figures.
Historical note: The surviving evidence is much stronger for Narayana's mathematical works than for the details of his personal life. MacTutor gives his dates only approximately, while the project places him broadly in the 14th century.
नारायण पंडित 14वीं शताब्दी के प्रमुख भारतीय गणितज्ञ थे। Project उन्हें combinatorics, permutations और numerical methods में महत्वपूर्ण कार्य करने वाले mathematician के रूप में पहचानता है। उनकी प्रसिद्ध रचना गणित कौमुदी में अंकगणित, number sequences, combinatorial enumeration और magic squares का व्यवस्थित अध्ययन मिलता है।
MacTutor के अनुसार उन्होंने गणित कौमुदी की रचना 1356 में की और वे भास्कर द्वितीय से प्रभावित थे। उसी स्रोत के अनुसार 13वां अध्याय sequences और 14वां अध्याय magic squares तथा related figures को समर्पित है।
ऐतिहासिक नोट: नारायण के mathematical works के प्रमाण उनकी personal life के विवरण से कहीं मजबूत हैं। MacTutor उनकी dates को approximate देता है, जबकि project उन्हें broadly 14वीं शताब्दी में रखता है।
Life and Historical Setting
Very little is securely known about Narayana Pandita's personal life. MacTutor identifies his father as Nrsimha and gives his life approximately as 1325–1400. Other historical summaries commonly use a nearby range such as c. 1340–1400.
What is much clearer is his place in the Sanskrit mathematical tradition. His works continue the arithmetic and algebraic line associated with Bhaskara II, while expanding the range of topics treated in systematic ways.
His mathematics is particularly important for the history of combinatorial enumeration: instead of treating counting only as an incidental technique, he organized substantial material around permutations, combinations, sequences and related numerical patterns.
जीवन और ऐतिहासिक संदर्भ
नारायण पंडित के personal life के बारे में बहुत कम निश्चित जानकारी है। MacTutor उनके पिता का नाम Nrsimha देता है और उनकी life dates लगभग 1325–1400 बताता है। अन्य historical summaries में c. 1340–1400 जैसी nearby dating भी मिलती है।
जो बात अधिक स्पष्ट है, वह Sanskrit mathematical tradition में उनका स्थान है। उनके works भास्कर द्वितीय से जुड़ी arithmetic और algebraic tradition को आगे बढ़ाते हैं और systematic तरीके से topics का विस्तार करते हैं।
Mathematics के इतिहास में उनका महत्व खास तौर पर combinatorial enumeration के कारण है—उन्होंने counting को केवल incidental technique न मानकर permutations, combinations, sequences और related numerical patterns को व्यवस्थित रूप से प्रस्तुत किया।
Major Works and Mathematical Areas
| Work / Area | Importance |
|---|---|
| Ganita Kaumudi | Major arithmetical treatise, composed in 1356; includes number operations, sequences, combinatorics and magic squares. |
| Bijaganita Vatamsa | An algebraic treatise associated with Narayana and the Bhaskara II tradition. |
| Karmapradipika / Karma-Paddhati | A commentary on Bhaskara II's Lilavati traditionally attributed to Narayana, although authorship is disputed. |
| Combinatorics | Permutations, combinations, number sequences and systematic enumeration. |
| Magic squares | Rules for different classes of perfect magic squares and other magic figures. |
प्रमुख ग्रंथ और गणितीय क्षेत्र
| ग्रंथ / क्षेत्र | महत्व |
|---|---|
| गणित कौमुदी | 1356 में रचित प्रमुख arithmetical treatise; number operations, sequences, combinatorics और magic squares शामिल हैं। |
| बीजगणितावतंस | नारायण से संबद्ध algebraic treatise, जो भास्कर द्वितीय की परंपरा से जुड़ा है। |
| कर्मप्रदीपिका / Karma-Paddhati | भास्कर द्वितीय की Lilavati पर commentary, जिसे परंपरागत रूप से नारायण से जोड़ा जाता है; authorship पर विवाद है। |
| संयोजनात्मक गणित | Permutations, combinations, number sequences और systematic enumeration। |
| जादुई वर्ग | अलग-अलग classes के perfect magic squares और अन्य magic figures के construction rules। |
Arithmetic: From Calculation to Algorithms
Narayana's arithmetic is not merely a collection of isolated numerical tricks. MacTutor describes his treatment of multiplication and the special case of squaring, noting that the associated Karmapradipika contains seven methods of squaring numbers that are not found in other Indian mathematicians' works.
This algorithmic character is important. Classical Indian mathematics frequently expressed procedures as rules that could be applied repeatedly. Narayana's work belongs to that procedural tradition: a mathematical operation is explained through a rule, then illustrated through examples.
Operations
Systematic procedures for arithmetic operations.
Squaring
Multiple computational approaches to obtaining squares.
Approximation
Numerical methods could be used to approach irrational quantities.
Rule + Example
Procedural rules were reinforced by worked numerical examples.
अंकगणित: Calculation से algorithms तक
नारायण का arithmetic केवल अलग-अलग numerical tricks का संग्रह नहीं था। MacTutor multiplication और squaring की चर्चा करते हुए बताता है कि संबंधित Karmapradipika में numbers को square करने की सात methods मिलती हैं जो अन्य Indian mathematicians के works में नहीं मिलतीं।
यह algorithmic character महत्वपूर्ण है। Classical Indian mathematics में procedures को अक्सर rules के रूप में व्यक्त किया जाता था जिन्हें बार-बार apply किया जा सकता था। नारायण इसी procedural tradition का हिस्सा हैं—rule, फिर उसका numerical example।
Operations
Arithmetic operations के systematic procedures।
Squaring
Squares निकालने की multiple computational approaches।
Approximation
Irrational quantities के लिए numerical approximation methods।
Rule + Example
Worked numerical examples के साथ procedural rules।
Combinatorics: A Major Mathematical Contribution
The most distinctive feature of Narayana Pandita's mathematics is his systematic treatment of counting. In the thirteenth chapter of Ganita Kaumudi, known as Net of Numbers or Anka-pasha in modern descriptions, he considers number sequences and combinatorial problems. MacTutor specifically identifies this chapter as being devoted to number sequences.
Modern summaries of the chapter describe rules for permutations, combinations, integer partitions, binomial coefficients and generalized Fibonacci-type sequences. The historical significance is not that Narayana used modern terminology—he did not—but that he developed operational rules for enumerating structured sets of possibilities.
This is one reason Narayana is particularly relevant to a modern audience interested in computer science: permutation generation and combinatorial enumeration are foundational ideas in algorithms, even though Narayana's original setting was classical Sanskrit mathematics.
संयोजनात्मक गणित: एक प्रमुख योगदान
नारायण पंडित के mathematics की सबसे distinctive feature systematic counting है। गणित कौमुदी के 13वें chapter, जिसे modern descriptions में Net of Numbers / Anka-pasha कहा जाता है, number sequences और combinatorial problems पर केंद्रित है। MacTutor विशेष रूप से इसे number sequences का chapter बताता है।
Modern summaries इस chapter में permutations, combinations, integer partitions, binomial coefficients और generalized Fibonacci-type sequences के rules का वर्णन करती हैं। Historical significance यह नहीं कि नारायण modern terminology इस्तेमाल करते थे—वे नहीं करते थे—बल्कि यह कि उन्होंने structured possibilities की enumeration के लिए operational rules विकसित किए।
इसीलिए Narayana modern computer-science audience के लिए भी relevant हैं: permutation generation और combinatorial enumeration algorithms के foundational ideas हैं, भले ही उनका original context classical Sanskrit mathematics था।
Permutations: Generating Arrangements Systematically
A permutation asks a simple but powerful question: if several distinct objects are available, how many different orders can they occupy?
Narayana's combinatorial work includes a rule for the number of permutations of n objects and a classical procedure for generating successive permutations. This is especially striking because it shifts attention from merely knowing that a number of arrangements exists to having a procedure that actually generates them.
Example set
For three distinct objects, the arrangements include ABC, ACB, BAC, BCA, CAB and CBA.
Total count
The familiar modern count is 3! = 6. Narayana's tradition dealt with the general problem of systematic enumeration.
Modern algorithmic language may call such a procedure a permutation-generation algorithm. The historical source is different, but the computational idea—generate each legal arrangement without losing track of the set—is remarkably clear.
क्रमचय: Arrangements को systematic तरीके से generate करना
Permutation एक सरल लेकिन शक्तिशाली प्रश्न पूछता है: यदि कई distinct objects हैं, तो वे कितने अलग orders में रखे जा सकते हैं?
नारायण के combinatorial work में n objects के permutations की संख्या के लिए rule और successive permutations generate करने की classical procedure मिलती है। खास बात यह है कि वे केवल arrangements की संख्या नहीं बताते; उन्हें generate करने की procedure की दिशा में जाते हैं।
उदाहरण
तीन distinct objects के arrangements: ABC, ACB, BAC, BCA, CAB और CBA।
कुल संख्या
Modern count 3! = 6 है। Narayana tradition general systematic enumeration problem से जुड़ी है।
Modern algorithmic language में इसे permutation-generation algorithm कहा जा सकता है। Historical context अलग है, लेकिन computational idea—हर legal arrangement को systematically generate करना—स्पष्ट रूप से महत्वपूर्ण है।
Sequences, Progressions and Counting Patterns
Narayana's thirteenth chapter deals with number sequences and includes problems related to arithmetic progressions. This is significant because sequences provide a bridge between elementary calculation and structural mathematics: once a sequence is described by a rule, its later terms can be generated without listing every case independently.
Modern discussions of Narayana also associate his combinatorial work with generalized Fibonacci-type sequences. Such connections should be presented carefully: the historical text has its own terminology and problem context, while modern mathematics interprets some of its rules using contemporary recurrence language.
Interpretive principle: “anticipates” or “is equivalent to” is safer than claiming that Narayana was using modern sequence notation. The underlying counting structure can be mathematically equivalent without the historical notation being the same.
Sequences, progressions और counting patterns
नारायण का 13वां chapter number sequences से संबंधित है और arithmetic progressions की problems भी रखता है। इसका महत्व इसलिए है कि sequences elementary calculation और structural mathematics के बीच bridge बनाती हैं: एक rule मिलने के बाद आगे के terms निकाले जा सकते हैं।
Modern discussions Narayana के combinatorial work को generalized Fibonacci-type sequences से भी जोड़ती हैं। इसे सावधानी से प्रस्तुत करना चाहिए: historical text की अपनी terminology और problem-context था, जबकि modern mathematics कुछ rules को contemporary recurrence language में interpret करती है।
Interpretive principle: “anticipates” या “is equivalent to” कहना अधिक सुरक्षित है, बजाय यह दावा करने के कि Narayana modern sequence notation इस्तेमाल करते थे। Mathematical structure equivalent हो सकता है, notation historical रूप से अलग हो सकती है।
Algebra, Indeterminate Equations and Numerical Approximation
Narayana's mathematical range extends beyond combinatorics. MacTutor records his work on equations and numerical approximation, including solutions connected with the second-order indeterminate equation and approximations to square roots.
One striking example in MacTutor's biography gives the fraction 227379/8658 as an approximation to √10 correct to eight decimal places. The point is not merely the decimal value; it shows how algebraic and arithmetic procedures could be combined to obtain highly accurate numerical approximations without modern decimal algorithms.
His association with Bijaganita Vatamsa also places him firmly in the algebraic tradition that followed Bhaskara II.
बीजगणित, अनिर्धार्य समीकरण और numerical approximation
नारायण का mathematics combinatorics से आगे भी जाता है। MacTutor equations और numerical approximation पर उनके work का उल्लेख करता है, जिसमें second-order indeterminate equation और square roots के approximations से संबंधित methods शामिल हैं।
MacTutor का एक striking example 227379/8658 को √10 के approximation के रूप में देता है, जो आठ decimal places तक accurate है। इसका महत्व केवल decimal value नहीं, बल्कि यह है कि algebraic और arithmetic procedures को मिलाकर high-accuracy numerical approximation प्राप्त किया जा सकता था।
बीजगणितावतंस से उनका संबंध उन्हें भास्कर द्वितीय के बाद विकसित algebraic tradition में भी firmly रखता है।
Magic Squares and “Bhadraganita”
The final chapter of Ganita Kaumudi is devoted to magic squares and related figures. MacTutor says Narayana gave rules for constructing doubly even, even and odd perfect magic squares, as well as magic triangles, rectangles and circles.
A magic square is a square arrangement of numbers in which the relevant rows, columns and usually the two main diagonals have the same sum. The mathematical challenge is not just finding one example but constructing families of such objects according to reproducible rules.
Odd order
Magic-square constructions for odd-sized squares.
Even order
Rules addressing even-sized cases, including doubly-even structures.
Triangles
Related magic figures beyond the square grid.
Rectangles & circles
Extended numerical configurations with balancing constraints.
जादुई वर्ग और “भद्रगणित”
गणित कौमुदी का अंतिम chapter magic squares और related figures को समर्पित है। MacTutor के अनुसार नारायण ने doubly even, even और odd perfect magic squares के construction rules दिए, साथ ही magic triangles, rectangles और circles पर भी चर्चा की।
Magic square में numbers को इस तरह arrange किया जाता है कि relevant rows, columns और सामान्यतः दोनों main diagonals का sum समान हो। Mathematical challenge केवल एक example बनाना नहीं, बल्कि reproducible rules से ऐसे objects की families बनाना है।
Odd order
Odd-sized magic squares के constructions।
Even order
Even-sized cases, including doubly-even structures।
Triangles
Square grid से आगे related magic figures।
Rectangles & circles
Balancing constraints वाले extended numerical configurations।
Geometry and Approximation
Narayana's works also contain geometrical rules and numerical problems. Historical summaries associate him with work on cyclic quadrilaterals and with approximation techniques for irrational quantities. These subjects reinforce the broad character of his mathematics: arithmetic procedures, algebraic equations, geometric relations and combinatorial counting were treated within one connected mathematical culture.
It is useful to resist modern disciplinary boundaries here. A fourteenth-century Sanskrit mathematician did not necessarily separate “computer science,” “number theory,” “algebra,” and “recreational mathematics” into the modern categories we use today.
ज्यामिति और approximation
नारायण के works में geometrical rules और numerical problems भी मिलते हैं। Historical summaries उन्हें cyclic quadrilaterals और irrational quantities के approximation techniques से जोड़ती हैं। ये subjects उनके mathematics के broad character को दिखाते हैं: arithmetic procedures, algebraic equations, geometric relations और combinatorial counting एक connected mathematical culture में आते थे।
यहाँ modern disciplinary boundaries से सावधान रहना उपयोगी है। 14वीं शताब्दी के Sanskrit mathematician के लिए “computer science,” “number theory,” “algebra” और “recreational mathematics” जैसी modern categories अलग-अलग departments नहीं थीं।
Legacy in the History of Mathematics
Narayana Pandita occupies an important place between the classical arithmetic-algebraic tradition of Bhaskara II and the later flowering of Indian mathematical astronomy, including the Kerala school. MacTutor's historical project places him among the notable mathematicians whose work helped carry the classical tradition forward.
| Contribution | Why it matters today |
|---|---|
| Combinatorial counting | Connects arithmetic with systematic enumeration. |
| Permutation generation | Conceptually related to algorithmic generation of discrete structures. |
| Number sequences | Shows how rules can generate and analyze structured numerical patterns. |
| Magic squares | Combines constraints, construction algorithms and discrete mathematics. |
| Algebraic approximation | Demonstrates powerful numerical reasoning without modern computational machinery. |
His strongest modern relevance is therefore not one isolated “invention,” but the combination of algorithmic thinking, enumeration, algebra and structured numerical construction.
गणित के इतिहास में विरासत
नारायण पंडित भास्कर द्वितीय की classical arithmetic-algebraic tradition और बाद की Indian mathematical astronomy, जिसमें Kerala school भी शामिल है, के बीच एक महत्वपूर्ण स्थान रखते हैं। MacTutor का historical project उन्हें classical tradition को आगे बढ़ाने वाले notable mathematicians में रखता है।
| योगदान | आज क्यों महत्वपूर्ण |
|---|---|
| Combinatorial counting | Arithmetic को systematic enumeration से जोड़ता है। |
| Permutation generation | Discrete structures की algorithmic generation से conceptually जुड़ता है। |
| Number sequences | Rules के जरिए structured numerical patterns generate करने की समझ। |
| Magic squares | Constraints, construction algorithms और discrete mathematics का मेल। |
| Algebraic approximation | Modern computational machinery के बिना powerful numerical reasoning। |
इसलिए उनका modern relevance किसी एक isolated “invention” में नहीं, बल्कि algorithmic thinking, enumeration, algebra और structured numerical construction के combination में है।
Myths vs Historical Evidence
| Popular claim | Better historical formulation |
|---|---|
| Narayana invented modern combinatorics. | Too broad. He made major contributions to combinatorial enumeration within the Indian mathematical tradition. |
| His work was exactly the same as modern computer algorithms. | Not literally. The procedures can be mathematically or algorithmically comparable, but the historical notation and aims were different. |
| Every work attributed to him has undisputed authorship. | No. The Karmapradipika attribution is disputed by historians. |
| He was only interested in recreational puzzles. | Incorrect. His works span arithmetic, algebra, sequences, equations, geometry and combinatorics. |
| His dates are known exactly. | No. His life dates are approximate in major historical references. |
लोकप्रिय दावे बनाम ऐतिहासिक प्रमाण
| लोकप्रिय दावा | अधिक सटीक ऐतिहासिक formulation |
|---|---|
| Narayana ने modern combinatorics invent की। | बहुत broad claim है। उन्होंने Indian mathematical tradition में combinatorial enumeration में महत्वपूर्ण योगदान दिया। |
| उनका work modern computer algorithms के बिल्कुल समान था। | Literal equivalence नहीं। Procedures mathematically/algorithmically comparable हो सकती हैं, लेकिन notation और aims historical रूप से अलग थे। |
| उनसे जुड़े सभी works की authorship निर्विवाद है। | नहीं। Karmapradipika की attribution पर historians में विवाद है। |
| वे केवल recreational puzzles में रुचि रखते थे। | गलत। उनके works arithmetic, algebra, sequences, equations, geometry और combinatorics तक फैले हैं। |
| उनकी dates बिल्कुल निश्चित हैं। | नहीं। प्रमुख historical references में life dates approximate हैं। |
Key Takeaways
14th-Century Mathematician
Narayana Pandita belongs to the mature Sanskrit mathematical tradition after Bhaskara II.
Ganita Kaumudi
His major arithmetic treatise was composed in 1356.
Combinatorics
His systematic counting of arrangements is a central part of his mathematical legacy.
Permutations
He gave rules connected with counting and generating permutations.
Magic Squares
The final chapter of Ganita Kaumudi contains an extensive treatment of magic squares and related figures.
Beyond Counting
His work also includes algebra, equations, approximation, arithmetic and geometry.
मुख्य बातें
14वीं शताब्दी के गणितज्ञ
Narayana Pandita भास्कर द्वितीय के बाद की mature Sanskrit mathematical tradition के प्रमुख नाम हैं।
गणित कौमुदी
उनका प्रमुख arithmetic treatise 1356 में रचा गया।
संयोजनात्मक गणित
Arrangements की systematic counting उनकी mathematical legacy का central हिस्सा है।
क्रमचय
उन्होंने permutations की counting और generation से जुड़े rules दिए।
जादुई वर्ग
गणित कौमुदी के अंतिम chapter में magic squares और related figures का विस्तृत treatment है।
Counting से आगे
उनका work algebra, equations, approximation, arithmetic और geometry तक जाता है।
Frequently Asked Questions
Narayana Pandita was a 14th-century Indian mathematician known for arithmetic, algebra, combinatorics, number sequences and magic squares.
He is especially known for Ganita Kaumudi and its systematic treatment of combinatorial problems, permutations, sequences and magic squares.
It is Narayana Pandita's major arithmetical mathematical treatise, composed in 1356.
Yes. His combinatorial treatment includes rules for generating permutations and related counting problems.
The final chapter of Ganita Kaumudi gives rules for constructing different classes of magic squares and related magic figures.
The project places him in the 14th century CE. MacTutor gives approximately 1325–1400, while other references commonly use approximately 1340–1400.
Evidence Status
🟢 Well established for the existence and content of Ganita Kaumudi (1356) and its combinatorial chapter, corroborated by a surviving critical edition. 🟡 Debated / historically plausible for precise biographical details: Narayana Pandita's exact birth and death dates vary between sources (MacTutor gives approximately 1325–1400; other references use approximately 1340–1400), and little is known about his life beyond his father's name and the distribution of his manuscripts.
Claim → Evidence → Interpretation → Caveat
Claim: Ganita Kaumudi contains advanced combinatorial procedures, including rules for permutations and magic squares.
Evidence: The critical edition of Ganita Kaumudi, edited by Padmakara Dvivedi (Benares Government Sanskrit College, 1942), and secondary historical scholarship both describe dedicated treatment of counting, permutation-generation and magic-square construction.
Interpretation: Modern historians classify these procedures using present-day combinatorial terminology because the underlying counting problems match; this is a retrospective label applied for clarity, not a claim that Narayana used modern terminology himself.
Caveat: Care is needed not to project modern disciplinary boundaries (e.g. "combinatorics" as a distinct field) onto a text that treats these problems as part of a broader arithmetical tradition.
About this Article
This article has been prepared for educational and historical research purposes using primary sources, scholarly references, and reputable historical or academic resources where available. Historical claims are presented with appropriate context, and claims that remain debated are identified as such.
Article Information
Author: Hindu Research Portal Editorial Team
Published: Not specified
Last updated: 11 August 2026
Category: Medieval Indian Mathematics — Combinatorics & Arithmetic
Sources & Further Reading
Primary Sources
- Narayana Pandita, Ganita Kaumudi, ed. Padmakara Dvivedi, Benares Government Sanskrit College, 1942 — catalogue record: University of Delhi Library
- Digitized Sanskrit editions and related material: Wikisource (Sanskrit)