|
Education
Web
Viewing 1-1 of 1 total results
 Math for Poets and Drummers
? Pingala’s indexing process reverses the algorithm he developed for Problem 2. The index of the pattern of all long syllables is one. For any other pattern, start with the first short syllable from the right. The instruction is simply “multiply by two” (in ord...
1
0
? Pingala’s indexing process reverses the algorithm he developed for Problem 2. The index of the pattern of all long syllables is one. For any other pattern, start with the first short syllable from the right. The instruction is simply “multiply by two” (in order for the algorithm to work, the starting number must be one). If the next syllable on the left is , again multiply the resulting number by two; otherwise, multiply it by two and subtract one. Repeat this process until the leftmost character is reached. This
4
0
http://www.sju.edu/~rhall/mathforpoets.pdf#page=4
www.sju.edu/~rhall/mathforpoets.pdf#page=4
generalize to any length of pattern. Prastāras of one through four syllables are shown in Figure 1. Kedāra Bhatt gives an completely different <span class="highlight">algorithm</span> that nonetheless generates the list of n-syllable patterns in the same order Pingala uses [11, 5]. The first pattern on the list consists of n long syllables. Suppose you are given any pattern on the list (<span class="highlight">for</span> example, ). To get the next pattern, start from the left by writing long syllables: When you reach the position of the first long syllable in the previous
7
0
http://www.sju.edu/~rhall/mathforpoets.pdf#page=7
www.sju.edu/~rhall/mathforpoets.pdf#page=7
? Pingala’s indexing process reverses the <span class="highlight">algorithm</span> he developed <span class="highlight">for</span> Problem 2. The index of the pattern of all long syllables is one. <span class="highlight">For</span> any other pattern, start with the first short syllable from the right. The instruction is simply “multiply by two” (in order <span class="highlight">for</span> the <span class="highlight">algorithm</span> to work, the starting number must be one). If the next syllable on the left is , again multiply the resulting number by two; otherwise, multiply it by two and subtract one. Repeat this process until the leftmost character is reached. This
|
