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 350,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:

How to identify perm or comb problem and with/w/o Repetition [#permalink]
09 May 2010, 00:45

1

This post was BOOKMARKED

Is there an easy to way to find out whether the problem is permutation (with or without repetition) or combinataion (with or without repetition)...? any examples would be appreciated.. when is the situation, they mix both perm and comb.....

Re: How to identify perm or comb problem and with/w/o Repetition [#permalink]
12 May 2010, 16:50

3

This post received KUDOS

Hi,

You should use a permutation when the order in which you are suppose to choose a number of objects from a set matters. As an example: In how many ways is it possible to arrange the letters of the word CAT in different 2-letter groups, where CA is different than AC (i.e., the order matters)?

\(3P52=\frac{3!}{(3-2)!}=\frac{3.2.1}{1!}=6\). The general permutation formula is given by \(nPm=\frac{n!}{(n-m)!}\). When both elements of the permutation are equal), \(nPn=n!\).

If the order in which the objects are chosen doesn't matter, you use combinations - the formula is very similar to the permutations formula, but you find one more factorial in the denominator: \(nCm=\frac{n!}{(n-m)!m!}\). Taking the same example, how many different 2-letter groups is it possible to get from the word CAT, considering that CA is the same as AC (i.e., the order doesn't matter)?

If there is repetition, i.e, if the is more than one particular element in the set, you should divide the permutation/combination value by the factorial of the number of objects that are identical. Examples:

How many different 5-letter words can be formed from the word APPLE? (note you have 2 Ps).

Re: How to identify perm or comb problem and with/w/o Repetition [#permalink]
13 May 2010, 22:11

Thanks for the reply...Can you share any example where perm and comb used together... I understand 'order' plays the role..but from the question, I cant really figure that out.. May be missing something..

Re: How to identify perm or comb problem and with/w/o Repetition [#permalink]
13 May 2010, 22:53

Very nice post! +1.

pepemelo wrote:

Hi,

You should use a permutation when the order in which you are suppose to choose a number of objects from a set matters. As an example: In how many ways is it possible to arrange the letters of the word CAT in different 2-letter groups, where CA is different than AC (i.e., the order matters)?

\(3P52=\frac{3!}{(3-2)!}=\frac{3.2.1}{1!}=6\). The general permutation formula is given by \(nPm=\frac{n!}{(n-m)!}\). When both elements of the permutation are equal), \(nPn=n!\).

If the order in which the objects are chosen doesn't matter, you use combinations - the formula is very similar to the permutations formula, but you find one more factorial in the denominator: \(nCm=\frac{n!}{(n-m)!m!}\). Taking the same example, how many different 2-letter groups is it possible to get from the word CAT, considering that CA is the same as AC (i.e., the order doesn't matter)?

If there is repetition, i.e, if the is more than one particular element in the set, you should divide the permutation/combination value by the factorial of the number of objects that are identical. Examples:

How many different 5-letter words can be formed from the word APPLE? (note you have 2 Ps).

Re: How to identify perm or comb problem and with/w/o Repetition [#permalink]
23 May 2010, 01:12

What would you use with the following problem? (Going off of memory, so I apologize if it sounds weird.)

You have four left socks and four right socks. All of the eight socks are jumbled into one big pile. If you draw socks out at random, what is the probability that you are able to make two pairs of left socks only, and two pairs of right socks only from the entire set of eight socks?

Let me know if I need to be more descriptive and I'll try to locate the problem...

gmatclubot

Re: How to identify perm or comb problem and with/w/o Repetition
[#permalink]
23 May 2010, 01:12