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.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How many words can be formed from the letters of the word 'DAUGHTER' so that the vowels never come together ?

The answer is obviously $8!-6!\cdot3!$.

My question is that if we ponder from a different perspective, that is taking $5$ consonants first and arranging them ($5!$ ways of doing that) and then placing the $3$ vowels in the $6$ places created due to the arrangement of consonants ($\frac{6!}{3!}$ ways to do that), the answer should be $5!\frac{6!}{3!}$.

What is wrong with this?

share|cite|improve this question

Your first solution ($36000$) counts words in which AEU don't come all three together, your second solution ($14400$) counts those in which they are all three separate, which is quite a more strict condition. Which shows that it helps to pose your question more carefully: what exactly do you mean by "the vowels come together"?

share|cite|improve this answer

Your Answer


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.