AFHKNW

Using an ordered alphabet of 26 letters, how many ways are there to choose a set of six different letters such that no two letters in the set are adjacent in the alphabet?

For instance, {ISOKAY}\{ISOKAY\} is a valid set of six letters, but {VETOIF}\{V\color{#D61F06}E\color{#333333}TOI\color{#D61F06}F\color{#333333}\} is not because EE and FF are both in the set.


Note: As always, a "set" is considered unordered. Hence, {ISOKAY}\{ISOKAY\} and {YAKOSI}\{YAKOSI\} and {AIKOSY}\{AIKOSY\} are considered the same set.

×

Problem Loading...

Note Loading...

Set Loading...