MathDB

Some language has only three letters -

A, B

and

C

. A sequence of letters is called a word iff it contains exactly 100 letters such that exactly 40 of them are consonants and other 60 letters are all

A

. What is the maximum numbers of words one can pick such that any two picked words have at least one position where they both have consonants, but different consonants?

Problem Statement