•  
  •  
 

Authors

Eric Chaikin

Abstract

A previous article introduced a term bisogram to refer to a pair of words which does not repeat a letter, and described the search to equal the longest-known example, the 20 letter GUNPOWDERY BLACKSMITH. In this article, I described the search to equal the longest-known three-four- and five-word sets: triosgrams, quadrisograms, and quitisograms.

Share

COinS