Let be the set consisting of the four letters .For , let denote the set of words of length consisting of letters belonging to .We designate the words as keywords.
Let be the number of words in that contains all four keywords exactly once.
This first happens for , and indeed there is a unique lettered word that contain each of the keywords once: So, .