Aura
Joined 31 August 2020
Userminusone (talk | contribs) response + elaboration |
No edit summary |
||
Line 324: | Line 324: | ||
:: That's understandable. One thing I didn't mention, though, is that the Averiant could be useful for finding new commas. As an example, the comma 128/125 can be derived by taking the (1/3)averiant between 2/1 and 1/1 to get 5/4, and then equating 5/4 with 1/3 of an octave (or equivalently, equating 125/64 with an octave). 128/125 is quite a large comma but my point is that this approach could theoretically be used to find much smaller commas. --[[User:Userminusone|Userminusone]] ([[User talk:Userminusone|talk]]) 21:31, 26 July 2021 (UTC) | :: That's understandable. One thing I didn't mention, though, is that the Averiant could be useful for finding new commas. As an example, the comma 128/125 can be derived by taking the (1/3)averiant between 2/1 and 1/1 to get 5/4, and then equating 5/4 with 1/3 of an octave (or equivalently, equating 125/64 with an octave). 128/125 is quite a large comma but my point is that this approach could theoretically be used to find much smaller commas. --[[User:Userminusone|Userminusone]] ([[User talk:Userminusone|talk]]) 21:31, 26 July 2021 (UTC) | ||
::: I believe that, but how do you specifically narrow your commas down to those with low prime limit? --[[User:Aura|Aura]] ([[User talk:Aura|talk]]) 23:11, 26 July 2021 (UTC) |