Generator-offset property: Difference between revisions
| Line 124: | Line 124: | ||
We must have gcd(''k'', ''n'') = 1. If not, since ''n'' is odd, gcd(''k'', ''n'') is an odd number at least 3, and by well-formedness with respect to the generator, the generators must form more than 2 parallel chains. | We must have gcd(''k'', ''n'') = 1. If not, since ''n'' is odd, gcd(''k'', ''n'') is an odd number at least 3, and by well-formedness with respect to the generator, the generators must form more than 2 parallel chains. | ||
By modular arithmetic we have ''rk'' ≡ ''k''/2 mod ''n'' iff ''r'' ≡ (''n'' + 1)/2 mod ''n''. (Note that both 2 and ''k'' are multiplicatively invertible mod ''n''.) This proves that the offset, which must be reached after (''n'' + 1)/2 ''k''-steps, is a ''k''/2-step, as desired. (If the offset wasn't reached in (''n'' + 1)/2 steps, the two generator chains either wouldn't be disjoint or wouldn't have the assumed lengths.) | By modular arithmetic we have ''rk'' ≡ ''k''/2 mod ''n'' iff ''r'' ≡ (''n'' + 1)/2 mod ''n''. (Note that both 2 and ''k'' are coprime with ''n'', hence multiplicatively invertible mod ''n''.) This proves that the offset, which must be reached after (''n'' + 1)/2 ''k''-steps, is a ''k''/2-step, as desired. (If the offset wasn't reached in (''n'' + 1)/2 steps, the two generator chains either wouldn't be disjoint or wouldn't have the assumed lengths.) | ||
=== Proposition 3 (Properties of even GO scales) === | === Proposition 3 (Properties of even GO scales) === | ||