MathDB
SMT 2007 Team #5

Source:

June 30, 2012

Problem Statement

How many five-letter "words" can you spell using the letters SS, II, and TT, if a "word" is defines as any sequence of letters that does not contain three consecutive consonants?
Back to ProblemsView on AoPS