अङ्कपाश · Chapter Overview
From Līlāvatī, taught by Acharya T Krishnatrey. This lesson is free to read.
<pre data-block="statement">What this chapter covers | Long before modern combinatorics, the Līlāvatī gives clear rules for permutations (aṅkapāśa, the "net of digits"): how many distinct numbers can be formed from a set of digits, and how the count changes when digits repeat. Its rule is that n distinct digits arrange in n! ways, dividing by the factorials of any repeats. A worked example (4! = 24) and the closing checkpoint follow.</pre>