Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

The word is "ENGINEERING".

The number of ways that the consonants can be ordered is 6! / 3!2!

The number of ways that the vowels can be ordered is 5! / 3!2!

But how would I determine how many ways vowels can be ordered so that they are not next to each other?

share|improve this question
    
Think of using the vowels as separators, and thus you'll have 6 bins to place 6 consonants. Then you need to place a consonant between each spacer, and you'll be left with 2 consonants to place in any of the 6 bins. And of course take into account the double letters. –  Nicolas Villanueva May 4 '11 at 3:19
    
I slightly edited as the capital letters were really offensive on the front page. –  Asaf Karagila May 4 '11 at 7:02
    
If your question has been answered satisfactorily, you should upvote and accept the answer so that it doesn't keep popping up in the frontpage unnecessarily. –  svenkatr May 5 '11 at 16:29
add comment

2 Answers

up vote 7 down vote accepted

Imagine that you arrange the consonants first. There are six consonants which you can arrange in $6!/(3!2!)$ ways.

Now there are 7 spaces for the 5 vowels to go into but only one vowel can go into each space. So you choose 5 of the 7 available spaces and put a permutation of the vowels into these spaces.

Total number of arrangements with no consectutive vowels $= 6!/(3!2!) \times 5!/(3!2!) \times \binom{7}{5}$.

share|improve this answer
    
How do you know that there are 7 spaces for the 5 vowels to go in? –  Krysten May 4 '11 at 3:38
1  
@krysten - You know that the consonants have to separate the vowels. Counting one space in front of the consonants, one at the end and the five in the middle gives us 7 seven spaces. For example, look at .N.G.N.R.N.G. which is an arrangement of consonants with the dots representing places where vowels can go. There are seven dots, which are the seven places where a vowel can go into. –  svenkatr May 4 '11 at 3:42
    
alright thanks. –  Krysten May 4 '11 at 3:53
add comment

(edit: Answer has been updated to include four missed combinations and the fact that permutations are not considered unique if their spelling matches that of another permutation.)

12345678901  (11 letters in ENGINEERING)
C.C.C.C.C.C (alternating sequence, bounded on both sides by C)
.C.C.C.C.CC  (start single consecutive C pair, one end bounded by C)
.C.C.C.CC.C
.C.C.CC.C.C
.C.CC.C.C.C
.CC.C.C.C.C
CC.C.C.C.C.
C.CC.C.C.C.
C.C.CC.C.C.
C.C.C.CC.C.
C.C.C.C.CC. (count: 10)
.CC.CC.C.C. (start double consecutive C pair)
.CC.C.CC.C.
.CC.C.C.CC.
.C.CC.CC.C.
.C.CC.C.CC.
.C.C.CC.CC. (count: 6)
.CCC.C.C.C. (start triple C string)
.C.CCC.C.C.
.C.C.CCC.C.
.C.C.C.CCC. (count: 4)

In all of these formats, there are 6!/(3!2!) ways to order the C's (i.e. consonants) and 5!/(3!2!) ways to order the .'s (i.e. vowels,) so there should be (21)(6!/3!2!)(5!/3!2!), or 12,600, permutations in which there are no adjacent vowels.

share|improve this answer
    
I forgot one possible combination: C1 C2 V1 C3 V2 C4 V3 C5 V4 C6 V5. I went back and edited the post, bringing the total up to (17)6!5!. –  Michael May 4 '11 at 3:48
    
@Michael - your starting count of $6!5!$ is wrong because there are repeating vowels and consonants. Also, I don't see how you can get a factor of 17. I suspect you have made a mistake when you manually count the possible arrangements. –  svenkatr May 4 '11 at 3:53
    
@Michael - That's a very interesting way to look at it. I guess if all else fails you can just look at all the different possibilities. However, I believe the answer is 12,600. –  Krysten May 4 '11 at 3:55
    
@svenkar I made a prettier version of it, showing all 17 formats that the vowels and consonants can follow. If you can find anything wrong with the formats, please explain! –  Michael May 4 '11 at 4:07
    
@Krysten I've noticed a problem! The subject/title of this question is "How many permutations of ENGINEERING do not contain consecutive vowels," which is the question that I answered. This, however, does not match up with the question that you ask in the body of your post, which asks, "how would I determine how many ways vowels can be ordered so that they are not next to each other?," which I find to be both ambiguous and quite different than the subject/title. –  Michael May 4 '11 at 4:08
show 3 more comments

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.