Alan Frank


Pick a group of n different letters, and in turn add A, B, ..., Z to these. How many of these enlarged groups can be transposed into words? More interestingly, what is the most fecund such letter group? This is an example of a logological problem best attacked by computer. To illustrate the possibilities, I list below the best letter groups of two through eight letters which can be enlarged to words found in the Official Scrabble Players' Dictionary.