Using an ordered alphabet of 26 letters, how many ways are there to choose a set of six letters such that no two letters in the set are adjacent in the alphabet? for instance, {isokay} is a valid set of six numbers, but {vetoif} is not because e and f are in the same set.

To find our solution, we can start off by creating a string of 27 boxes, all followed by the letters of the alphabet. Underneath the boxes, we can place 6 pairs of boxes and 15 empty boxes.The stars represent the six letters we pick. The empty boxes to the left of the stars provide the "padding" needed to ensure that no two adjacent letters are chosen. We can create this - 

Thus, the answer is that there are  ways to choose a set of six letters such that no two letters in the set are adjacent in the alphabet. Hope this helped and have a phenomenal New Year! 2018

1.) 18+5 is one way i’m pretty sure there are others but i can’t think of them right now