Skip to main content
OlympiadHQ

Browse · MathNet

Print

59th Ukrainian National Mathematical Olympiad

Ukraine counting and probability

Problem

There is an infinite sequence of letters and . In this sequence, one can perform a substitution . It is known that regardless of the order of these substitutions, one can only make a finite number of them. Prove that, in that case, substitutions can also be made only a finite number of times. (Arsenii Nikolaiev)
Solution
Since there can only be made a finite number of substitutions, there is a number , starting from which substitutions are not possible. That means that there are no pairs of subsequent letters . Because, otherwise, on the left from them there is letter , and substitution is possible. But then the second type of substitution is not possible, either, because starting from , there is no pair of letters . And all other pairs of get moved to the left by each second-type substitution. And there is only a finite number of such moves possible.

Techniques

Invariants / monovariants