Superpartient ratio: Difference between revisions

Fredg999 (talk | contribs)
Move examples from Delta, reformat as lists instead of table (table may cause a false sense of correspondence between elements in the same column)
Fredg999 (talk | contribs)
m Fix typo
Line 19: Line 19:
<math>\displaystyle \prod_{i \mathop = 1}^{P \mathop - 1} \dfrac {i + 1} {i} = P</math>
<math>\displaystyle \prod_{i \mathop = 1}^{P \mathop - 1} \dfrac {i + 1} {i} = P</math>


When considering ratios, and particularly when they are ratios for [[comma]]s, it can be useful to introduce the notion of the '''degree of epimoricity''' (not to be confused with ''epimericity'' – see link below), or '''delta'''(proposed by [[Kite Giedraitis]]). In terms of ''p''/''q'' reduced to lowest terms it is ''p'' - ''q''. An epimoric ratio has degree 1, the 7-limit comma 245/243 degree 2, the 5-limit comma 128/125 degree 3, and so forth. [[Wikipedia:Størmer's theorem|Størmer's theorem]] can be extended to show that for each prime limit ''p'' and each degree of epimericity ''n'', there are only finitely many ''p''-limit ratios with degree of epimoricity less than or equal to ''n''.
When considering ratios, and particularly when they are ratios for [[comma]]s, it can be useful to introduce the notion of the '''degree of epimoricity''' (not to be confused with ''epimericity'' – see link below), or '''delta''' (proposed by [[Kite Giedraitis]]). In terms of ''p''/''q'' reduced to lowest terms it is ''p'' - ''q''. An epimoric ratio has degree 1, the 7-limit comma 245/243 degree 2, the 5-limit comma 128/125 degree 3, and so forth. [[Wikipedia:Størmer's theorem|Størmer's theorem]] can be extended to show that for each prime limit ''p'' and each degree of epimericity ''n'', there are only finitely many ''p''-limit ratios with degree of epimoricity less than or equal to ''n''.


== Examples ==
== Examples ==