Minimal consistent EDOs: Difference between revisions

Revision as of 20:14, 22 November 2020 view source Xenwolf (talk \| contribs) autopatrolled, Bureaucrats, confirmaccount-notify, Interface administrators, Sysops 8,705 edits m simplify/unify wiki markup ← Older edit		Revision as of 20:15, 22 November 2020 view source Xenwolf (talk \| contribs) autopatrolled, Bureaucrats, confirmaccount-notify, Interface administrators, Sysops 8,705 edits I'm not sure if edo shouldn't better be spelled EDO Newer edit →
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 least consistent, and least uniquely consistent, edo for every odd number up to 135.		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 least consistent, and least uniquely consistent, edo for every odd number up to 135.

	{\| class="wikitable"		{\| class="wikitable"