I N T E R M E D I A T E How many words can be made with the letters of the word I N T E R M E D I A T E if the order of vowels doesn't change ?
The "order of the vowels" refers to the sequence in which they occur. IE the sequence should be I − E − E − I − A − E .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice way to simplify the problem!
wow ! very nice and smart solution . Thank you.
Ah... Very nice! I like the V substitution!
I thought of this method, but isn't this wrong?
If you group the vowels together and consider them to be a single variable, doesn't that mean there cannot be any letters within the group?
Meaning, the order is I E E I A__E is substituted by V and then this is considered one letter. So words like "V"NTRTDM and NTR"V"TDM are coming under your solution but, words like
I E NTRTDM E I A E is not.
Your answer is totally wrong reason stated in above comment
Vowels should be in relative order IEEIAE in the word formed . (We can insert any number of consonants between them). There are 12 places to be filled by letters. Number of ways to choose 6 places = 12!/6!6! These 6 places can be filled in only one way that is the order given. The remaining 6 places can be filled in by consonants in 6!/2! ways (as there are two Ts) So total number of ways = 12!6!/6!6!2! That is equal to 332640.😁
Wow!Quite simple a method.Thanx!
Very good attempt
Solve using probability. Consider vowels, IEEIAE,number of arrangements is 60(6!÷2!÷3!). probability of this arrangement is 1÷60. So answer is 1÷60×total permutations. That is 1÷60*19958400
@Kalash Verma how did you solve it?Please tell.
Log in to reply
@Adarsh Kumar I have posted a solution you can see to it.😎
Awesome method!!
Fantastic solution. Go ahead .
Applying the Vandermonde Recursion identity. (n - i)C(r - i -1 ).where i is the place values of the vowels.
Stuuuuupid
I first did the problem thinking it meant that not all letters had to be included but all the vowels did in their relative places and came up with a sum which multiplies the number of ways that the 6 vowels could be placed amongst the 6 + n letters by the number of unique permutations of n consonants, accounting for the presence of 2 T's: n = 0 ∑ 6 n ! 6 ! ( 6 + n ) ! ( ( 5 − n ) ! 5 ! + ( 2 n ) ( 6 − n ) ! 4 ! ) = 5 4 5 9 5 2
If the problem is instead to use all of the letters, we instead simply have to choose the spots for the 6 vowels within the 12 letters and then multiply by the number of unique permutations of the consonants, instead giving an answer of: ( 6 1 2 ) ⋅ 2 ! 6 ! = 3 3 2 6 4 0
Problem Loading...
Note Loading...
Set Loading...
The order of vowels doesn't change => there's only one order => it's as if they were all replaced by one letter, V. So we have 12 letters, out of which 6 are V and 2 are T. 6 ! ⋅ 2 ! 1 2 ! = 3 3 2 6 4 0