The wedgie: Difference between revisions
Line 11: | Line 11: | ||
To find the '''period''': let d = gcd(W(2, q_1), ..., W(2, q_n)). Then your period is 1\d. | To find the '''period''': let d = gcd(W(2, q_1), ..., W(2, q_n)). Then your period is 1\d. | ||
To find the '''generator''': Treat W(2, v) as a linear map where you plug in a JI vector v, and use the [https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm extended Euclidean algorithm] to 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. | To find the '''generator''': Treat W(2, v) as a linear map where you plug in a JI vector v, and use the [https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm extended Euclidean algorithm] to find a linear combination g = a_1 q_1 + ... + a_n q_n (i.e. a JI ratio g = q_1^a_1 ... q_n^a_n) such that W(2, g) = a_1 W(2, q_1) + ... a_n W(2,q_n) = d. | ||
For example, consider the wedgie W = <<1 4 10 4 13 12|| for meantone. We have W(2,3) = 1, W(2,5) = 4, W(2,7) = 10, so d = 1, and our period is 1\1. | For example, consider the wedgie W = <<1 4 10 4 13 12|| for meantone. We have W(2,3) = 1, W(2,5) = 4, W(2,7) = 10, so d = 1, and our period is 1\1. |