In how many ways the letters of the word "INSURANCE" be arranged so that the vowels never occur together?
This is how I did the problem,
Since number of permutations of n different things taken all at a time, when m specified things come together is
Number of ways the vowels never occur together =
which gives a value greater than the total number of permutations with that word!!!
How is it possible?Is the formula wrong?
Another way is to find answer is,
Number of ways vowels never occur together=Total permutations - No.of permutations in which vowels occur together =
Is my second way correct?
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
The Second way is unquestionably correct.
Log in to reply
What about the first one? Whether such a formula exist(seen it in a book)?
Log in to reply
No but if u have its a misprint.
Log in to reply
Also it is not stated that n and m are all distinct or not if you use the formula you can't take n=9
Log in to reply
May be!!:)