MathDB

In an alphabet of

n

letters, is

syllable

is any ordered pair of two (not necessarily distinct) letters. Some syllables are considered

indecent

. A

word

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.

1

Problems(1)