In how many ways can the letters of the word AGREATESTMATH be arranged so that no 2 vowels are together?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
AGREATESTMATH contains 13 letters of which 8 are consonants and 5 vowels. First lets arrange the consonants by 3 ! 8 ! (T repeats 3 times). Now, there are (8 + 1 = 9) places amde by these 8 consonants.And we have to arrange 5 vowels in them. Now, choose 5 places by ( 5 9 ) . Now, arrange them by 2 ! × 3 ! 5 ! (A repeats thrice and E repeats twice). So, our final answer is 3 ! 8 ! × ( 5 9 ) × 2 ! × 3 ! 5 ! = 8 4 6 7 2 0 0 .