A sequence (a1,a2,...,a675) is given so that each term is an alphabet in the English language (no distinction is made between lower and upper case letters). It is known that in the sequence a is never followed by b and c is never followed by d. Show that there are integers m and n with 1≤m<n≤674 such that am=an and am+1=an+1· Wordsalphabetcombinatorics