Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Hi there, I got 330 and don't understand why this would be wrong. "examination" has 11 letters out of which we are selecting 4 letters. 11C4=11!/4!7!=330. What's the source of this question?

I would be thankful if someone could point out what is wrong in my solution: In total we have to select 4 out of 11, so its 11C4. each of the 3 couples can be substituted within itself, so for each we have 2!=2 inner combinations. counting out those duplicities: 11C4/(2!*2!*2!) = 41.25

I would be thankful if someone could point out what is wrong in my solution: In total we have to select 4 out of 11, so its 11C4. each of the 3 couples can be substituted within itself, so for each we have 2!=2 inner combinations. counting out those duplicities: 11C4/(2!*2!*2!) = 41.25

Find the number of ways in which 4 letters may be selected from the word "Examination"? A. 66 B. 70 C. 136 D. 330 E. 4264

We have, 11 letters: {A, A, E, I, I, O, M, N, N, T, X}; Out of them there are 3 pairs: {A, A}, {I, I} and {N, N}. So, # of distinct letters is 8: {A, E, I, I, O, M, N, N, T, X}

As pointed out, there are 3 different cases possible. {abcd} - all 4 letters are distinct: \(C^4_8=70\); {aabc} - two letters are alike and other two are distinct: \(C^1_3*C^2_7=63\) (\(C^1_3\) is a # of ways to choose which two letters will be alike from 3 pairs and \(C^2_7\) # of ways to choose other two distinct letters from 7 letters which are left); {aabb} - two letters are alike and other two letters are also alike: \(C^2_3=3\) (\(C^3_3\) is a # of ways of choosing two pairs of alike letter from 3 such pairs);

Total=70+63+3=136.

Answer: C.

So, as you can see you can not just pick 4 letters with \(C^4_{11}\) and then divide it by some factorial as there are 3 different cases possible and each has its own factorial correction.

I would be thankful if someone could point out what is wrong in my solution: In total we have to select 4 out of 11, so its 11C4. each of the 3 couples can be substituted within itself, so for each we have 2!=2 inner combinations. counting out those duplicities: 11C4/(2!*2!*2!) = 41.25

Find the number of ways in which 4 letters may be selected from the word "Examination"? A. 66 B. 70 C. 136 D. 330 E. 4264

We have, 11 letters: {A, A, E, I, I, O, M, N, N, T, X}; Out of them there are 3 pairs: {A, A}, {I, I} and {N, N}. So, # of distinct letters is 8: {A, E, I, I, O, M, N, N, T, X}

As pointed out, there are 3 different cases possible. {abcd} - all 4 letters are distinct: \(C^4_8=70\); {aabc} - two letters are alike and other two are distinct: \(C^1_3*C^2_7=63\) (\(C^1_3\) is a # of ways to choose which two letters will be alike from 3 pairs and \(C^2_7\) # of ways to choose other two distinct letters from 7 letters which are left); {aabb} - two letters are alike and other two letters are also alike: \(C^2_3=3\) (\(C^3_3\) is a # of ways of choosing two pairs of alike letter from 3 such pairs);

Total=70+63+3=136.

Answer: C.

So, as you can see you can not just pick 4 letters with \(C^4_{11}\) and then divide it by some factorial as there are 3 different cases possible and each has its own factorial correction.

Hope it's clear.

Hi Bunuel, If the ques states that no repititions are possible, we will divide by factorial of no of time the letters are repeated to get the answer?Am i correct?Kindly clarify

I would be thankful if someone could point out what is wrong in my solution: In total we have to select 4 out of 11, so its 11C4. each of the 3 couples can be substituted within itself, so for each we have 2!=2 inner combinations. counting out those duplicities: 11C4/(2!*2!*2!) = 41.25

Find the number of ways in which 4 letters may be selected from the word "Examination"? A. 66 B. 70 C. 136 D. 330 E. 4264

We have, 11 letters: {A, A, E, I, I, O, M, N, N, T, X}; Out of them there are 3 pairs: {A, A}, {I, I} and {N, N}. So, # of distinct letters is 8: {A, E, I, I, O, M, N, N, T, X}

As pointed out, there are 3 different cases possible. {abcd} - all 4 letters are distinct: \(C^4_8=70\); {aabc} - two letters are alike and other two are distinct: \(C^1_3*C^2_7=63\) (\(C^1_3\) is a # of ways to choose which two letters will be alike from 3 pairs and \(C^2_7\) # of ways to choose other two distinct letters from 7 letters which are left); {aabb} - two letters are alike and other two letters are also alike: \(C^2_3=3\) (\(C^3_3\) is a # of ways of choosing two pairs of alike letter from 3 such pairs);

Total=70+63+3=136.

Answer: C.

So, as you can see you can not just pick 4 letters with \(C^4_{11}\) and then divide it by some factorial as there are 3 different cases possible and each has its own factorial correction.

Hope it's clear.

Hi Bunuel, If the ques states that no repititions are possible, we will divide by factorial of no of time the letters are repeated to get the answer?Am i correct?Kindly clarify

In this case we would be basically selecting 4 letters out of 8: {A, E, I, O, M, N, T, X}. Answer: \(C^4_8=70\)
_________________

I would be thankful if someone could point out what is wrong in my solution: In total we have to select 4 out of 11, so its 11C4. each of the 3 couples can be substituted within itself, so for each we have 2!=2 inner combinations. counting out those duplicities: 11C4/(2!*2!*2!) = 41.25

Find the number of ways in which 4 letters may be selected from the word "Examination"? A. 66 B. 70 C. 136 D. 330 E. 4264

We have, 11 letters: {A, A, E, I, I, O, M, N, N, T, X}; Out of them there are 3 pairs: {A, A}, {I, I} and {N, N}. So, # of distinct letters is 8: {A, E, I, I, O, M, N, N, T, X}

As pointed out, there are 3 different cases possible. {abcd} - all 4 letters are distinct: \(C^4_8=70\); {aabc} - two letters are alike and other two are distinct: \(C^1_3*C^2_7=63\) (\(C^1_3\) is a # of ways to choose which two letters will be alike from 3 pairs and \(C^2_7\) # of ways to choose other two distinct letters from 7 letters which are left); {aabb} - two letters are alike and other two letters are also alike: \(C^2_3=3\) (\(C^3_3\) is a # of ways of choosing two pairs of alike letter from 3 such pairs);

Total=70+63+3=136.

Answer: C.

So, as you can see you can not just pick 4 letters with \(C^4_{11}\) and then divide it by some factorial as there are 3 different cases possible and each has its own factorial correction.

Hope it's clear.

When is it ok to use the anagram method for such problems?

I would be thankful if someone could point out what is wrong in my solution: In total we have to select 4 out of 11, so its 11C4. each of the 3 couples can be substituted within itself, so for each we have 2!=2 inner combinations. counting out those duplicities: 11C4/(2!*2!*2!) = 41.25

Find the number of ways in which 4 letters may be selected from the word "Examination"? A. 66 B. 70 C. 136 D. 330 E. 4264

We have, 11 letters: {A, A, E, I, I, O, M, N, N, T, X}; Out of them there are 3 pairs: {A, A}, {I, I} and {N, N}. So, # of distinct letters is 8: {A, E, I, I, O, M, N, N, T, X}

As pointed out, there are 3 different cases possible. {abcd} - all 4 letters are distinct: \(C^4_8=70\); {aabc} - two letters are alike and other two are distinct: \(C^1_3*C^2_7=63\) (\(C^1_3\) is a # of ways to choose which two letters will be alike from 3 pairs and \(C^2_7\) # of ways to choose other two distinct letters from 7 letters which are left); {aabb} - two letters are alike and other two letters are also alike: \(C^2_3=3\) (\(C^3_3\) is a # of ways of choosing two pairs of alike letter from 3 such pairs);

Total=70+63+3=136.

Answer: C.

So, as you can see you can not just pick 4 letters with \(C^4_{11}\) and then divide it by some factorial as there are 3 different cases possible and each has its own factorial correction.

Hope it's clear.

When is it ok to use the anagram method for such problems?

I did 11! / 5!2!2!2! , but obviously incorrect

Any idea?

Thanks! Cheers J

11!/(2!2!2!) is the number of arrangements of the word "examination", which is not what the question is asking.
_________________

WE: Editorial and Writing (Journalism and Publishing)

Re: Find the number of ways in which 4 letters may be selected [#permalink]

Show Tags

03 Jul 2015, 23:29

I think the problem people are having with this question is in deciphering: This is a combination question where order of 'picking' does not matter. Then why do I've to group these similar letters.

Well I had this problem too, this is how I solved it: 1. Understand what the question is asking: Is it asking about me 'picking' the letters? Or is it asking me about 'arranging' these letters differently? Ans: Its asking about 'picking'. So there you go, 1 question down 2. DONOT forget that the formula \(nCr\) is for n 'different' things - So here, you HAVE TO group the similar letter into sets. 3. Ok, now you've grouped them, what should be done now? Well Since, you've grouped them, you can have different cases of how u now 'pick' ! -> Now, refer to what Bunuel said in his solution, and it'll make sense

Re: Find the number of ways in which 4 letters may be selected [#permalink]

Show Tags

24 Jul 2016, 09:12

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

Re: Find the number of ways in which 4 letters may be selected [#permalink]

Show Tags

08 Aug 2017, 01:57

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________