User:Inthar/Sandbox: Difference between revisions

@@ Line 1: / Line 1: @@
-== Conjectures ==
+== Theorem 9 (Ternary product words) ==
-* "If ''N''-edo approximates ''p''/''q'' with error δ = δ(''p'', ''q''), then any neji in mode ''m'' for any ''m'' &le; ''M''(''p'', ''q'', ''N'') must have more than ε error"
+If a [[product word]] of two MOS words of the same length is ternary, then it is pairwise-MOS.
+=== Proof ===
+Assume that the product of two MOS words ''v''('''a''', '''b''') and ''w''('''c''', '''d''') contains exactly three letters, say ('''a''', '''c'''), ('''a''', '''d'''), ('''b''', '''c'''). Equating ('''a''', '''c''') and ('''a''', '''d''') recovers ''v'', and equating ('''a''', '''c''') and ('''b''', '''c''') recovers ''w''. What does equating ('''a''', '''d''') and ('''b''', '''c''') do?