Skip to main content
OlympiadHQ

Browse · MathNet

Print

Mongolian Mathematical Olympiad

Mongolia counting and probability

Problem

One of the following three types of operations can be performed on a word. Let , , , , , and be letters. (1) Any subword of the form can be changed to . For example, . (2) Any subword of the form can be changed to . For example, . (3) Any subword of the form can be omitted. For example, . Can the word be obtained from the word using the above operations? Note: For , the subwords are , , , , , and , but not .
Solution
Answer: No. Suppose the number of 's in even positions is subtracted from the number of 's in odd positions in the word. In that case, we obtain a quantity that remains invariant under the given operations. This invariant can be used to determine if one word can be transformed into another using the specified operations. For the word : Odd-positioned letters: 2 (positions 1 and 5) Even-positioned letters: 0 Thus, the invariant for is . For the word : Odd-positioned letters: 0 Even-positioned letters: 2 (positions 2 and 6) Thus, the invariant for is . Since the invariant values for and are different (2 and , respectively), it is impossible to transform into using the given operations.
Final answer
No

Techniques

Invariants / monovariants