Consistency limits of small EDOs: Difference between revisions

Line 1:

<h2>IMPORTED REVISION FROM WIKISPACES</h2>

This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br>

: This revision was by author [[User:TallKite|TallKite]] and made on <tt>2017-01-12 16:55:36 UTC</tt>.<br>

: This revision was by author [[User:TallKite|TallKite]] and made on <tt>2017-01-12 16:57:24 UTC</tt>.<br>

: The original revision id was <tt>~~603954448~~</tt>.<br>

: The original revision id was <tt>603954526</tt>.<br>

: The revision comment was: <tt></tt><br>

The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br>

<h4>Original Wikitext content:</h4>

<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;white-space: pre-wrap ! important" class="old-revision-html">An [[edo]] N is [[consistent]] with respect to a set of rational numbers s if the [[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]], we say N is q-limit consistent and q-limit uniquely consistent, respectively. Below is a table of ~~the least consistent, and least uniquely consistent,~~ edo ~~for every odd number~~ up to ~~135~~.

<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;white-space: pre-wrap ! important" class="old-revision-html">An [[edo]] N is [[consistent]] with respect to a set of rational numbers s if the [[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]], we say N is q-limit consistent and q-limit uniquely consistent, respectively. Below is a table of every edo up to 99. "Consistent" gives the consistency level, and "Distinct" the distinct consistency level.

~~In the table below,~~ "Consistent" gives the consistency level, and "Distinct" the distinct consistency level.

|| EDO || Consistent || Distinct ||

Line 111:

Line 109:

|| 99 || 9 || 9 ||</pre></div>

<h4>Original HTML content:</h4>

<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;width:200%;white-space: pre-wrap ! important" class="old-revision-html"><html><head><title>Consistency levels of small EDOs</title></head><body>An <a class="wiki_link" href="/edo">edo</a> N is <a class="wiki_link" href="/consistent">consistent</a> with respect to a set of rational numbers s if the <a class="wiki_link" href="/patent%20val">patent val</a> mapping of every element of s is the nearest N-edo approximation. It is <em>uniquely consistent</em> if every element of s is mapped to a unique value. If the set s is the q <a class="wiki_link" href="/odd%20limit">odd limit</a>, we say N is q-limit consistent and q-limit uniquely consistent, respectively. Below is a table of ~~the least consistent, and least uniquely consistent,~~ edo ~~for every odd number~~ up to ~~135~~.~~<br />~~

<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;width:200%;white-space: pre-wrap ! important" class="old-revision-html"><html><head><title>Consistency levels of small EDOs</title></head><body>An <a class="wiki_link" href="/edo">edo</a> N is <a class="wiki_link" href="/consistent">consistent</a> with respect to a set of rational numbers s if the <a class="wiki_link" href="/patent%20val">patent val</a> mapping of every element of s is the nearest N-edo approximation. It is <em>uniquely consistent</em> if every element of s is mapped to a unique value. If the set s is the q <a class="wiki_link" href="/odd%20limit">odd limit</a>, we say N is q-limit consistent and q-limit uniquely consistent, respectively. Below is a table of every edo up to 99. &quot;Consistent&quot; gives the consistency level, and &quot;Distinct&quot; the distinct consistency level.<br />

~~<br />~~

~~In the table below,~~ &quot;Consistent&quot; gives the consistency level, and &quot;Distinct&quot; the distinct consistency level.<br />

<br />

@@ Line 1: / Line 1: @@
 <h2>IMPORTED REVISION FROM WIKISPACES</h2>
 This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br>
-: This revision was by author [[User:TallKite|TallKite]] and made on <tt>2017-01-12 16:55:36 UTC</tt>.<br>
+: This revision was by author [[User:TallKite|TallKite]] and made on <tt>2017-01-12 16:57:24 UTC</tt>.<br>
-: The original revision id was <tt>603954448</tt>.<br>
+: The original revision id was <tt>603954526</tt>.<br>
 : The revision comment was: <tt></tt><br>
 The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br>
 <h4>Original Wikitext content:</h4>
-<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;white-space: pre-wrap ! important" class="old-revision-html">An [[edo]] N is [[consistent]] with respect to a set of rational numbers s if the [[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]], we say N is q-limit consistent and q-limit uniquely consistent, respectively. Below is a table of the least consistent, and least uniquely consistent, edo for every odd number up to 135.
+<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;white-space: pre-wrap ! important" class="old-revision-html">An [[edo]] N is [[consistent]] with respect to a set of rational numbers s if the [[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]], we say N is q-limit consistent and q-limit uniquely consistent, respectively. Below is a table of every edo up to 99. "Consistent" gives the consistency level, and "Distinct" the distinct consistency level.
-In the table below, "Consistent" gives the consistency level, and "Distinct" the distinct consistency level.
 || EDO || Consistent || Distinct ||
@@ Line 111: / Line 109: @@
 || 99 || 9 || 9 ||</pre></div>
 <h4>Original HTML content:</h4>
-<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;width:200%;white-space: pre-wrap ! important" class="old-revision-html">&lt;html&gt;&lt;head&gt;&lt;title&gt;Consistency levels of small EDOs&lt;/title&gt;&lt;/head&gt;&lt;body&gt;An &lt;a class="wiki_link" href="/edo"&gt;edo&lt;/a&gt; N is &lt;a class="wiki_link" href="/consistent"&gt;consistent&lt;/a&gt; with respect to a set of rational numbers s if the &lt;a class="wiki_link" href="/patent%20val"&gt;patent val&lt;/a&gt; mapping of every element of s is the nearest N-edo approximation. It is &lt;em&gt;uniquely consistent&lt;/em&gt; if every element of s is mapped to a unique value. If the set s is the q &lt;a class="wiki_link" href="/odd%20limit"&gt;odd limit&lt;/a&gt;, we say N is q-limit consistent and q-limit uniquely consistent, respectively. Below is a table of the least consistent, and least uniquely consistent, edo for every odd number up to 135.&lt;br /&gt;
+<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;width:200%;white-space: pre-wrap ! important" class="old-revision-html">&lt;html&gt;&lt;head&gt;&lt;title&gt;Consistency levels of small EDOs&lt;/title&gt;&lt;/head&gt;&lt;body&gt;An &lt;a class="wiki_link" href="/edo"&gt;edo&lt;/a&gt; N is &lt;a class="wiki_link" href="/consistent"&gt;consistent&lt;/a&gt; with respect to a set of rational numbers s if the &lt;a class="wiki_link" href="/patent%20val"&gt;patent val&lt;/a&gt; mapping of every element of s is the nearest N-edo approximation. It is &lt;em&gt;uniquely consistent&lt;/em&gt; if every element of s is mapped to a unique value. If the set s is the q &lt;a class="wiki_link" href="/odd%20limit"&gt;odd limit&lt;/a&gt;, we say N is q-limit consistent and q-limit uniquely consistent, respectively. Below is a table of every edo up to 99. &amp;quot;Consistent&amp;quot; gives the consistency level, and &amp;quot;Distinct&amp;quot; the distinct consistency level.&lt;br /&gt;
-&lt;br /&gt;
-In the table below, &amp;quot;Consistent&amp;quot; gives the consistency level, and &amp;quot;Distinct&amp;quot; the distinct consistency level.&lt;br /&gt;
 &lt;br /&gt;