ILL 1990 Problem 40
Given three letters , we can construct letter sequences arbitrarily, such as , etc. For any given sequence, we can perform following operations: : If the right-most letter is , then we can add after it, for example, : If The sequence contains , we can replace them by , for example, : We can replace ( is any sub-sequence) by , for example, : In a sequence containing one or more , we can replace the first by , for example, : We can replace any of by , for example, or or Using above operations, can we get from
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.