Permutation

This topic has expert replies
Junior | Next Rank: 30 Posts
Posts: 14
Joined: Wed Apr 22, 2009 10:00 am
Thanked: 1 times

Permutation

by sportcntr3 » Wed Apr 22, 2009 10:57 am
Out of 8 consonants and 4 vowels, how many words of 5 consonants and 2 vowels can be formed?

a. 236,900
b. 8,956,200
c. 1,693,440
d. 7,865,320
e. 4,525,650

OA: 1,693,440
Source: — Problem Solving |

Master | Next Rank: 500 Posts
Posts: 418
Joined: Wed Jun 11, 2008 5:29 am
Thanked: 65 times

by bluementor » Thu Apr 23, 2009 1:57 am
No. of consonants available = 8
No. of vowels available = 4

No. of consonants to choose = 5
No. of vowels to choose = 2

No. of ways to choose consonants = 8C5 = 56
No. of ways to choose vowels = 4C2 = 6

No. of unique consonant-vowel sets = 56 x 6 = 336

Since the resulting word is 7 letters long, for each set of consonants and vowels, there can be 7! ways to arrange the letters to form a word.

So, the total number of words that can be formed = 336 x 7! = 336 x 5040 = 1,693,440

Choose C.

-BM-

User avatar
Master | Next Rank: 500 Posts
Posts: 229
Joined: Tue Jan 13, 2009 6:56 am
Thanked: 8 times
GMAT Score:700

by Uri » Thu Apr 23, 2009 10:04 am
bluementor, are you not assuming that each alphabet is used only once in each word?

User avatar
MBA Student
Posts: 1194
Joined: Sat Aug 16, 2008 9:42 pm
Location: Paris, France
Thanked: 71 times
Followed by:17 members
GMAT Score:710

by gmat740 » Thu Apr 23, 2009 11:49 am
bluementor, are you not assuming that each alphabet is used only once in each word?
Well please allow me to explain on the behalf of BM.


At first we make selection of The alphabets from the given list of vowels and consonants
once the selection is over,

we see,in how many ways,they can be arranged(multiply with 7!)

So certainly when we make the selection,we select different alphabets.

Hope this helps

User avatar
Master | Next Rank: 500 Posts
Posts: 229
Joined: Tue Jan 13, 2009 6:56 am
Thanked: 8 times
GMAT Score:700

by Uri » Thu Apr 23, 2009 12:28 pm
gmat740 wrote:So certainly when we make the selection,we select different alphabets.
Hope this helps

yes, this helps! and you have exactly pinpointed my doubt.

the question has not mentioned that the alphabets should be used only once in each word. so, logically we can use any alphabet any number of time, provided the number of occurrences of the consonants and vowels meets the given criteria.

so, don't u think that the question is missing some vital information, if the answer of BM is the OA?

User avatar
MBA Student
Posts: 1194
Joined: Sat Aug 16, 2008 9:42 pm
Location: Paris, France
Thanked: 71 times
Followed by:17 members
GMAT Score:710

by gmat740 » Thu Apr 23, 2009 6:54 pm
well this is something where you have to assume this:

there are 5 vowels and you have to choose 2 from them

like a,e,i,o,u

so we assume the given vowels to contain 5 different vowels and choosing any two will be consequently 5C2

Hope now it is clear

User avatar
Legendary Member
Posts: 682
Joined: Fri Jan 16, 2009 2:40 am
Thanked: 32 times
Followed by:1 members

Re: Permutation

by Vemuri » Thu Apr 23, 2009 7:57 pm
Lets assume the 8 consonants are: {b,c,d,f,g,h,j,k} & the 4 vowels are: {a,e,i,o}

Now, remember that whenever we choose or select something from a larger group, we are always dealing with combinations.

So, the number of ways we can select 5 consonants from the 8 available = 8c5 ==> 56ways
The number of ways we can select 2 vowels from the 4 available = 4c2 ==> 6 ways.

So, assume we selected the consonants {b,c,d,f,g} & vowels {a,e}. To form 7 letter words from these selected letters, the letters can be "arranged" in 7! ways. So, in all 56*6*7! = 1693440 words can be formed.

Hope this helps.

User avatar
Master | Next Rank: 500 Posts
Posts: 229
Joined: Tue Jan 13, 2009 6:56 am
Thanked: 8 times
GMAT Score:700

by Uri » Thu Apr 23, 2009 11:15 pm
thanks for the explanations, gmat740 and venmuri. if it is assumed that any letter can be used only once in a word, then the explanation is quite clear.

but when i attempted the problem, i was also considering the possibility of any given alphabet appearing more than once in a word. in that case, we would have used a different formula and the answer would have been different than the given options.

if any vowel can appear more than once in a word, then using 4 vowels we can form 2^4=16 two-vowel sets. (aa, ee, ii, oo, ae, ai, ao, ea, ei, eo, ia, ie, io, oa, oe, oi)

similarly, if any consonant can appear more than once in a word, then using 8 consonants we can form 5^8=390625 five-consonant sets.

again, the 7 alphabets in a word can be arranged in 7! ways= 5040 ways.

so, the total number of possible arrangements= 16*390625*5040

let me admit that i am weak in permutation-problems. but i was thinking something along this line. if for a moment we forget the OA, can you please verify whether my approach is right? i have a feeling that, even if we consider that the vowels and consonants can repeat in a word, then also my answer is wrong :roll:

in short, can you please find out how many 7 letter combinations are possible from 4 vowels and 8 consonants, where any combination has 2 vowels and 5 consonants and any vowel or consonant can be repeated? (eg. aabbbbb is also permitted)

Newbie | Next Rank: 10 Posts
Posts: 5
Joined: Wed Dec 24, 2008 12:27 am

a tough one

by RockyRambo » Fri Apr 24, 2009 4:19 am
This one becomes a tough one.not for GMAT then

x1 + x2 + x3 + x4 + x5 + x6 + x7 = 7, where xi is the consonants and vowels ....now we are actually trying to find the whole number solutions of the above equation and then arranging them also...for which i know only a brute force method..for eg

2,1,1,1,1,1,0 is one soultion....but the total number of ways we have is
[7! /(2!*1!^5)] *[7!/(5!)]....

the second part is of finding the permutations of (2,1,1,1,1,1,0) for different xis

the first part is arranging the seven letters then, eg 2 a's, 1 b, 1 c, 1d, 1e,1f
can be arranged as aabcdef , abcdefa, etc....

this needs to be done for every solution and then the result be multiplied by C(8,5)*C(4,2) to get the ans!

regards
Varun