The wedgie: Difference between revisions

Line 34:

Let d = gcd(W(2, q_1), ..., W(2, q_n)). This tells you that for any JI ratio v in your JI subgroup, W(2, v) = 2n(v) for some number n(v) [that depends linearly on v]. This equation is also true when we replace 2 with any JI ratio u that is equated to 2. This tells us that for W(p, g) = 1, we (up to some choices) need p to be an interval such that d*p is equated to 2/1, i.e. p represents 1/d of the octave.

~~Take for granted~~ that we ~~already~~ have a JI interpretation for the period p. Since gcd(W(2, q_1), ..., W(2, q_n)) = d, we can always find a linear combination g = a_1 q_1 + ... + a_n q_n such that W(2, g) = a_1 W(2, q_1) + ... a_n W(2,q_n) = d using the Euclidean algorithm. Then since W(d*p, g) = d*W(p,g) = d, we have W(p,g) = 1. Ta-da!

If you believe me that we always have a JI interpretation for the period p: Since gcd(W(2, q_1), ..., W(2, q_n)) = d, we can always find a linear combination g = a_1 q_1 + ... + a_n q_n such that W(2, g) = a_1 W(2, q_1) + ... a_n W(2,q_n) = d using the Euclidean algorithm. Then since W(d*p, g) = d*W(p,g) = d, we have W(p,g) = 1. Ta-da!

== Truncation of wedgies ==

@@ Line 34: / Line 34: @@
 Let d = gcd(W(2, q_1), ..., W(2, q_n)). This tells you that for any JI ratio v in your JI subgroup, W(2, v) = 2n(v) for some number n(v) [that depends linearly on v]. This equation is also true when we replace 2 with any JI ratio u that is equated to 2. This tells us that for W(p, g) = 1, we (up to some choices) need p to be an interval such that d*p is equated to 2/1, i.e. p represents 1/d of the octave.
-Take for granted that we already have a JI interpretation for the period p. Since gcd(W(2, q_1), ..., W(2, q_n)) = d, we can always find a linear combination g = a_1 q_1 + ... + a_n q_n such that W(2, g) = a_1 W(2, q_1) + ... a_n W(2,q_n) = d using the Euclidean algorithm. Then since W(d*p, g) = d*W(p,g) = d, we have W(p,g) = 1. Ta-da!
+If you believe me that we always have a JI interpretation for the period p: Since gcd(W(2, q_1), ..., W(2, q_n)) = d, we can always find a linear combination g = a_1 q_1 + ... + a_n q_n such that W(2, g) = a_1 W(2, q_1) + ... a_n W(2,q_n) = d using the Euclidean algorithm. Then since W(d*p, g) = d*W(p,g) = d, we have W(p,g) = 1. Ta-da!
 == Truncation of wedgies ==