IZhO 2024, P1
Source:
January 9, 2024
combinatorics
Problem Statement
In an alphabet of letters, is is any ordered pair of two (not necessarily distinct) letters. Some syllables are considered . A is any sequence, finite or infinite, of letters, that does not contain indecent syllables. Find the least possible number of indecent syllables for which infinite words do not exist.