•  
  •  
 

Authors

Darryl Francis

Abstract

Take each of the 50 US state names in turn. For each state name, reduce the name to the list of different letters occurring in the state name, ignoring repeated occurrences of letters (for example, Alabama to ABLM). For each such sequence, what is the longest and the shortest word that can be made from all the different letters, allowing repeated use of any letter? (In the National Puzzlers' League, collections of such words, not merely the longest and shortest possible, are known as a Letter Bank.)

Share

COinS