Neutral and interordinal intervals in MOS scales: Difference between revisions
Tags: Mobile edit Mobile web edit |
Tags: Mobile edit Mobile web edit |
||
| Line 36: | Line 36: | ||
*** <pre>Y=L^A sL...LsL...LsL...LsL...LsL^B</pre> | *** <pre>Y=L^A sL...LsL...LsL...LsL...LsL^B</pre> | ||
*** <pre>X=L^CsL...LsL...LsL^D</pre> | *** <pre>X=L^CsL...LsL...LsL^D</pre> | ||
** Let r be the number of complete chunks in X, and let μ = n/(a+b). We'll obtain a contradiction. By the Discretizing Lemma, we have (|| denotes length): | ** Let r be the number of complete chunks (maximal contiguous strings of L's) in X, and let μ = n/(a+b). We'll obtain a contradiction. By the Discretizing Lemma, we have (|| denotes length): | ||
*** 1+A+B+floor((r+2)μ) <= |Y| <= 1+A+B+ceil((r+2)μ) | *** 1+A+B+floor((r+2)μ) <= |Y| <= 1+A+B+ceil((r+2)μ) | ||
*** 1+C+D+floor(μr) <= |X| <= 1+C+D+ceil(rμ) | *** 1+C+D+floor(μr) <= |X| <= 1+C+D+ceil(rμ) | ||