Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
The number of words, which can be formed using all the letters of the word "DAUGHTER", so that all the vowels never come together, is :
Step 1: DAUGHTER has eight distinct letters, including three vowels A,U,E. There are 8! total arrangements.
Step 2: If all three vowels stay together, treat them as one block. The block plus five consonants can be arranged in 6! ways, and the vowels within their block in 3! ways, giving 6!·3!=4320.
Step 3: The number in which the three vowels are not all together is 8!−4320=36000, option D.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.