Minimal consistent EDOs: Difference between revisions
I'm not sure if edo shouldn't better be spelled EDO |
m minor edits for clarity |
||
| Line 1: | Line 1: | ||
An [[edo]] N is [[consistent]] with respect to a set of rational numbers s if the [[Patent_val|patent val]] mapping of every element of s is the nearest N-edo approximation. It is ''uniquely consistent'' if every element of s is mapped to a unique value. If the set s is the q [[Odd_limit|odd limit]], we say N is q-limit consistent and q-limit uniquely consistent, respectively. Below is a table of the | An [[edo]] N is [[consistent]] with respect to a set of rational numbers s if the [[Patent_val|patent val]] mapping of every element of s is the nearest N-edo approximation. It is ''uniquely consistent'' if every element of s is mapped to a unique value. If the set s is the q [[Odd_limit|odd limit]], we say N is q-limit consistent and q-limit uniquely consistent, respectively. Below is a table of the smallest consistent, and the smallest uniquely consistent, edo for every odd number up to 135. | ||
{| class="wikitable" | {| class="wikitable" | ||
|- | |- | ||
! Odd limit | ! Odd limit | ||
! Smallest consistent | ! Smallest consistent edo | ||
! Smallest uniquely consistent | ! Smallest uniquely consistent edo | ||
|- | |- | ||
| 1 | | 1 | ||