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:

Let's say we have 6 distinct objects, how many relatively different arrangements do we have if those objects should be placed in a circle.

The difference between placement in a row and that in a circle is following: if we shift all object by one position, we will get different arrangement in a row but the same relative arrangement in a circle. So, for the number of circular arrangements of n objects we have: \(R = \frac{n!}{n} = (n-1)!\) Tips and Tricks

Any problem in Combinatorics is a counting problem. Therefore, a key to solution is a way how to count the number of arrangements. It sounds obvious but a lot of people begin approaching to a problem with thoughts like "Should I apply C- or P- formula here?". Don't fall in this trap: define how you are going to count arrangements first, realize that your way is right and you don't miss something important, and only then use C- or P- formula if you need them.

Hi - I'm a little confused by the last part of the explanation above:

"here is a basket with 4 blue balls, 3 red balls and 2 yellow balls. The balls of the same color are identical. How many ways can a child pick balls out of this basket ?

Solution We combine techniques from the 2 cases above. Consider the blue balls as one entity and instead of asking the yes/no question, ask the question how many ways to choose the balls ? This is answered using the second case, and the answer is (4+1). Combining this with the ways to choose red and yellow balls, the overall ways to choose balls would be (4+1)*(3+1)*(2+1)."

What is the + 1 for and how can we just multiply the 3 sets - 4*3*2? Can't the child pick all 4 blue and no red etc?

A combination is an unordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(C^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n! 2. Now we have to exclude all arrangements of k objects (k!) and remaining (n-k) objects ((n-k)!) as the order of chosen k objects and remained (n-k) objects doesn't matter.

\(C^n_k = \frac{n!}{k!(n-k)!}\)

Permutation

A permutation is an ordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(P^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n! 2. Now we have to exclude all arrangements of remaining (n-k) objects ((n-k)!) as the order of remained (n-k) objects doesn't matter.

\(P^n_k = \frac{n!}{(n-k)!}\)

If we exclude order of chosen objects from permutation formula, we will get combination formula:

\(\frac{P^n_k}{k!} = C^n_k\)

Hello friends - this page seems to be the best find yet. I've been using Manhattan gmat books and their content on Combinatorics and Probability is pretty lacking so please excuse my rudimentary questions.

One topic that i'm having a very hard time grasping is the "ordered vs. unordered" set. Seems like Permutation is ordered and Combination is unordered. I have absolutely no clue what that means and more importantly, I can't connect the dots to figure out why it affects the equations the way it does?

A combination is an unordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(C^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n! 2. Now we have to exclude all arrangements of k objects (k!) and remaining (n-k) objects ((n-k)!) as the order of chosen k objects and remained (n-k) objects doesn't matter.

\(C^n_k = \frac{n!}{k!(n-k)!}\)

Permutation

A permutation is an ordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(P^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n! 2. Now we have to exclude all arrangements of remaining (n-k) objects ((n-k)!) as the order of remained (n-k) objects doesn't matter.

\(P^n_k = \frac{n!}{(n-k)!}\)

If we exclude order of chosen objects from permutation formula, we will get combination formula:

\(\frac{P^n_k}{k!} = C^n_k\)

Hello friends - this page seems to be the best find yet. I've been using Manhattan gmat books and their content on Combinatorics and Probability is pretty lacking so please excuse my rudimentary questions.

One topic that i'm having a very hard time grasping is the "ordered vs. unordered" set. Seems like Permutation is ordered and Combination is unordered. I have absolutely no clue what that means and more importantly, I can't connect the dots to figure out why it affects the equations the way it does?

Any help would be appreciated.

In how many way we can choose two letters out of {a, b, c}, of the order of the letters does not matter?

{a, b} {a, c} {b, c}

So, in 3 ways: \(C^2_3=3\).

In how many way we can choose two letters out of {a, b, c}, of the order of the letters matters?

A combination is an unordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(C^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n! 2. Now we have to exclude all arrangements of k objects (k!) and remaining (n-k) objects ((n-k)!) as the order of chosen k objects and remained (n-k) objects doesn't matter.

\(C^n_k = \frac{n!}{k!(n-k)!}\)

Permutation

A permutation is an ordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(P^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n! 2. Now we have to exclude all arrangements of remaining (n-k) objects ((n-k)!) as the order of remained (n-k) objects doesn't matter.

\(P^n_k = \frac{n!}{(n-k)!}\)

If we exclude order of chosen objects from permutation formula, we will get combination formula:

\(\frac{P^n_k}{k!} = C^n_k\)

Hello friends - this page seems to be the best find yet. I've been using Manhattan gmat books and their content on Combinatorics and Probability is pretty lacking so please excuse my rudimentary questions.

One topic that i'm having a very hard time grasping is the "ordered vs. unordered" set. Seems like Permutation is ordered and Combination is unordered. I have absolutely no clue what that means and more importantly, I can't connect the dots to figure out why it affects the equations the way it does?

Any help would be appreciated.

In how many way we can choose two letters out of {a, b, c}, of the order of the letters does not matter?

{a, b} {a, c} {b, c}

So, in 3 ways: \(C^2_3=3\).

In how many way we can choose two letters out of {a, b, c}, of the order of the letters matters?

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. _________________

This is the kickoff for my 2016-2017 application season. After a summer of introspect and debate I have decided to relaunch my b-school application journey. Why would anyone want...

Check out this awesome article about Anderson on Poets Quants, http://poetsandquants.com/2015/01/02/uclas-anderson-school-morphs-into-a-friendly-tech-hub/ . Anderson is a great place! Sorry for the lack of updates recently. I...

Sometimes Mom comes into town, you meet her at the airport to surprise her. Shenanigans ensue. You grab dinner and chat. You don’t write a long blog post that...