To solve the problem of finding the number of words that can be formed using all the letters of the word "DAUGHTER" such that all the vowels never come together, we need to follow these steps:
- Identify the letters in the word "DAUGHTER". They are: D, A, U, G, H, T, E, R. There are a total of 8 letters.
- Count the vowels in "DAUGHTER". The vowels are A, U, E. There are 3 vowels.
- Calculate the total number of arrangements of the 8 letters:
\(8! = 40320\)
- Calculate the number of arrangements where the vowels all come together. Here, consider the 3 vowels (A, U, E) as one single entity or "super letter". This gives us new entities: (AUE), D, G, H, T, R.
- Count the number of these entities, which are 6 in number (5 consonants + 1 super letter of vowels).
- Calculate the arrangements of these 6 entities:
\(6! = 720\)
- Within the super letter (AUE), the vowels can be arranged among themselves. The number of such arrangements is:
\(3! = 6\)
- Thus, the total number of arrangements where all vowels come together is:
\(6! \times 3! = 720 \times 6 = 4320\)
- The required number of arrangements where vowels do not all come together is the total arrangements minus those where vowels are together:
\(8! - 6! \times 3! = 40320 - 4320 = 36000\)
- Thus, the number of words that can be formed such that all vowels never come together is 36,000.
Therefore, the correct answer is 36000.