olymmath

OMCC 2007

Centroamerican and Caribbean Mathematical Olympiad 2007.

Day 1

Problem 1

  • Day 1

In a remote island, a language in which every word can be written using only the letters aa , bb , cc , dd , ee , ff , gg is spoken. Let's say two words are synonymous if we can transform one into the other according to the following rules:

i) Change a letter by another two in the following way: a→bc, b→cd, c→de, d→ef, e→fg, f→ga, g→aba \rightarrow bc,\ b \rightarrow cd,\ c \rightarrow de,\ d \rightarrow ef,\ e \rightarrow fg,\ f\rightarrow ga,\ g\rightarrow ab ii) If a letter is between other two equal letters, these can be removed. For example, dfd→fdfd \rightarrow f .

Show that all words in this language are synonymous.

Answer, solutions and source

Day 2